The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Preconditioning Lanczos Approximations to the Matrix Exponential
Open accessAbstract
The Lanczos method is an iterative procedure to compute an orthogonal basis for the Krylov subspace generated by a symmetric matrix A and a starting vector v. An interesting application of this method is the computation of the matrix exponential $\exp(-\tau A)v$. This vector plays an important role in the solution of parabolic equations where A results from some form of discretization of an elliptic operator. In the present paper we will argue that for these applications the convergence behavior of this method can be unsatisfactory. We will propose a modified method that resolves this by a simple preconditioned transformation at the cost of an inner-outer iteration. A priori error bounds are presented that are independent of the norm of A. This shows that the worst case convergence speed is independent of the mesh width in the spatial discretization of the elliptic operator. We discuss, furthermore, a posteriori error estimation and the tuning of the coupling between the inner and outer iteration. We conclude with several numerical experiments with the proposed method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
Moler, C., & Van Loan, C. (2003) · SIAM Review · doi:10.1137/s00361445024180 · Cited by 2,357
On Krylov Subspace Approximations to the Matrix Exponential Operator
Hochbruck, M., & Lubich, C. (1997) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142995280572 · Cited by 795
Self-citation
Cited by
Hochbruck, M., & Ostermann, A. (2010) · Acta Numerica · doi:10.1017/s0962492910000048 · Cited by 1,061
Self-citationExplicit Exponential Runge--Kutta Methods for Semilinear Parabolic Problems
Hochbruck, M., & Ostermann, A. (2005) · SIAM Journal on Numerical Analysis · doi:10.1137/040611434 · Cited by 444
Self-citation
Metadata
- Authors
- van den Eshof, J., & Hochbruck, M.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2006-01
- Volume
- 27
- Issue
- 4
- Pages
- 1438-1457
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2075247318
- Cited by
- 217
- References
- 2
- FWCI
- 10.93
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Preconditioning Lanczos Approximations to the Matrix Exponential. https://app.cochat.ai/papers/10.1137/040605461
- The paper
- van den Eshof, J., & Hochbruck, M. (2006). Preconditioning Lanczos Approximations to the Matrix Exponential. SIAM Journal on Scientific Computing. https://doi.org/10.1137/040605461
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.