Key points are not available for this paper at this time.
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.
Golub et al. (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: