Answers are grounded in this paper and cite their sources.
Any real matrix A has associated with it the real symmetric matrix \[ B ≡ ({array}{*{20}c} 0 \\ {A^T } \\ {array} {array}{*{20}c} A \\ 0 \\ {array} ) \] whose positive eigenvalues are the nonzero singular values of A. Using B and our Lanczos algorithms for computing eigenvalues and eigenvectors of very large real symmetric matrices, we obtain an algorithm for computing singular values and singular vectors of large sparse real matrices. This algorithm provides a means for computing the largest and the smallest or even all of the distinct singular values of many matrices
No takes yet. Share an insight, caveat, or question.
Cullum et al. (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: