Author: Gene H. Golub

Publication Overview

Publication period start: 1967
Number of co-authors: 6

Co-Authors

Number of publications with favourite co-authors

Productive Colleagues

Most productive colleagues in number of publications

Publications

Bartels, Richard H., Golub, Gene H. (1969): The simplex method of linear programming using LU decomposition. In Communications of the ACM, 12 (5) pp. 266-268. https://dl.acm.org/doi/10.1145/362946.362974
Bartels, Richard H., Golub, Gene H. (1969): Algorithm 350: simplex method procedure employing Lu decomposition [H]. In Communications of the ACM, 12 (5) pp. 275-278. https://dl.acm.org/doi/10.1145/362946.362982
Businger, Peter A., Golub, Gene H. (1969): Algorithm 358: singular value decomposition of a complex matrix [F1, 4, 5]. In Communications of the ACM, 12 (10) pp. 564-565. https://dl.acm.org/doi/10.1145/363235.363249
Bartels, Richard H., Golub, Gene H. (1968): Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an ov. In Communications of the ACM, 11 (6) pp. 401-406. https://dl.acm.org/doi/10.1145/363347.363364
Bartels, Richard H., Golub, Gene H. (1968): Algorithms: Algorithm 328: Chebyshev solution to an overdetermined linear system. In Communications of the ACM, 11 (6) pp. 428-430. https://dl.acm.org/doi/10.1145/363347.363389
Golub, Gene H., Robertson, T. N. (1967): A generalized Bairstow algorithm. In Communications of the ACM, 10 (6) pp. 371-373. https://dl.acm.org/doi/10.1145/363332.363376
Kamvar, Sepandar D., Haveliwala, Taher H., Manning, Christopher D., Golub, Gene H. (2003): Extrapolation methods for accelerating PageRank computations. In: Proceedings of the 2003 International Conference on the World Wide Web , 2003, . pp. 261-270. https://doi.acm.org/10.1145/775152.775190
Privacy Settings
By using this site, you accept our Cookie Policy and Terms of Use.
Customize
Accept all

Feel Stuck? Want Freedom?

Get one powerful email each week, like 326,076 others.

Learn to design a life you love.

Next email in
6
days
15
hrs
5
mins
23
secs