Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
Applied Numerical Mathematics - Numerical algorithms, parallelism and applications
Correlating summarization of multi-source news with k-way graph bi-clustering
ACM SIGKDD Explorations Newsletter
Latent linkage semantic kernels for collective classification of link data
Journal of Intelligent Information Systems
Optical computing for fast light transport analysis
ACM SIGGRAPH Asia 2010 papers
Block Householder computation of sparse matrix singular values
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Locating coalescing singular values of large two-parameter matrices
Mathematics and Computers in Simulation
Markov methods for hierarchical coarse-graining of large protein dynamics
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Numerical Algorithms
Journal of Computational and Applied Mathematics
Low rank approximation of the symmetric positive semidefinite matrix
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
Low-rank approximation of large and/or sparse matrices is important in many applications, and the singular value decomposition (SVD) gives the best low-rank approximations with respect to unitarily-invariant norms. In this paper we show that good low-rank approximations can be directly obtained from the Lanczos bidiagonalization process applied to the given matrix without computing any SVD. We also demonstrate that a so-called one-sided reorthogonalization process can be used to maintain an adequate level of orthogonality among the Lanczos vectors and produce accurate low-rank approximations. This technique reduces the computational cost of the Lanczos bidiagonalization process. We illustrate the efficiency and applicability of our algorithm using numerical examples from several applications areas.