On Krylov Subspace Approximations to the Matrix Exponential Operator

SIAM Journal on Numerical Analysis

Volumn 34, Issue 5, 1997, Pages 1911-1925

  Hochbruck, Marlis ^a   Lubich, Christian ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Arnoldi method; Conjugate gradient type methods; Krylov subspace methods; Lanczos method; Matrix exponential function; Matrix free time integration methods; Superlinear convergence

Indexed keywords

EID: 0347799731     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036142995280572     Document Type: Article

References (34)

1. F.F. BONSALL AND J. DUNCAN, Numerical Ranges of Operators on Normed Spaces and of Elements of Normed Algebras, Cambridge University Press, Cambridge, UK, 1971.
2. P.N. BROWN AND A.C. HINDMARSH, Matrix-free methods for stiff systems of ODEs, SIAM J. Numer. Anal., 23 (1986), pp. 610-638.
3. V.L. DRUSKIN AND L.A. KNIZHNERMAN, Two polynomial methods of calculating functions of symmetric matrices, U.S.S.R. Comput. Math. and Math. Phys., 29 (1989), pp. 112-121.
4. V.L. DRUSKIN AND L.A. KNIZHNERMAN, Krylov subspace approximations of eigenpairs and matrix functions in exact and computer arithmetic, Numer. Linear Algebra Appl., 2 (1995), pp. 205-217.
5. E.P. DOOLAN, J.J.H. MILLER, AND W.H.A. SCHILDERS, Uniform Numerical Methods for Problems with Initial and Boundary Layers, Boole Press, Dublin, Ireland, 1980.
6. M. EIERMANN, On semiiterative methods generated by Faber polynomials, Numer. Math., 56 (1989), pp. 139-156.
7. R.W. FREUND, M.H. GUTKNECHT, AND N.M. NACHTIGAL, An implementation of the lookahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput., 14 (1993), pp. 137-158.
8. A. FRIEDLI, Verallgemeinerte Runge-Kutta Verfahren zur Lösung steifer Differentialgleichungen, in Lecture Notes in Mathematics 631, Springer-Verlag, Berlin, 1978, pp. 35-50.
9. R.A. FRIESNER, L.S. TUCKERMAN, B.C. DORNBLASER, AND T.V. Russo, A method of exponential propagation of large systems of stiff nonlinear differential equations, J. Sci. Comput., 4 (1989), pp. 327-354.
10. E. GALLOPOULOS AND Y. SAAD, Efficient solution of parabolic equations by Krylov approximation methods, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 1236-1264.
11. C.W. GEAR AND Y. SAAD, Iterative solution of linear equations in ODE codes, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 583-601.
12. E. HAIRER AND G. WANNER, Solving Ordinary Differential Equations II, Springer-Verlag, Berlin, 1991.
13. M. HOCHBRUCK AND CH. LUBICH, Error analysis of Krylov methods in a nutshell, SIAM J. Sci. Comput., 18 (1997), to appear.
14. L.A. KNIZHNERMAN, Calculation of functions of unsymmetric matrices using Arnoldi's method, Comput. Math. and Math. Phys., 31 (1991), pp. 1-9.
15. L.A. KNIZHNERMAN, Error bounds in Arnoldi's method: The case of a normal matrix, Comput. Math. and Math. Phys., 32 (1992), pp. 1199-1211.
16. T. KÖVARI AND CH. POMMERENKE, On Faber polynomials and Faber expansions, Math. Z., 99 (1967), pp. 193-206.
17. R. KOSLOPF, Propagation methods for quantum molecular dynamics, Ann. Rev. Phys. Chem., 45 (1994), pp. 145-178.
18. J.D. LAWSON, Generalized Runge-Kutta processes for stable systems with large Lipschitz constants, SIAM J. Numer. Anal., 4 (1967), pp. 372-380.
19. A.I. MARKUSHEVICH, Theory of Functions of a Complex Variable, 2nd ed., Chelsea, New York, 1977.
20. A. NAUTS AND R.E. WYATT, New approach to many-state quantum dynamics: The recursive-residue-generation method, Phys. Rev. Lett., 51 (1983), pp. 2238-2241.
21. O. NEVANLINNA, Convergence of Iterations for Linear Equations, Birkhäuser, Basel, 1993.
22. T.J. PARK AND J.C. LIGHT, Unitary quantum time evolution by iterative Lanczos reduction, J. Chem. Phys., 85 (1986), pp. 5870-5876.
23. Y. SAAD, Krylov subspace methods for solving large unsymmetric linear systems, Math. Comp, 37 (1981), pp. 105-126.
24. Y. SAAD, Analysis of some Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 29 (1992), pp. 209-228.
25. B.A. SCHMITT AND R. WEINER, Matrix-free W-methods using a multiple Arnoldi iteration, Appl. Numer. Math., 18 (1995), pp. 307-320.
26. M.N. SPIJKER, Numerical ranges and stability estimates, Appl. Numer. Math., 13 (1993), pp. 241-249.
27. K. STREHMEL AND R. WEINER, Linear-implizite Runge-Kutta Methoden und ihre Anwendung, Teubner, Stuttgart, Leipzig, 1992.
28. D.R. TAYLOR, Analysis of the look-ahead Lanczos algorithm, Ph.D. thesis, University of California at Berkeley, Berkeley, CA, 1982.
29. H. TAL-EZER, Spectral methods in time for hyperbolic problems, SIAM J. Numer. Anal., 23 (1986), pp. 11-26.
30. H. TAL-EZER, Spectral methods in time for parabolic problems, SIAM J. Numer. Anal., 26 (1989), pp. 1-11.
31. H. TAL-EZER, Polynomial approximation of functions of matrices and applications, J. Sci. Comput., 4 (1989), pp. 25-60.
32. L.N. TREFETHEN, Pseudospectra of matrices, in Numerical Analysis 1991, D.F. Griffiths and G.A, Watson, eds., Longman, Harlow, UK, 1992.
33. H.A. VAN DER VORST, An iterative solution method for solving f(A)x = b, using Krylov subspace information obtained for the symmetric positive definite matrix A, J. Comput. Appl. Math., 18 (1987), pp. 249-263.
34. Q. YE, A convergence analysis for nonsymmetric Lanczos algorithms, Math. Comp., 56 (1991), pp. 677-691.