The Scaling and Squaring Method for the Matrix Exponential Revisited

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 Pade 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 Pade approximant of the scaled matrix to be highly accurate. For IEEE double precision arithmetic the best choice of degree of Pade 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 Pade 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.

[1]  W. J. Duncan,et al.  Elementary matrices and some applications to dynamics and differential equations , 1939 .

[2]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[3]  J. D. Lawson Generalized Runge-Kutta Processes for Stable Systems with Large Lipschitz Constants , 1967 .

[4]  C. Loan ON THE LIMITATION AND APPLICATION OF PADÉ APPROXIMATION TO THE MATRIX EXPONENTIAL , 1977 .

[5]  R. Ward Numerical Computation of the Matrix Exponential with Accuracy Estimate , 1977 .

[6]  C. Loan,et al.  Nineteen Dubious Ways to Compute the Exponential of a Matrix , 1978 .

[7]  B. Anderson,et al.  Digital control of dynamic systems , 1981, IEEE Transactions on Acoustics, Speech, and Signal Processing.

[8]  A. Laub,et al.  Condition Estimates for Matrix Functions , 1989 .

[9]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .

[10]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[11]  R. Mathias Evaluating the Frechet derivative of the matrix exponential , 1992 .

[12]  Timothy F. Havel,et al.  Matrix decompositions of two-dimensional nuclear magnetic resonance spectra. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Timothy F. Havel,et al.  Derivatives of the Matrix Exponential and Their Computation , 1995 .

[14]  C. Brezinski,et al.  A Taste of Padé Approximation , 1995, Acta Numerica.

[15]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[16]  Roger B. Sidje,et al.  Expokit: a software package for computing matrix exponentials , 1998, TOMS.

[17]  A. Laub,et al.  A Schur-Fréchet Algorithm for Computing the Logarithm and Exponential of a Matrix , 1998, SIAM J. Matrix Anal. Appl..

[18]  W. Stewart,et al.  A numerical study of large sparse matrix exponentials arising in Markov chains 1 1 This work has ben , 1999 .

[19]  Nicholas J. Higham,et al.  Matlab guide , 2000 .

[20]  L. Dieci,et al.  Padé approximation for the exponential of a block triangular matrix , 2000 .

[21]  Jorge J. Moré,et al.  Benchmarking optimization software with performance profiles , 2001, Math. Program..

[22]  Cleve B. Moler,et al.  Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later , 1978, SIAM Rev..

[23]  Inderjit S. Dhillon,et al.  Orthogonal Eigenvectors and Relative Gaps , 2003, SIAM J. Matrix Anal. Appl..

[24]  Nicholas J. Higham,et al.  A Schur-Parlett Algorithm for Computing Matrix Functions , 2003, SIAM J. Matrix Anal. Appl..

[25]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Nicholas J. Higham,et al.  Efficient algorithms for the matrix cosine and sine , 2005, Numerical Algorithms.

[27]  N. Higham Functions of a Matrix: Theory and Computation , 2006 .

[28]  V. Loan,et al.  A Study of the Matrix Exponential , 2006 .

[29]  S. Koikari,et al.  An error analysis of the modified scaling and squaring method , 2007, Comput. Math. Appl..