The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
The Scaling and Squaring Method for the Matrix Exponential Revisited
Abstract
The scaling and squaring method is the most widely used method for computing the matrix exponential, not least because it is the method implemented in MATLAB's {\tt expm} function. The method scales the matrix by a power of 2 to reduce the norm to order 1, computes a Padé approximant to the matrix exponential, and then repeatedly squares to undo the effect of the scaling. We give a new backward error analysis of the method (in exact arithmetic) that employs sharp bounds for the truncation errors and leads to an implementation of essentially optimal efficiency. We also give new rounding error analysis that shows the computed Padé approximant of the scaled matrix to be highly accurate. For IEEE double precision arithmetic the best choice of degree of Padé approximant turns out to be 13, rather than the 6 or 8 used by previous authors. Our implementation of the scaling and squaring method always requires at least two fewer matrix multiplications than {\tt expm} when the matrix norm exceeds 1, which can amount to a 37% saving in the number of multiplications, and it is typically more accurate, owing to the fewer required squarings. We also investigate a different scaling and squaring algorithm proposed by Najfeld and Havel that employs a Padé approximation to the function $x \coth(x)$. This method is found to be essentially a variation of the standard one with weaker supporting error analysis.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Horn, R. A., & Johnson, C. R. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511840371 · Cited by 9,319
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
Varga, R. S. (2000) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-05156-2 · Cited by 5,811
Benchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
Self-citationDigital control of dynamic systems
Franklin, G. F., Workman, M. L., & Powell, D. (1980) · International Linear Collider · Cited by 3,188
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
Accuracy and stability of numerical algorithms
(1996) · Choice Reviews Online · doi:10.5860/choice.34-0981 · Cited by 2,072
Nineteen Dubious Ways to Compute the Exponential of a Matrix
Moler, C., & Van Loan, C. (1978) · SIAM Review · doi:10.1137/1020098 · Cited by 1,526
Subgraph centrality in complex networks
Estrada, E., & Rodríguez-Velázquez, J. A. (2005) · Physical Review E · doi:10.1103/physreve.71.056103 · Cited by 1,260
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
Generalized Runge-Kutta Processes for Stable Systems with Large Lipschitz Constants
Lawson, J. D. (1967) · SIAM Journal on Numerical Analysis · doi:10.1137/0704033 · Cited by 328
Frazer (1938) · Cambridge University Press eBooks · doi:10.1017/cbo9780511629211 · Cited by 283
Numerical Computation of the Matrix Exponential with Accuracy Estimate
Ward, R. C. (1977) · SIAM Journal on Numerical Analysis · doi:10.1137/0714039 · Cited by 231
Derivatives of the Matrix Exponential and Their Computation
Najfeld, I., & Havel, T. F. (1995) · Advances in Applied Mathematics · doi:10.1006/aama.1995.1017 · Cited by 211
A 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-citationCondition Estimates for Matrix Functions
Kenney, C., & Laub, A. J. (1989) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0610014 · Cited by 133
Orthogonal Eigenvectors and Relative Gaps
Dhillon, I. S., & Parlett, B. Ν. (2003) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479800370111 · Cited by 121
A numerical study of large sparse matrix exponentials arising in Markov chains
Sidje, R. B., & Stewart, W. J. (1999) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(98)00062-0 · Cited by 90
A 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
Padé approximation for the exponential of a block triangular matrix
Dieci, L., & Papini, A. (2000) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(00)00042-2 · Cited by 50
A Study of the Matrix ExponentialPreprint
Loan, V., & Charles, F. (2006) · MIMS EPrints (University of Southampton) · Cited by 15
Matrix decompositions of two-dimensional nuclear magnetic resonance spectra.
Havel, T. F., Najfeld, I., & Yang, J. (1994) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.91.17.7962 · Cited by 15
Cited by
Deformable medical image registration: a survey
Sotiras, A., Davatzikos, C., & Paragios, N. (2013) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2013.2265603 · Cited by 1,587
Geometric Means in a Novel Vector Space Structure on Symmetric Positive‐Definite Matrices
Arsigny, V., Fillard, P., Pennec, X., & Ayache, N. (2007) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/050637996 · Cited by 819
Szalay, P. G., Müller, T., Gidofalvi, G., Lischka, H., & Shepard, R. (2012) · Chemical Reviews · doi:10.1021/cr200137a · Cited by 725
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-citationA Log-Euclidean Framework for Statistics on Diffeomorphisms
Arsigny, V., Commowick, O., Pennec, X., & Ayache, N. (2006) · Lecture Notes in Computer Science · doi:10.1007/11866565_113 · Cited by 432
Metadata
- Authors
- Higham, N. J.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2005-01
- Volume
- 26
- Issue
- 4
- Pages
- 1179-1193
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2120516507
- Cited by
- 538
- References
- 24
- FWCI
- 11.30
- 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.