CoChat

On Krylov Subspace Approximations to the Matrix Exponential Operator

Open access
Hochbruck, Marlis, Lubich, Christian · 1997 · SIAM Journal on Numerical Analysis

The DOI matches its Crossref record; 29 of the 30 references it cites were found in a registry or an index, and 1 are not checked yet.

Abstract

Krylov subspace methods for approximating the action of matrix exponentials are analyzed in this paper. We derive error bounds via a functional calculus of Arnoldi and Lanczos methods that reduces the study of Krylov subspace approximations of functions of matrices to that of linear systems of equations. As a side result, we obtain error bounds for Galerkin-type Krylov methods for linear equations, namely, the biconjugate gradient method and the full orthogonalization method. For Krylov approximations to matrix exponentials, we show superlinear error decay from relatively small iteration numbers onwards, depending on the geometry of the numerical range, the spectrum, or the pseudospectrum. The convergence to exp$(\tau A)v$ is faster than that of corresponding Krylov methods for the solution of linear equations $(I-\tau A)x=v$, which usually arise in the numerical solution of stiff ordinary differential equations (ODEs). We therefore propose a new class of time integration methods for large systems of nonlinear differential equations which use Krylov approximations to the exponential function of the Jacobian instead of solving linear or nonlinear systems of equations in every time step.

Overview

Integrity signals

Registry

Crossref · 10.1137/s0036142995280572

Cites

29 of 30 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Research works printed but not linked: 5

  1. A. Friedli, Verallgemeinerte Runge‐Kutta Verfahren zur Lösung steifer Differentialgleichungen , in Lecture Notes in Mathematics 631, Springer‐Verlag, Berlin, 1978, pp. 35–50. · doi:10.1007/bfb0067462
  2. Hochbruck M., 1997, SIAM J. Sci. Comput., 18
  3. Knizhnerman L. A., 1991, Comput. Math. and Math. Phys., 31, 1
  4. Knizhnerman L. A., 1992, Comput. Math. and Math. Phys., 32, 1199
  5. D. R. Taylor, Analysis of the look‐ahead Lanczos algorithm , Ph.D. thesis, University of California at Berkeley, Berkeley, CA, 1982.

Cited by

See all 810

Metadata

Authors
Hochbruck, M., & Lubich, C.
Affiliations
University of Tübingen (DE)
Venue
SIAM Journal on Numerical Analysis
Published
1997-10
Volume
34
Issue
5
Pages
1911-1925
ISSN
  • 0036-1429 (ISSN-L)
  • 1095-7170
OpenAlex
W1984347942
Cited by
795
References
30
Citations by year
2026: 27 · 2025: 23 · 2024: 19 · 2023: 23 · 2022: 23 · 2021: 37 · 2020: 42 · 2019: 41 · 2018: 46 · 2017: 41 · 2016: 42 · 2015: 32 · 2014: 44 · 2013: 44 · 2012: 30
FWCI
14.18
Type
journal article
Language
en
Open access
Licence
other-oa
Locations
  • SIAM Journal on Numerical Analysis (publishedVersion)
  • Repository KITopen (Karlsruhe Institute of Technology) (publishedVersion)
  • KITopen (other-oa)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Mathematics › Numerical Analysis › Numerical Solvers for Ordinary Differential Equations
  • Physical Sciences › Engineering › Computational Mechanics › Advanced Numerical Methods in Computational Mathematics
Keywords
matrix exponential, Krylov subspace methods, Arnoldi method, Lanczos method, functional calculus, error bounds, biconjugate gradient method, numerical range, pseudospectra, superlinear convergence, stiff ordinary differential equations, time integration methods, nonlinear differential equations, Jacobian matrix

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.