Augmented Implicitly Restarted Lanczos Bidiagonalization Methods 论文
2005SIAM Journal on Scientific Computing引用 353
Matrix Theory and AlgorithmsStatistical and numerical algorithmsScientific Research and Discoveries
摘要
New restarted Lanczos bidiagonalization methods for the computation of a few of the largest or smallest singular values of a large matrix are presented. Restarting is carried out by augmentation of Krylov subspaces that arise naturally in the standard Lanczos bidiagonalization method. The augmenting vectors are associated with certain Ritz or harmonic Ritz vectors. Computed examples show the new methods to be competitive with available schemes.