Limited Memory Subspace Acceleration for Computing Dominant Singular Values and Vectors
Chinese Academy of Sciences
Many data-related applications utilize principal component analysis and/or data dimension reduction techniques that require efficiently computing dominant part of singular value decompositions (SVD) of very large matrices which are also very dense. In our talk, we introduce a limited memory block krylov subspace optimization method which remarkablely accelerate the traditional simultaneous iteration scheme. We present extensive numerical results comparing the algorithm with some state-of-the-art SVD solvers. Our tests indicate that the proposed method can provide better performance over a range of dense problem classes under the MATLAB environment. We also present some convergence properties of our algorithm.
Tuesday, April 5, 2011
11:00AM AP&M 2402
Center for Computational Mathematics9500 Gilman Dr. #0112La Jolla, CA 92093-0112Tel: (858)534-9813