We present an efficient algorithm for computing a few extreme singular values of a large sparse m×n matrix C. Our algorithm is based on reformulating the singular value problem as an eigenvalue problem for CTC. To address the clustering of the singular values, we develop an inverse-free preconditioned Krylov subspace method to accelerate convergence. We consider preconditioning that is based on robust incomplete factorizations, and we discuss various implementation issues. Extensive numerical tests are presented to demonstrate efficiency and robustness of the new algorithm.

Document Type


Publication Date


Notes/Citation Information

Published in Electronic Transactions on Numerical Analysis, v. 42, p. 197-221.

Copyright © 2014, Kent State University.

The copyright holder has granted the permission for posting the article here.

Funding Information

The first author is supported in part by NSF under Grant DMS-1317424. The second author is supported in part by NSF under Grant DMS-1317424 and DMS-1318633.

Included in

Mathematics Commons