The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Error Estimates and Evaluation of Matrix Functions via the Faber Transform
Abstract
The need to evaluate expressions of the form $f(A)$ or $f(A)b$, where f is a nonlinear function, A is a large sparse $n\times n$ matrix, and b is an n-vector, arises in many applications. This paper describes how the Faber transform applied to the field of values of A can be used to determine improved error bounds for popular polynomial approximation methods based on the Arnoldi process. Applications of the Faber transform to rational approximation methods and, in particular, to the rational Arnoldi process also are discussed.
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
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
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
Expokit: a software package for computing matrix exponentials
Sidje, R. B. (1998) · ACM Transactions on Mathematical Software · doi:10.1145/285861.285868 · Cited by 781
Cited by
Computational Methods for Linear Matrix Equations
Simoncini, V. (2016) · SIAM Review · doi:10.1137/130912839 · Cited by 487
Metadata
- Authors
- Beckermann, B., & Reichel, L.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 2009-01
- Volume
- 47
- Issue
- 5
- Pages
- 3849-3883
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2017710275
- Cited by
- 159
- References
- 4
- FWCI
- 11.27
- 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
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.