Error analysis of Krylov methods in a nutshell

SIAM Journal on Scientific Computing

Volumn 19, Issue 2, 1998, Pages 695-701

  Hochbruck, Marlis ^a   Lubich, Christian ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Arnoldi method; Conjugate gradient type methods; Error bounds; Krylov subspace methods; Lanczos method

Indexed keywords

EID: 0013004199     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827595290450     Document Type: Article

References (22)

1. W.E. ARNOLDI, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. R.E. BANK AND T.F. CHAN, An analysis of the composite step biconjugate gradient method, Numer. Math., 66 (1993), pp. 295-319.
3. T. BARTH AND T. MANTEUFFEL, Variable metric conjugate gradient methods, in Proc. of the 10th International Symposium on Matrix Analysis and Parallel Computing, Keio University, Yokohama, Japan, March 14-16, 1994.
4. P.N. BROWN, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 58-78.
5. M. EIERMANN, On semiiterative methods generated by Faber polynomials, Numer. Math., 56 (1989), pp. 139-156.
6. S.C. EISENSTAT, H.C. ELMAN, AND M.H. SCHULTZ, Variational iterative methods for nonsymmetric systems of linear equations, SIAM J. Numer. Anal., 20 (1983), pp. 345-357.
7. R.W. FREUND, G.H. GOLUB, AND N.M. NACHTIGAL, Iterative solution of linear systems, Acta Numerica, 1 (1992), pp. 57-100.
8. R.W. FREUND, M.H. GUTKNECHT, AND N.M. NACHTIGAL, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput., 14 (1993), pp. 137-158.
9. R.W. FREUND AND N.M. NACHTIGAL, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
10. M. HOCHBRUCK AND CH. LUBICH, On Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 1997, to appear.
11. C. LANCZOS, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Natl. Bur. Stand., 45 (1950), pp. 255-282.
12. C. LANCZOS, Solution of systems of linear equations by minimized iterations, J. Res. Natl. Bur. Stand., 49 (1952), pp. 33-53.
13. N.M. NACHTIGAL, A Look-ahead Variant of the Lanczos Algorithm and its Application to the Quasi-minimal Residual Method for Non-Hermitian Linear Systems, Ph.D. dissertation, MIT, Cambridge, MA, 1991.
14. N.M. NACHTIGAL, S.C. REDDY, AND L.N. TREFETHEN, How fast are nonsymmetric matrix iterations?, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 778-795.
15. O. NEVANLINNA, Convergence of Iterations for Linear Equations, Birkhäuser-Verlag, Basel, Switzerland, 1993.
16. O. NEVANLINNA, Convergence of Krylov-Methods for Sums of Two Operators, Tech. report A353, Helsinki University of Technology, Helsinki, 1995.
17. Y. SAAD, Krylov subspace methods for solving large unsymmetric linear systems, Math. Comp., 37 (1981), pp. 105-126.
18. 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.
19. B.A. SCHMITT AND R. WEINER, Matrix-free W-methods using a multiple Arnoldi iteration, Appl. Numer. Math., 18 (1995), pp. 307-320.
20. D.R. TAYLOR, Analysis of the Look-ahead Lanczos Algorithm, Ph.D. dissertation, University of California at Berkeley, Berkeley, CA, 1982.
21. L.N. TREFETHEN, Pseudospectra of matrices, Numerical Analysis 1991, D.F. Griffiths and G.A. Watson, eds., Longman Scientific and Technical, Harlow, U.K., 1992, pp. 234-266.
22. R. WEISS, Minimization properties and short recurrences for Krylov subspace methods, Electr. Trans. Numer. Anal., 2 (1994), pp. 57-75.