A Jacobi-Davidson type SVD method

    Research output: Contribution to journalArticleAcademicpeer-review

    45 Citations (Scopus)
    109 Downloads (Pure)

    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
    Original languageEnglish
    Pages (from-to)606-628
    JournalSIAM Journal on Scientific Computing
    Volume23
    Issue number2
    DOIs
    Publication statusPublished - 2001

    Fingerprint

    Dive into the research topics of 'A Jacobi-Davidson type SVD method'. Together they form a unique fingerprint.

    Cite this