Journal
NUMERICAL ALGORITHMS
Volume 43, Issue 3, Pages 251-272Publisher
SPRINGER
DOI: 10.1007/s11075-006-9057-z
Keywords
partial singular value decomposition; restarted iterative method; implicit shifts; augmentation
Categories
Ask authors/readers for more resources
The problem of computing a few of the largest or smallest singular values and associated singular vectors of a large matrix arises in many applications. This paper describes restarted block Lanczos bidiagonalization methods based on augmentation of Ritz vectors or harmonic Ritz vectors by block Krylov subspaces.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available