arrow
Return

Augmented implicitly restarted Lanczos bidiagonalization methods

delete2005-01-01
delete238
delete
OA
AI
J
James Baglama *
L
Lothar Reichel
DOI:10.1137/04060593Xdelete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
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.
Keywords:
singular value computation
partial singular value decomposition
iterative method
large-scale computation
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

SIAM Journal on Scientific Computing cover
SIAM Journal on Scientific Computing
IF:
2.6
Papers:
5.1K
Citations:
1.8W

Organization

No organization information available