The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
A New Scaling and Squaring Algorithm for the Matrix Exponential
Abstract
The scaling and squaring method for the matrix exponential is based on the approximation $e^A \approx (r_m(2^{-s}A))^{2^s}$, where $r_m(x)$ is the $[m/m]$ Padé approximant to $e^x$ and the integers m and s are to be chosen. Several authors have identified a weakness of existing scaling and squaring algorithms termed overscaling, in which a value of s much larger than necessary is chosen, causing a loss of accuracy in floating point arithmetic. Building on the scaling and squaring algorithm of Higham [SIAM J. Matrix Anal. Appl., 26 (2005), pp. 1179–1193], which is used by the MATLAB function expm, we derive a new algorithm that alleviates the overscaling problem. Two key ideas are employed. The first, specific to triangular matrices, is to compute the diagonal elements in the squaring phase as exponentials instead of from powers of $r_m$. The second idea is to base the backward error analysis that underlies the algorithm on members of the sequence $\{\|A^k\|^{1/k}\}$ instead of $\|A\|$, since for nonnormal matrices it is possible that $\|A^k\|^{1/k}$ is much smaller than $\|A\|$, and indeed this is likely when overscaling occurs in existing algorithms. The terms $\|A^k\|^{1/k}$ are estimated without computing powers of A by using a matrix 1-norm estimator in conjunction with a bound of the form $\|A^k\|^{1/k} \le \max\bigl( \|A^p\|^{1/p}, \|A^q\|^{1/q} \bigr)$ that holds for certain fixed p and q less than k. The improvements to the truncation error bounds have to be balanced by the potential for a large $\|A\|$ to cause inaccurate evaluation of $r_m$ in floating point arithmetic. We employ rigorous error bounds along with some heuristics to ensure that rounding errors are kept under control. Our numerical experiments show that the new algorithm generally provides accuracy at least as good as the existing algorithm of Higham at no higher cost, while for matrices that are triangular or cause overscaling it usually yields significant improvements in accuracy, cost, or both.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
Self-citationFunctions of Matrices: Theory and Computation
Higham, N. J. (2008) · doi:10.1137/1.9780898717778 · Cited by 2,113
Self-citationComputing integrals involving the matrix exponential
Van Loan, C. (1978) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1978.1101743 · Cited by 832
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
The Scaling and Squaring Method for the Matrix Exponential Revisited
Higham, N. J. (2005) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/04061101x · Cited by 538
Self-citationA Schur-Parlett Algorithm for Computing Matrix Functions
Davies, P. I., & Higham, N. J. (2003) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479802410815 · Cited by 167
Self-citationA Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra
Higham, N. J., & Françoise Tisseur, B. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899356080 · Cited by 159
Self-citationAl-Mohy, A. H., & Higham, N. J. (2009) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/080716426 · Cited by 96
Self-citationA Schur--Fréchet Algorithm for Computing the Logarithm and Exponential of a Matrix
Kenney, C., & Laub, A. J. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896300334 · Cited by 66
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
Self-citationHigham, N. J. (2006) · Handbook of Linear Algebra · doi:10.1201/9781420010572-11 · Cited by 258
Self-citationMagnetic eigenmaps for community detection in directed networks
Fanuel, M., Alaíz, C. M., & Suykens, J. A. K. (2017) · Physical Review E · doi:10.1103/physreve.95.022302 · Cited by 50
Metadata
- Authors
- Al-Mohy, A. H., & Higham, N. J.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2010-01
- Volume
- 31
- Issue
- 3
- Pages
- 970-989
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W1990647940
- Cited by
- 355
- References
- 12
- FWCI
- 6.76
- 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: A New Scaling and Squaring Algorithm for the Matrix Exponential. https://app.cochat.ai/papers/10.1137/09074721x
- The paper
- Al-Mohy, A. H., & Higham, N. J. (2010). A New Scaling and Squaring Algorithm for the Matrix Exponential. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/09074721x
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.