Abstract
We present a block Lanczos method for computing the greatest singular values and associated vectors of a large and sparse matrix, say A. Our algorithm does not transform A but accesses it through a user-supplied routine that computes the product AX or A tX for a given matrix X. This paper includes a discussion of the various ways to compute the singular-value decomposition of an upper triangular band matrix, this problem arises as a subproblem to be solved in the block Lanczos procedure.
Original language | English (US) |
---|---|
Pages (from-to) | 149-169 |
Number of pages | 21 |
Journal | ACM Transactions on Mathematical Software (TOMS) |
Volume | 7 |
Issue number | 2 |
DOIs | |
State | Published - Jun 1 1981 |
Keywords
- block Lanczos method
- large sparse matrtx
- singular values
- singular vectors
- smgular-value decomposltmn
- upper triangular band matrix
ASJC Scopus subject areas
- Software
- Applied Mathematics