Implementation of a restarted Krylov subspace method for the evaluation of matrix functions

Martin Afanasjew, Michael Eiermann, Oliver G. Ernst, Stefan Güttel

    Research output: Contribution to journalArticlepeer-review

    Abstract

    A new implementation of restarted Krylov subspace methods for evaluating f (A) b for a function f, a matrix A and a vector b is proposed. In contrast to an implementation proposed previously, it requires constant work and constant storage space per restart cycle. The convergence behavior of this scheme is discussed and a new stopping criterion based on an error indicator is given. The performance of the implementation is illustrated for three parabolic initial value problems, requiring the evaluation of exp (A) b. © 2008 Elsevier Inc. All rights reserved.
    Original languageEnglish
    Pages (from-to)2293-2314
    Number of pages21
    JournalLinear Algebra and its Applications
    Volume429
    Issue number10
    DOIs
    Publication statusPublished - 1 Nov 2008

    Keywords

    • Krylov subspace approximation
    • Matrix function
    • Polynomial interpolation
    • Rational approximation
    • Restarted Arnoldi/Lanczos method
    • Stopping criterion based on error indicator

    Fingerprint

    Dive into the research topics of 'Implementation of a restarted Krylov subspace method for the evaluation of matrix functions'. Together they form a unique fingerprint.

    Cite this