Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Golub et al. (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: