The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Algorithm 919: A Krylov Subspace Algorithm for Evaluating the ϕ-Functions Appearing in Exponential Integrators
Open accessAbstract
We develop an algorithm for computing the solution of a large system of linear ordinary differential equations (ODEs) with polynomial inhomogeneity. This is equivalent to computing the action of a certain matrix function on the vector representing the initial condition. The matrix function is a linear combination of the matrix exponential and other functions related to the exponential (the so-called ϕ -functions). Such computations are the major computational burden in the implementation of exponential integrators, which can solve general ODEs. Our approach is to compute the action of the matrix function by constructing a Krylov subspace using Arnoldi or Lanczos iteration and projecting the function on this subspace. This is combined with time-stepping to prevent the Krylov subspace from growing too large. The algorithm is fully adaptive: it varies both the size of the time steps and the dimension of the Krylov subspace to reach the required accuracy. We implement this algorithm in the matlab function phipm and we give instructions on how to obtain and use this function. Various numerical experiments show that the phipm function is often significantly more efficient than the state-of-the-art.
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
Trefethen, L. N., & Bau, III (1997) · doi:10.1137/1.9780898719574 · Cited by 3,301 · cited 1×
“matrix by Tm, and we only need traverse the i-loop in the Arnoldi iteration twice: once for i = j − 1 and once for i = j. The resulting algorithm is known as the Lanczos iteration (Algorithm 2); see Trefethen and Bau (1997, Alg 36.1). It takes 3(2m−1)n flops and m products of A with a vector to compute Tm and Vm when A…”
InfluentialNineteen 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
Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators
Al-Mohy, A. H., & Higham, N. J. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/100788860 · Cited by 466
Du, Q., Ju, L., Li, X., & Qiao, Z. (2021) · SIAM Review · doi:10.1137/19m1243750 · Cited by 294
Rams, M., Wojtowicz, G., Sinha, A., & Hasik, J. (2025) · SciPost Physics Codebases · doi:10.21468/scipostphyscodeb.52 · Cited by 16
Metadata
- Authors
- Niesen, J., & Wright, W. M.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2012-04
- Volume
- 38
- Issue
- 3
- Pages
- 1-19
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2018931076
- Cited by
- 200
- References
- 5
- FWCI
- 11.59
- 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: Algorithm 919: A Krylov Subspace Algorithm for Evaluating the ϕ-Functions Appearing in Exponential Integrators. https://app.cochat.ai/papers/10.1145/2168773.2168781
- The paper
- Niesen, J., & Wright, W. M. (2012). Algorithm 919: A Krylov Subspace Algorithm for Evaluating the ϕ-Functions Appearing in Exponential Integrators. ACM Transactions on Mathematical Software. https://doi.org/10.1145/2168773.2168781
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.