The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
Abstract
Matrix functions are a central topic of linear algebra, and problems of their numerical approximation appear increasingly often in scientific computing. We review various rational Krylov methods for the computation of large‐scale matrix functions. Emphasis is put on the rational Arnoldi method and variants thereof, namely, the extended Krylov subspace method and the shift‐and‐invert Arnoldi method, but we also discuss the nonorthogonal generalized Leja point (or PAIN) method. The issue of optimal pole selection for rational Krylov methods applied for approximating the resolvent and exponential function, and functions of Markov type, is treated in some detail. (© 2013 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Functions of Matrices: Theory and Computation
Higham, N. J. (2008) · doi:10.1137/1.9780898717778 · Cited by 2,113
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
Cited by
Computational Methods for Linear Matrix Equations
Simoncini, V. (2016) · SIAM Review · doi:10.1137/130912839 · Cited by 487
Metadata
- Authors
- Güttel, S.
- Venue
- GAMM-Mitteilungen
- Publisher
- Wiley
- Published
- 2013-08
- Volume
- 36
- Issue
- 1
- Pages
- 8-31
- ISSN
- 0936-7195 (ISSN-L)
- 1522-2608
- OpenAlex
- W2117799929
- Cited by
- 172
- References
- 2
- FWCI
- 18.06
- Type
- journal article
- Language
- en
- Open access
- closed
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: Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection. https://app.cochat.ai/papers/10.1002/gamm.201310002
- The paper
- Güttel, S. (2013). Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection. GAMM-Mitteilungen. https://doi.org/10.1002/gamm.201310002
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.