Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions
Abstract
In many data-intensive applications, the use of principal component analysis (PCA) and other related techniques is ubiquitous for dimension reduction, data mining or other transformational purposes. Such transformations often require efficiently, reliably and accurately computing dominant singular value decompositions (SVDs) of large unstructured matrices. In this paper, we propose and study a subspace optimization technique to significantly accelerate the classic simultaneous iteration method. We analyze the convergence of the proposed algorithm, and numerically compare it with several state-of-the-art SVD solvers under the MATLAB environment. Extensive computational results show that on a wide range of large unstructured matrices, the proposed algorithm can often provide improved efficiency or robustness over existing algorithms.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 22, 2012
- Accession Number
- ADA580501
Entities
People
- Xin Liu
- Yin Zhang
- Zaiwen Wen
Organizations
- Rice University