Computing Singular Values of Large Matrices with an Inverse-Free Preconditioned Krylov Subspace Method
Computing Singular Values of Large Matrices with an Inverse-Free Preconditioned Krylov Subspace Method
复制标题
DOI：
--
复制
发表时间：
2014
影响因子：
1.3
通讯作者：
Qiao Liang;Q. Ye
中科院分区：
文献类型：
--
作者：
Qiao Liang;Q. Ye
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 CC. 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.
