A restarted Krylov subspace method for the evaluation of matrix functions

SIAM Journal on Numerical Analysis

Volumn 44, Issue 6, 2006, Pages 2481-2504

  Eiermann, Michael ^a   Ernst, Oliver G ^a  

^a TU BERGAKADEMIE FREIBERG   (Germany)

Author keywords

Initial value problem; Krylov projection method; Krylov subspace approximation; Linear system of equations; Matrix function; Restarted Krylov subspace method

Indexed keywords

APPROXIMATION THEORY; FUNCTION EVALUATION; INITIAL VALUE PROBLEMS; MATRIX ALGEBRA;

KRYLOV PROJECTION METHOD; KRYLOV SUBSPACE APPROXIMATION; MATRIX FUNCTION; RESTARTED KRYLOV SUBSPACE METHOD;

LINEAR EQUATIONS;

EID: 37849029848     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/050633846     Document Type: Article

References (34)

1. E. J. ALLEN, J. BAGLAMA, AND S. K. BOYD, Numerical approximation of the product of the square root of a matrix with a vector, Linear Algebra Appl., 310 (2000), pp. 167-181.
2. R. P. BOAS, Entire Functions, Academic Press, New York, 1954.
3. P. N. BROWN, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 58-78.
4. E. CELLEDONI AND I. MORET, A Krylov projection method for systems of ODEs, Appl. Numer. Math., 24 (1997), pp. 365-378.
5. 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.
6. P. J. DAVIS, Interpolation and Approximation, Dover, New York, 1975.
7. C. DE BOOR, Divided differences, Surv. Approximation Theory, 1 (2005), pp. 46-69.
8. V. L. DRUSKIN AND L. A. KNIZHNERMAN, Two polynomial methods of calculating functions of symmetric matrices, Comput. Math. Math. Phys., 29 (1989), pp. 112-121.
9. V. L. DRUSKIN AND L. A. KNIZHNERMAN, Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic, Numer. Linear Algebra Appl., 2 (1995), pp. 205-217.
10. M. EIERMANN, O. G. ERNST, AND O. SCHNEIDER, Analysis of acceleration strategies for restarted minimal residual methods, J. Comput. Appl. Math., 123 (2000), pp. 261-292.
11. M. FREUND AND E. GÖRLICH, Polynomial approximation of entire functions and rate of growth of Taylor coefficients, Proc. Edinb. Math. Soc., 28 (1985), pp. 341-348.
12. R. W. FREUND AND M. HOCHBRUCK, Gauss-quadratures associated with the Arnoldi process and the Lanczos algorithm, in Linear Algebra for Large-Scale and Real-Time Applications, M. S. Moonen, G. H. Golub, and B. L. R. de Moor, eds., Kluwer Academic Publishers, Dordrecht, 1993, pp. 377-380.
13. R. W. FREUND, Quasi-kernel polynomials and their use in non-Hermitian matrix iterations, J. Comput. Appl. Math., 43 (1992), pp. 135-158.
14. E. GALLOPOULOS AND Y. SAAD, Efficient solution of parabolic equations by Krylov approximation methods, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 1236-1264.
15. F. R. GANTMACHER, The Theory of Matrices, Vol. I, AMS Chelsea, Providence, RI, 1959.
16. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
17. M. HOCHBRUCK AND C LUBICH, On Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 34 (1997), pp. 1911-1925.
18. C 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.
19. I. MORET AND P. NOVATI, An interpolatory approximation of the matrix exponential based on Faber polynomials, J. Comput. Appl. Math., 131 (2001), pp. 361-380.
20. I. MORET AND P. NOVATI, Interpolating functions of matrices on zeros of quasi-kernel polynomials, Numer. Linear Algebra Appl., 12 (2005), pp. 337-353.
21. R. B. MORGAN, A restarted GMRES method augmented with eigenvectors, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 1154-1171.
22. P. NOVATI, A method based on Fejér points for the computation of functions of nonsymmetric matrices, Appl. Numer. Math., 44 (2003), pp. 201-224.
23. C. C. PAIGE, B. PARLETT, AND H. A. VAN DER VORST, Approximate solutions and eigenvalue bounds from Krylov subspaces, Numer. Linear Algebra Appl., 2 (1995), pp. 115-133.
24. B. N. PARLETT, The Symmetric Eigenvalue Problem, SIAM, Philadelphia, 1997.
25. G. M. PHILLIPS, Interpolation and Approximation by Polynomials, Springer-Verlag, New York, 2003.
26. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
27. Y. SAAD, Krylov subspace methods for solving large unsymmetric linear systems, Math. Comp., 37 (1981), pp. 105-126.
28. Y. SAAD, Analysis of some Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 29 (1992), pp. 209-228.
29. B. SINGER AND S. SPILERMAN, The representation of social processes by Markov models, Amer. J. Sociology, 8 (1976), pp. 1-54.
30. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
31. D. E. STEWART AND T. S. LEYK, Error estimates for Krylov subspace approximations of matrix exponentials, J. Comput. Appl. Math., 72 (1996), pp. 359-369.
32. G. W. STEWART, A Krylov-Schur algorithm for large eigenproblems, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 601-614.
33. H. TAL-EZER, High degree polynomial interpolation in Newton form, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 648-667.
34. J. VAN DEN ESHOF, A. FROMMER, T. LIPPKRT, AND H. A. VAN DER VORST, Numerical methods for the QCD overlap operator. I. Sign-function and error bounds, Comput. Phys. Comm., 146 (2002), pp. 203-224.