A Schur-Parlett algorithm for computing matrix functions

SIAM Journal on Matrix Analysis and Applications

Volumn 25, Issue 2, 2004, Pages 464-485

  Davies, Philip I ^a   Higham, Nicholas J ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

LAPACK; MATLAB; Matrix cosine; Matrix exponential; Matrix function; Matrix logarithm; Parlett recurrence; Schur decomposition; Sep function; Taylor series

Indexed keywords

EID: 1842865578     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479802410815     Document Type: Article

References (39)

1. E. ANDERSON, Z. BAI, C. BISCHOF, S. BLACKFORD, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, AND D. SORENSEN, LAPACK Users' Guide, 3rd ed., SIAM, Philadelphia, PA, 1999.
2. K. J. ASTRÖM AND B. WITTENMARK, Computer-Controlled Systems: Theory and Design, 3rd ed., Prentice-Hall, Englewood Cliffs, NJ, 1997.
3. Z. BAI AND J. W. DEMMEL, On swapping diagonal blocks in real Schur form, Linear Algebra Appl., 186 (1993), pp. 73-95.
4. C. A. BAVELY AND G. W. STEWART, An algorithm for computing reducing subspaces by block diagonalization, SIAM J. Numer. Anal., 16 (1979), pp. 359-367.
5. A. BJÖRCK AND S. HAMMARLING, A Schur method for the square root of a matrix, Linear Algebra Appl., 52/53 (1983), pp. 127-140.
6. B. A. BORGIAS, M. COCHIN, D. J. KERWOOD, AND T. L. JAMES, Relaxation matrix analysis of 2D NMR data, Progress in NMR Spectroscopy, 22 (1990), pp. 83-100.
7. T = C, IEEE Trans. Automat. Control, 29 (1984), pp. 926-928.
8. S. H. CHENG, N. J. HIGHAM, C. S. KENNEY, AND A. J. LAUB, Approximating the logarithm of a matrix to specified accuracy, SIAM J. Matrix Anal. Appl., 22 (2001), pp. 1112-1125.
9. S. M. Cox AND P. C. MATTHEWS, Exponential time differencing for stiff systems, J. Comput. Phys., 176 (2002), pp. 430-455.
10. L. DIECI, B. MORINI, AND A. PAPINI, Computational techniques for real logarithms of matrices, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 570-593.
11. L. DIECI AND A. PAPINI, Padé approximation for the exponential of a block triangular matrix, Linear Algebra Appl., 308 (2000), pp. 183-202.
12. F. R. GANTMACHER, The Theory of Matrices, Vol. 1, Chelsea, New York, 1959.
13. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
14. M. Gu, Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard, J. Complexity, 11 (1995), pp. 377-391.
15. 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.
16. N. J. HIGHAM, The Matrix Computation Toolbox, http://www.ma.man.ac.uk/ ~higham/mctoolbox (5 September 2002).
17. N. J. HIGHAM, Computing real square roots of a real matrix, Linear Algebra Appl., 88/89 (1987), pp. 405-430.
18. N. J. HIGHAM, FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation (Algorithm 674), ACM Trans. Math. Software, 14 (1988), pp. 381-396.
19. N. J. HIGHAM, Evaluating Padé approximanta of the matrix logarithm, SIAM J. Matrix Anal. Appl., 22 (2001), pp. 1126-1135.
20. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, PA, 2002.
21. R. A. HORN AND C. R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
22. A. ISERLES, H. Z. MUNTHE-KAAS, S. P. NØRSETT, AND A. ZANNA, Lie-group methods, Acta Numer., 9 (2000), pp. 215-365.
23. B. KÅGSTRÖM, Bounds and perturbation bounds for the matrix exponential, BIT, 17 (1977), pp. 39-57.
24. B. KÅGSTRÖM, Numerical computation of matrix functions, Report UMINF-58.77, Department of Information Processing, University of Umeå, Sweden, 1977.
25. -1 estimators, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 90-101.
26. B. KÅGSTRÖM AND A. RUHE, An algorithm for numerical computation of the Jordan normal form of a complex matrix, ACM Trans. Math. Software, 6 (1980), pp. 398-419.
27. C. KENNEY AND A. J. LAUB, Condition estimates for matrix functions, SIAM J. Matrix Anal. Appl., 10 (1989), pp. 191-209.
28. P.-F. LAVALLEE, A. MALYSHEV, AND M. SADKANE, Spectral portrait of matrices by block diagonalization, in Numerical Analysis and Its Applications, L. Vulkov, J. Waśniewski, and P. Yalamov, eds., Lecture Notes in Comput. Sci. 1196, Springer-Verlag, Berlin, 1997, pp. 266-273.
29. R. MATHIAS, Approximation of matrix-valued functions, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 1061-1063.
30. C. MOLER AND C. VAN LOAN, Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later, SIAM Rev., 45 (2003), pp. 3-49.
31. K. C. NG, Contributions to the Computation of the Matrix Exponential, Ph.D. thesis, Technical report PAM-212, Center for Pure and Applied Mathematics, University of California, Berkeley, CA, 1984.
32. B. N. PARLETT, Computation of functions of triangular matrices, Memorandum ERL-M481, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, CA, 1974.
33. B. N. PARLETT, A recurrence among the elements of functions of triangular matrices, Linear Algebra Appl., 14 (1976), pp. 117-121.
34. B. N. PARLETT AND K. C. NG, Development of an accurate algorithm for exp(Bt), Technical report PAM-294, Center for Pure and Applied Mathematics, University of California, Berkeley, CA, 1985.
35. S. M. SERBIN AND S. A. BLALOCK, An algorithm for computing the matrix cosine, SIAM J. Sci. Statist. Comput., 1 (1980), pp. 198-204.
36. M. I. SMITH, A Schur algorithm for computing matrix pth roots, SIAM J. Matrix Anal. Appl., 24 (2003), pp. 971-989.
37. C. VAN LOAN, The sensitivity of the matrix exponential, SIAM J. Numer. Anal., 14 (1977), pp. 971-981.
38. J. M. VARAH, On the separation of two matrices, SIAM J. Numer. Anal., 16 (1979), pp. 216-222.
39. R. C. WARD, Numerical computation of the matrix exponential with accuracy estimate, SIAM J. Numer. Anal., 14 (1977), pp. 600-610.