The scaling and squaring method for the matrix exponential revisited

SIAM Review

Volumn 51, Issue 4, 2009, Pages 747-764

  Higham, Nicholas J ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Backward error analysis; Expm; MATLAB; Matrix exponential; Matrix function; Matrix polynomial evaluation; Pad approximation; Performance profile; Scaling and squaring method

Indexed keywords

APPROXIMATION PERFORMANCE; BACKWARD ERROR ANALYSIS; MATRIX EXPONENTIALS; MATRIX POLYNOMIAL EVALUATION; SCALING AND SQUARING METHOD;

APPROXIMATION ALGORITHMS; ERROR ANALYSIS; FUNCTION EVALUATION; LEAST SQUARES APPROXIMATIONS; MATLAB; POLYNOMIAL APPROXIMATION;

MATRIX ALGEBRA;

EID: 71549130729     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/090768539     Document Type: Article

References (38)

1. A. H. AL-MOHY AND N. J. HIGHAM, Computing the Fréchet derivative of the matrix exponential, with an application to condition number estimation, SIAM J. Matrix Anal. Appl., 30 (2009), pp. 1639-1657.
2. A. H. AL-MOHY AND N. J. HIGHAM, A new scaling and squaring algorithm for the matrix exponential, SIAM J. Matrix Anal. Appl., 30 (2009), pp. 970-989.
3. C. BREZINSKI AND J. VAN ISEGHEM, A taste of Padé approximation, Acta Numerica, 4 (1995), pp. 53-103.
4. P. I. DAVIES AND N. J. HIGHAM, A Schur-Parlett algorithm for computing matrix functions, SIAM J. Matrix Anal. Appl., 25 (2003), pp. 464-485.
5. I. S. DHILLON AND B. N. PARLETT, Orthogonal eigenvectors and relative gaps, SIAM J. Matrix Anal. Appl., 25 (2004), pp. 858-899.
6. L. DIECI AND A. PAPINI, Padé approximation for the exponential of a block triangular matrix, Linear Algebra Appl., 308 (2000), pp. 183-202.
7. E. D. DOLAN AND J. J. MORÉ, Benchmarking optimization software with performance profiles, Math. Program., 91 (2002), pp. 201-213.
8. E. ESTRADA AND N. HATANO, Communicability in complex networks, Phys. Rev. E, 77 (2008), article 036111.
9. E. ESTRADA AND D. J. HIGHAM, Network Properties Revealed through Matrix Functions, Mathematics Research Report 17, University of Strathclyde, Scotland, UK, 2008.
10. E. ESTRADA, D. J. HIGHAM, AND N. HATANO, Communicability betweenness in complex networks, Phys. A, 388 (2009), pp. 764-774.
11. E. ESTRADA AND J. A. RODRÍGUEZ-VELÁZQUEZ, Subgraph centrality in complex networks, Phys. Rev. E, 71 (2005), article 056103.
12. G. F. FRANKLIN, J. D. POWELL, AND M. L. WORKMAN, Digital Control of Dynamic Systems, 3rd ed., Addison-Wesley, Reading, MA, 1998.
13. R. A. FRAZER, W. J. DUNCAN, AND A. R. COLLAR, Elementary Matrices and Some Applications to Dynamics and Differential Equations, Cambridge University Press, Cambridge, UK, 1963.
14. W. GAUTSCHI, Numerical Analysis: An Introduction, Birkhäuser Boston, Boston, MA, 1997.
15. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
16. G. I. HARGREAVES AND N. J. HIGHAM, Efficient algorithms for the matrix cosine and sine, Numer. Algorithms, 40 (2005), pp. 383-400.
17. T. F. HAVEL, I. NAJFELD, AND J. YANG, Matrix decompositions of two-dimensional nuclear magnetic resonance spectra, Proc. Natl. Acad. Sci. USA, 91 (1994), pp. 7962-7966.
18. D. J. HIGHAM AND N. J. HIGHAM, MATLAB Guide, 2nd ed., SIAM, Philadelphia, PA, 2005.
19. N. J. HIGHAM, The Matrix Computation Toolbox, http://www.ma.man.ac.uk/ ∼higham/mctoolbox.
20. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, PA, 2002.
21. N. J. HIGHAM, Functions of Matrices: Theory and Computation, SIAM, Philadelphia, PA, 2008.
22. R. A. HORN AND C. R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
23. C. S. KENNEY AND A. J. LAUB, Condition estimates for matrix functions, SIAM J. Matrix Anal. Appl., 10 (1989), pp. 191-209.
24. C. S. KENNEY AND A. J. LAUB, A Schur-Fréchet algorithm for computing the logarithm and exponential of a matrix, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 640-663.
25. S. KOIKARI, An error analysis of the modified scaling and squaring method, Comput. Math. Appl., 53 (2007), pp. 1293-1305.
26. e Cahier."
27. J. D. LAWSON, Generalized Runge-Kutta processes for stable systems with large Lipschitz constants, SIAM J. Numer. Anal., 4 (1967), pp. 372-380.
28. C. B. MOLER AND C. F. VAN LOAN, Nineteen dubious ways to compute the exponential of a matrix, SIAM Rev., 20 (1978), pp. 801-836.
29. C. B. MOLER AND C. F. VAN LOAN, Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later, SIAM Rev., 45 (2003), pp. 3-49.
30. I. NAJFELD AND T. F. HAVEL, Derivatives of the matrix exponential and their computation, Adv. in Appl. Math., 16 (1995), pp. 321-375.
31. R. B. SIDJE, Expokit: A software package for computing matrix exponentials, ACM Trans. Math. Software, 24 (1998), pp. 130-156.
32. R. B. SIDJE AND W. J. STEWART, A numerical study of large sparse matrix exponentials arising in Markov chains, Comput. Statist. Data Anal., 29 (1999), pp. 345-368.
33. B. SKAFLESTAD AND W. M. WRIGHT, The scaling and modified squaring method for matrix functions related to the exponential, Appl. Numer. Math., 59 (2009), pp. 783-799.
34. M. SOFRONIOU AND G. SPALETTA, Efficient matrix polynomial computation and application to the matrix exponential, talk given at the workshop on Dynamical Systems on Matrix Manifolds: Numerical Methods and Applications, Bari, Italy, 2004.
35. C. F. VAN LOAN, A Study of the Matrix Exponential, Numerical Analysis Report 10, The University of Manchester, Manchester, UK, 1975. Reissued as MIMS EPrint 2006.397, Manchester Institute for Mathematical Sciences, The University of Manchester, Manchester, UK, 2006.
36. C. F. VAN LOAN, On the limitation and application of Padé approximation to the matrix exponential, in Padé and Rational Approximation: Theory and Applications, E. B. Saff and R. S. Varga, eds., Academic Press, New York, 1977, pp. 439-448.
37. R. S. VARGA, Matrix Iterative Analysis, 2nd ed., Springer-Verlag, Berlin, 2000.
38. R. C. WARD, Numerical computation of the matrix exponential with accuracy estimate, SIAM J. Numer. Anal., 14 (1977), pp. 600-610.