A Jacobi–Davidson type SVD method (2001)
| Venue: | SIAM J. Sci. Comput |
| Citations: | 15 - 5 self |
BibTeX
@ARTICLE{Hochstenbach01ajacobi–davidson,
author = {Michiel E. Hochstenbach},
title = {A Jacobi–Davidson type SVD method},
journal = {SIAM J. Sci. Comput},
year = {2001},
volume = {23},
pages = {606--628}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We discuss a new method for the iterative computation of a portion of the singular values and vectors of a large sparse matrix. Similar to the Jacobi–Davidson method for the eigenvalue problem, we compute in each step a correction by (approximately) solving a correction equation. We give a few variants of this Jacobi–Davidson SVD (JDSVD) method with their theoretical properties. It is shown that the JDSVD can be seen as an accelerated (inexact) Newton scheme. We experimentally compare the method with some other iterative SVD methods. Key words. Jacobi–Davidson, singular value decomposition (SVD), singular values, singular vectors, norm, augmented matrix, correction equation, (inexact) accelerated Newton, improving singular values AMS subject classifications. 65F15 (65F35) PII. S1064827500372973
