Gene H. Golub
- 1 CULLUM, J. The simultaneous computation of a few algebraically largest and smallest elgenvalues of a large, sparse, symmetric matrix. Rep. RC 6827, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1977.Google Scholar
- 2 CULLUM, J., AND DONATH, W.E. A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large, sparse, real symmetric matmces. In Proc. 1974 IEEE Conf on Decas~on and Control, Phoenix, Ariz., 1974, pp. 505-509.Google Scholar
- 3 CULLUM, J., AND WILLOUGHBY, R.A. Computing singular values and corresponding singular vectors of large matrices by Lanczos tridiagonalization. Rep. RC 8200, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1980.Google Scholar
- 4 GENTLEMAN, W.M. Least squares computations by Givens transformations w~thout square roots. JIMA 12 (1973), 329-336.Google Scholar
- 5 GOLUB, G H, AND KAHAN, W Calculating the singular values and pseudo-inverse of a matrix. SIAM J. Numer Anal. 2 (1965), 205-224.Google Scholar
- 6 GOLUB, G.H., AND LUK, F T. Singular value decomposition: Apphcations and computations. ARO Rep. 77-1, in Trans. 22nd Conf. of Army Mathematw~ans, 1977, pp. 577-605.Google Scholar
- 7 GOLUB, G.H., LUK, F.T., AND OVERTON, M.L. A block Lanczos method to compute the singular values and corresponding singular vectors of a matrix. Rep. STAN-CS-77-635, Comput. Sci. Dep., Stanford Umv., Stanford, Calif., 1977. Google Scholar
- 8 GOLUB, G.H., AND REINSCH, C Singular value decomposition and least squares solutions. Numer. Math. 14 (1970), 403-420.Google Scholar
- 9 GOLUB, G H., AND UNDERWOOD, R. The block Lanczos method for computing elgenvalues. In Mathematical Software III, J.R. Rice (Ed.), Academic Press, New York, 1977, pp. 361-377.Google Scholar
- 10 LANCZOS, C L~near D~fferential Operators Van Nostrand, London, 1961.Google Scholar
- 11 LEwis, J G Algorithms for sparse matrix eigenvalue problems. Ph.D. thesis, Rep. STAN-CS- 77-595, Comput. Scl Dep, Stanford Umv., Stanford, Calff, 1972 Google Scholar
- 12 ORTEGA, J.M. Numerical Analys~s: A Second Course Academic Press, New York, 1972.Google Scholar
- 13 PAIGE, C.C Bidiagonahzation of matrices and solution of hnear equations. SIAM J. Numer. Anal. 11 (1974), 197-209.Google Scholar
- 14 PALMER, J.F. Conjugate direction methods and parallel computing. Ph.D. thesis, Comput. Sci. Dep., Stanford Univ., Stanford, Calif., 1974. Google Scholar
- 15 RUHE, A. Implementation aspects of band Lanczos algorithms for computation of elgenvalues of large sparse symmetric matrices Rep., Dep of Mathematics, Umv. California, San Diego, Feb. 1978.Google Scholar
- 16 RUTISHAUSER, H. On Jacobi rotation patterns. In Proc. Syrup. Applled Math, vol. 15, 1963, pp. 219-239.Google Scholar
- 17 STEWART, G W. Error and perturbation bounds for subspaces associated with certain elgenvalue problems. SIAM Rev 15 (1973), 727-764Google Scholar
- 18 UNDERWOOD, 1~. An iterative block Lanczos method for the solution of large sparse symmetric eigenproblems. Ph.D. thems, Rep STAN-CS-75-496, Comput. Scl. Dep., Stanford Univ., Stanford, Calif., 1975. Google Scholar
- 19 VAN LOAN, C. Generalized singular values with algorithms and applications. Ph.D. thesis, Univ. of Michigan, Ann Arbor, 1973. Google Scholar
- 20 WILKINSON, J.H. The Algebraic E~genvalue Problem. Clarendon Press, Oxford, 1965 Google Scholar
Index Terms
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
Recommendations
A Lanczos Algorithm for Computing Singular Values and Vectors of Large Matrices
Any real matrix A has associated with it the real symmetric matrix \[ B \equiv \left(\begin{array}{*{20}c} 0 \\ {A^T } \\ \end{array} \begin{array}{*{20}c} A \\ 0 \\ \end{array} \right) \] whose positive eigenvalues are the nonzero ...
Block Householder computation of sparse matrix singular values
SpringSim '10: Proceedings of the 2010 Spring Simulation MulticonferenceThis paper introduces block Householder reduction of a rectangular sparse matrix to small band upper triangular form. The computation accesses a sparse matrix only for sparse matrix dense matrix (SMDM) multiplications and for "just in time" extractions ...
Comments