Computing matrix functions

Acta Numerica

Volumn 19, Issue , 2010, Pages 159-208

  Higham, Nicholas J ^a   Al Mohy, Awad H ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79957525769     PISSN: 09624929     EISSN: 14740508     Source Type: Journal    
DOI: 10.1017/S0962492910000036     Document Type: Article

References (118)

1. M. Afanasjew, M. Eiermann, O. G. Ernst and S. Güttel (2008), 'Implementation of a restarted Krylov subspace method for the evaluation of matrix functions', Linear Algebra Appl. 429, 2293-2314.
2. A. H. Al-Mohy and N. J. Higham (2009a), 'Computing the Fréchet derivative of the matrix exponential, with an application to condition number estimation', SIAM J. Matrix Anal. Appl. 30, 1639-1657.
3. A. H. Al-Mohy and N. J. Higham (2009b), 'A new scaling and squaring algorithm for the matrix exponential', SIAM J. Matrix Anal. Appl. 31, 970-989.
4. A. H. Al-Mohy and N. J. Higham (2010), 'The complex step approximation to the Fréchet derivative of a matrix function', Numer. Algorithms 53, 133-148.
5. A. C. Antoulas (2005), Approximation of Large-Scale Dynamical Systems, SIAM, Philadelphia, PA, USA.
6. M. Arioli and D. Loghin (2009), 'Discrete interpolation norms with applications', SIAM J. Numer. Anal. 47, 2924-2951.
7. G. A. Baker, Jr. and P. Graves-Morris (1996), Padé Approximants, Vol. 59 of Encyclopedia of Mathematics and its Applications, second edn, Cambridge University Press, Cambridge, UK.
8. A. Y. Barraud (1979), 'Investigations autour de la fonction signe d'une matrice application a l'équation de Riccati', RAIRO Automatique/Systems Analysis and Control 13, 335-368.
9. C. A. Bavely and G. W. Stewart (1979), 'An algorithm for computing reducing subspaces by block diagonalization', SIAM J. Numer. Anal. 16, 359-367.
10. H. Berland, B. Skaflestad and W. Wright (2007), 'EXPINT: A MATLAB package for exponential integrators', ACM Trans. Math. Software 33, #4.
11. D. A. Bini, N. J. Higham and B. Meini (2005), 'Algorithms for the matrix pth root', Numer. Algorithms 39, 349-378. (Pubitemid 40553421)
12. Å. Björck and S. Hammarling (1983), 'A Schur method for the square root of a matrix', Linear Algebra Appl. 52/53, 127-140.
13. R. J. Bradford, R. M. Corless, J. H. Davenport, D. J. Jeffrey and S. M. Watt (2002), 'Reasoning about the elementary functions of complex analysis', Annals of Mathematics and Artificial Intelligence 36, 303-318. (Pubitemid 37132964)
14. C. Brezinski and J. Van Iseghem (1995), A taste of Padé approximation. In Acta Numerica, Vol. 4, Cambridge University Press, pp. 53-103.
15. A. Cayley (1858), 'A memoir on the theory of matrices', Philos. Trans. Roy. Soc. London 148, 17-37.
16. T. Charitos, P. R. de Waal and L. C. van der Gaag (2008), 'Computing shortinterval transition matrices of a discrete-time Markov chain from partially observed data', Statistics in Medicine 27, 905-921. (Pubitemid 351350928)
17. S. H. Cheng, N. J. Higham, C. S. Kenney and A. J. Laub (2000), Return to the middle ages: A half-angle iteration for the logarithm of a unitary matrix. In Proc. 14th International Symposium of Mathematical Theory of Networks and Systems, Perpignan, France. CD ROM.
18. S. H. Cheng, N. J. Higham, C. S. Kenney and A. J. Laub (2001), 'Approximating the logarithm of a matrix to specified accuracy', SIAM J. Matrix Anal. Appl. 22, 1112-1125.
19. A. R. Collar (1978), 'The first fifty years of aeroelasticity', Aerospace (Royal Aeronautical Society Journal) 5, 12-20.
20. M. G. Cox and P. M. Harris (2004), Numerical analysis for algorithm design in metrology, Software Support for Metrology Best Practice Guide No. 11, National Physical Laboratory, Teddington, UK.
21. J. J. Crofts and D. J. Higham (2009), 'A weighted communicability measure applied to complex brain networks', J. Roy. Soc. Interface 6, 411-414.
22. P. I. Davies and N. J. Higham (2003), 'A Schur-Parlett algorithm for computing matrix functions', SIAM J. Matrix Anal. Appl. 25, 464-485.
23. P. I. Davies and N. J. Higham (2005), Computing f (A) b for matrix functions f. In QCD and Numerical Analysis III (A. Boriçi, A. Frommer, B. Joó, A. Kennedy and B. Pendleton, eds), Vol. 47 of Lecture Notes in Computational Science and Engineering, Springer, Berlin, pp. 15-24.
24. C. Davis (1973), 'Explicit functional calculus', Linear Algebra Appl. 6, 193-199.
25. E. D. Denman and A. N. Beavers, Jr. (1976), 'The matrix sign function and computations in systems', Appl. Math. Comput. 2, 63-94.
26. J. Descloux (1963), 'Bounds for the spectral norm of functions of matrices', Numer. Math. 15, 185-190.
27. L. Dieci and A. Papini (2000), 'Padé approximation for the exponential of a block triangular matrix', Linear Algebra Appl. 308, 183-202.
28. L. Dieci, B. Morini and A. Papini (1996), 'Computational techniques for real logarithms of matrices', SIAM J. Matrix Anal. Appl. 17, 570-593.
29. 2 - A = 0', Buletinul Institutului Politehnic din Iasi xvi, 15-24.
30. E. Estrada and N. Hatano (2008), 'Communicability in complex networks', Phys. Review e 77, 036111.
31. E. Estrada and D. J. Higham (2008), Network properties revealed through matrix functions. Mathematics Research Report 17, University of Strathclyde, Scotland, UK. To appear in SIAM Rev.
32. E. Estrada and J. A. Rodríguez-Velázquez (2005a), 'Spectral measures of bipartivity in complex networks', Phys. Review e 72, 046105.
33. E. Estrada and J. A. Rodríguez-Velázquez (2005b), 'Subgraph centrality in complex networks', Phys. Review e 71, 056103.
34. E. Estrada, D. J. Higham and N. Hatano (2009), 'Communicability betweenness in complex networks', Physica A 388, 764-774.
35. S. Fiori (2008), 'Leap-frog-type learning algorithms over the Lie group of unitary matrices', Neurocomputing 71, 2224-2244.
36. R. A. Frazer, W. J. Duncan and A. R. Collar (1938), Elementary Matrices and Some Applications to Dynamics and Differential Equations, Cambridge University Press, Cambridge, UK. 1963 printing.
37. A. Frommer and V. Simoncini (2008a), Matrix functions. In Model Order Reduction: Theory, Research Aspects and Applications (W. H. A. Schilders, H. A. van der Vorst and J. Rommes, eds), Springer, Berlin, pp. 275-303.
38. A. Frommer and V. Simoncini (2008b), 'Stopping criteria for rational matrix functions of Hermitian and symmetric matrices', SIAM J. Sci. Comput. 30, 1387-1412.
39. F. R. Gantmacher (1959), The Theory of Matrices, Vol. one, Chelsea, New York.
40. M. B. Giles, M. C. Duta, J.-D. Müller and N. A. Pierce (2003), 'Algorithm developments for discrete adjoint methods', AIAA Journal 4, 198-205.
41. H. H. Goldstine (1977), A History of Numerical Analysis from the 16th through the 19th Century, Springer, New York.
42. G. H. Golub and C. F. Van Loan (1996), Matrix Computations, third edn, Johns Hopkins University Press, Baltimore, MD, USA.
43. F. Greco and B. Iannazzo (2010), 'A binary powering algorithm for computing primary matrix roots', Numer. Algorithms. To appear.
44. V. Grimm and M. Hochbruck (2008), 'Rational approximation to trigonometric operator', BIT 48, 215-229.
45. C.-H. Guo (2009), 'On Newton's method and Halley's method for the principal pth root of a matrix', Linear Algebra Appl. 432, 1905-1922.
46. C.-H. Guo and N. J. Higham (2006), 'A Schur-Newton method for the matrix pth root and its inverse', SIAM J. Matrix Anal. Appl. 28, 788-804. (Pubitemid 47109362)
47. a, log (A) and related matrix functions by contour integrals', SIAM J. Numer. Anal. 46, 2505-2523.
48. G. Hargreaves (2005), Topics in matrix computations: Stability and efficiency of algorithms. PhD thesis, University of Manchester, Manchester, England.
49. G. I. Hargreaves and N. J. Higham (2005), 'Efficient algorithms for the matrix cosine and sine', Numer. Algorithms 40, 383-400. (Pubitemid 41650514)
50. N. J. Higham (1986a), 'Computing the polar decomposition: With applications', SIAM J. Sci. Statist. Comput. 7, 1160-1174.
51. N. J. Higham (1986b), 'Newton's method for the matrix square root', Math. Comp. 46, 537-549.
52. N. J. Higham (1987), 'Computing real square roots of a real matrix', Linear Algebra Appl. 88/89, 405-430.
53. N. J. Higham (1994), 'The matrix sign decomposition and its relation to the polar decomposition', Linear Algebra Appl. 212/213, 3-20.
54. N. J. Higham (1997), 'Stable iterations for the matrix square root', Numer. Algorithms 15, 227-242.
55. N. J. Higham (2001), 'Evaluating Padé approximants of the matrix logarithm', SIAM J. Matrix Anal. Appl. 22, 1126-1135.
56. N. J. Higham (2002), Accuracy and Stability of Numerical Algorithms, second edn, SIAM, Philadelphia, PA, USA.
57. N. J. Higham (2005), 'The scaling and squaring method for the matrix exponential revisited', SIAM J. Matrix Anal. Appl. 26, 1179-1193. (Pubitemid 41495317)
58. N. J. Higham (2008), Functions of Matrices: Theory and Computation, SIAM, Philadelphia, PA, USA.
59. N. J. Higham (2009), 'The scaling and squaring method for the matrix exponential revisited', SIAM Rev. 51, 747-764.
60. N. J. Higham, 'The Matrix Function Toolbox'. http://www.ma.man.ac.uk/ ~higham/mftoolbox.
61. N. J. Higham and L. Lin (2009), On pth roots of stochastic matrices. MIMS EPrint 2009.21, Manchester Institute for Mathematical Sciences, The University of Manchester, UK.
62. N. J. Higham and M. I. Smith (2003), 'Computing the matrix cosine', Numer. Algorithms 34, 13-26. (Pubitemid 38104694)
63. N. J. Higham and F. Tisseur (2000), 'A block algorithm for matrix 1-norm estimation, with an application to 1-norm pseudospectra', SIAM J. Matrix Anal. Appl. 21, 1185-1201. (Pubitemid 33217064)
64. N. J. Higham, D. S. Mackey, N. Mackey and F. Tisseur (2005), 'Functions preserving matrix groups and iterations for the matrix square root', SIAM J. Matrix Anal. Appl. 26, 849-877. (Pubitemid 41049849)
65. M. Hochbruck and A. Ostermann (2010), Exponential integrators. In Acta Numerica, Vol. 19, Cambridge University Press, pp. 209-286.
66. R. A. Horn and C. R. Johnson (1991), Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK.
67. B. Iannazzo (2006), 'On the Newton method for the matrix Pth root', SIAM J. Matrix Anal. Appl. 28, 503-523. (Pubitemid 46639153)
68. M. Ilić, I. W. Turner and D. P. Simpson (2009), 'A restarted Lanczos approximation to functions of a symmetric matrix', IMA J. Numer. Anal. Advance Access published on June 17, 2009. doi:10.1093/imanum/drp003.
69. R. B. Israel, J. S. Rosenthal and J. Z. Wei (2001), 'Finding generators for Markov chains via empirical transition matrices, with applications to credit ratings', Mathematical Finance 11, 245-265.
70. R. A. Jarrow, D. Lando and S. M. Turnbull (1997), 'A Markov model for the term structure of credit risk spreads', Rev. Financial Stud. 10, 481-523.
71. W. Kahan (1987), Branch cuts for complex elementary functions, or Much Ado About Nothing's sign bit. In The State of the Art in Numerical Analysis (A. Iserles and M. J. D. Powell, eds), Oxford University Press, pp. 165-211.
72. C. S. Kenney and A. J. Laub (1989a), 'Condition estimates for matrix functions', SIAM J. Matrix Anal. Appl. 10, 191-209.
73. C. S. Kenney and A. J. Laub (1989b), 'Pade error estimates for the logarithm of a matrix', Internat. J. Control 50, 707-730.
74. C. S. Kenney and A. J. Laub (1991a), 'Polar decomposition and matrix sign function condition estimates', SIAM J. Sci. Statist. Comput. 12, 488-504.
75. C. S. Kenney and A. J. Laub (1991b), 'Rational iterative methods for the matrix sign function', SIAM J. Matrix Anal. Appl. 12, 273-291.
76. C. S. Kenney and A. J. Laub (1998), 'A Schur-Frechet algorithm for computing the logarithm and exponential of a matrix', SIAM J. Matrix Anal. Appl. 19, 640-663.
77. S. Koikari (2009), 'Algorithm 894: On a block Schur-Parlett algorithm for φ-functions based on the sep-inverse estimate', ACM Trans. Math. Software 36, #12.
78. A. Kreinin and M. Sidelnikova (2001), 'Regularization algorithms for transition matrices', Algo Research Quarterly 4, 23-40.
79. 2 -I = 0', Math. Tables Aids Comp. 12, 109-116.
80. P. Lancaster and M. Tismenetsky (1985), The Theory of Matrices, second edn, Academic Press, London.
81. B. Laszkiewicz and K. Ziȩtak (2009), 'A Padé family of iterations for the matrix sector function and the matrix pth root', Numer. Linear Algebra Appl. 16, 951-970.
82. P.-F. Lavallée, A. Malyshev and M. Sadkane (1997), Spectral portrait of matrices by block diagonalization. In Numerical Analysis and its Applications (L. Vulkov, J. Wásniewski and P. Yalamov, eds), Vol. 1196 of Lecture Notes in Computer Science, Springer, Berlin, pp. 266-273. (Pubitemid 127043962)
83. J. D. Lawson (1967), 'Generalized Runge-Kutta processes for stable systems with large Lipschitz constants', SIAM J. Numer. Anal. 4, 372-380.
84. J. R. R. A. Martins, P. Sturdza and J. J. Alonso (2003), 'The complex-step derivative approximation', ACM Trans. Math. Software 29, 245-262.
85. R. Mathias (1996), 'A chain rule for matrix functions and applications', SIAM J. Matrix Anal. Appl. 17, 610-620.
86. The MathWorks (2009a), 'numeric::expMatrix: The exponential of a matrix'. http://www.mathworks.com/access/helpdesk/help/toolbox/mupad/numeric/expMatr. html, retrieved on September 29, 2009.
87. The MathWorks (2009b), 'numeric::fMatrix: Functional calculus for numerical square matrices'. http://www.mathworks.com/access/helpdesk/help/ toolbox/mupad/numeric/fMatrix.html, retrieved on September 29, 2009.
88. C. B. Moler and C. F. Van Loan (1978), 'Nineteen dubious ways to compute the exponential of a matrix', SIAM Rev. 20, 801-836.
89. C. B. Moler and C. F. Van Loan (2003), 'Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later', SIAM Rev. 45, 3-49.
90. L. Morai and A. F. Pacheco (2003), 'Algebraic approach to the radioactive decay equations', Amer. J. Phys. 71, 684-686. (Pubitemid 36931594)
91. Octave Version 3.2.2 (2009). http://www.octave.org.
92. B. N. Parlett (1976), 'A recurrence among the elements of functions of triangular matrices', Linear Algebra Appl. 14, 117-121.
93. B. N. Parlett and K. C. Ng (1985), Development of an accurate algorithm for exp (Bt). Technical Report PAM-294, Center for Pure and Applied Mathematics, University of California, Berkeley. Fortran program listings are given in an appendix with the same report number printed separately.
94. M. S. Paterson and L. J. Stockmeyer (1973), 'On the number of nonscalar multiplications necessary to evaluate polynomials', SIAM J. Comput. 2, 60-66.
95. H.-O. Peitgen, H. Jürgens and D. Saupe (1992), Fractals for the Classroom, Part Two: Complex Systems and Mandelbrot Set, Springer, New York.
96. G. M. Phillips (2000), Two Millennia of Mathematics: From Archimedes to Gauss, Springer, New York.
97. M. Popolizio and V. Simoncini (2008), 'Acceleration techniques for approximating the matrix exponential operator', SIAM J. Matrix Anal. Appl. 30, 657-683.
98. P. J. Psarrakos (2002), 'On the mth roots of a complex matrix', Electron. J. Linear Algebra 9, 32-41. (Pubitemid 38817938)
99. P. Pulay (1966), 'An iterative method for the determination of the square root of a positive definite matrix', Z. Angew. Math. Mech. 46, 151.
100. R. F. Rinehart (1955), 'The equivalence of definitions of a matric function', Amer. Math. Monthly 62, 395-414.
101. J. D. Roberts (1980), 'Linear model reduction and solution of the algebraic Riccati equation by use of the sign function', Internat. J. Control 32, 677-687. First issued as report CUED/B-Control/TR13, Department of Engineering, University of Cambridge, 1971. (Pubitemid 11451418)
102. Y. Saad (1992), 'Analysis of some Krylov subspace approximations to the matrix exponential operator', SIAM J. Numer. Anal. 29, 209-228.
103. Y. Saad (2003), Iterative Methods for Sparse Linear Systems, second edn, SIAM, Philadelphia, PA, USA.
104. M. Schroeder (1991), Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise, W. H. Freeman, New York.
105. S. M. Serbin and S. A. Blalock (1980), 'An algorithm for computing the matrix cosine', SIAM J. Sci. Statist. Comput. 1, 198-204.
106. L. F. Shampine (2007), 'Accurate numerical derivatives in MATLAB', ACM Trans. Math. Software. #26, 17 pp.
107. R. B. Sidje (1998), 'Expokit: A software package for computing matrix exponentials', ACM Trans. Math. Software 24, 130-156. (Pubitemid 128447702)
108. R. B. Sidje, 'Expokit'. http://www.maths.uq.edu.au/expokit, retrieved October 8, 2009.
109. M. I. Smith (2003), 'A Schur algorithm for computing matrix pth roots', SIAM J. Matrix Anal. Appl. 24, 971-989. (Pubitemid 37311572)
110. W. Squire and G. Trapp (1998), 'Using complex variables to estimate derivatives of real functions', SIAM Rev. 40, 110-112. (Pubitemid 128628446)
111. C. F. Van Loan (1975), A study of the matrix exponential. Numerical Analysis Report No. 10, University of Manchester, Manchester, UK. Reissued as MIMS EPrint 2006.397, Manchester Institute for Mathematical Sciences, The University of Manchester, UK, November 2006.
112. C. F. Van Loan (1978), 'Computing integrals involving the matrix exponential', IEEE Trans. Automat. Control AC-23, 395-404.
113. C. F. Van Loan (1979), 'A note on the evaluation of matrix polynomials', IEEE Trans. Automat. Control AC-24, 320-321.
114. R. S. Varga (2000), Matrix Iterative Analysis, second edn, Springer, Berlin.
115. C. Visser (1937), 'Note on linear operators', Proc. Kon. Akad. Wet. Amsterdam 40, 270-272.
116. R. C. Ward (1977), 'Numerical computation of the matrix exponential with accuracy estimate', SIAM J. Numer. Anal. 14, 600-610.
117. F. V. Waugh and M. E. Abel (1967), 'On fractional powers of a matrix', J. Amer. Statist. Assoc. 62, 1018-1021.
118. D. Yuan and W. Kernan (2007), 'Explicit solutions for exit-only radioactive decay chains', J. Appl. Phys. 101, 094907 1-12.