Error bounds for the Lanczos methods for approximating matrix exponentials

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

In this paper, we present new error bounds for the Lanczos method and the shift-andinvert Lanczos method for computing e-τAν for a large sparse symmetric positive semidefinite matrix A. Compared with the existing error analysis for these methods, our bounds relate the convergence to the condition numbers of the matrix that generates the Krylov subspace. In particular, we show that the Lanczos method will converge rapidly if the matrix A is well-conditioned, regardless of what the norm of τ A is. Numerical examples are given to demonstrate the theoretical bounds.

Original languageEnglish
Pages (from-to)68-87
Number of pages20
JournalSIAM Journal on Numerical Analysis
Volume51
Issue number1
DOIs
StatePublished - 2013

Keywords

  • Krylov subspace method
  • Lanczos method
  • Matrix exponential

ASJC Scopus subject areas

  • Numerical Analysis
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Error bounds for the Lanczos methods for approximating matrix exponentials'. Together they form a unique fingerprint.

Cite this