Computable convergence bounds for GMRES

SIAM Journal on Matrix Analysis and Applications

Volumn 21, Issue 3, 2000, Pages 882-903

  Liesen, Jörg ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Convergence analysis; GMRES method; Iterative methods; Krylov subspace methods; Linear systems

Indexed keywords

EID: 0034342209     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479898341669     Document Type: Article

References (36)

1. M. ARIOLI, V. PTÁK, AND Z. STRAKOŠ, Krylov sequences of maximal length and convergence of GMRES, BIT, 38 (1998), pp. 636-643.
2. W. ARNOLDI, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
3. C. H. BISCHOF, Incremental condition estimation, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 312-322.
4. P. N. BROWN AND H. F. WALKER, GMRES on (nearly) singular systems, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 37-51.
5. S. L. CAMPBELL, I. C. F. IPSEN, C. T. KELLEY, AND C. D. MEYER, GMRES and the minimal polynormal, BIT, 36 (1996), pp. 664-675.
6. J. B. CONWAY, A Course in Functional Analysis, 2nd ed., Springer-Verlag, New York, 1990.
7. J. DRKOŠOVÁ, A. GREENBAUM, M. ROZLOŽNÍK, AND Z. STRAKOŠ, Numerical stability of GMRES, BIT, 35 (1995), pp. 309-330.
8. M. EIERMANN, Field of Values and Iterative Methods, manuscript, 1996.
9. L. ELSNER AND C. HE, Perturbation and interlace theorems for the unitary eigenvalue problem, Linear Algebra Appl., 188 (1993), pp. 207-229.
10. V. FABER, W. JOUBERT, E. KNILL, AND T. MANTEUFFEL, Minimal residual method stronger than polynomial preconditioning, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 707-729.
11. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
12. A. GREENBAUM, Iterative Methods for Solving Linear Systems, SIAM, Philadelphia, 1997.
13. A. GREENBAUM AND L. GURVITS, MAX-MIN properties of matrix factor norms, SIAM J. Sci. Comput., 15 (1994), pp. 348-358.
14. A. GREENBAUM, V. PTÁK, AND Z. STRAKOŠ, Any nonincreasing convergence curve is possible for GMRES, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 465-469.
15. A. GREENBAUM AND Z. STRAKOŠ, Matrices that generate the same Krylov residual spaces, in Recent Advances in Iterative Methods, G. H. Golub, A. Greenbaum, and M. Luskin, eds., IMA Vol. Math. Appl. 60, Springer-Verlag, New York, 1994, pp. 95-118.
16. A. GREENBAUM AND L. N. TREFETHEN, GMRES/CR and Arnoldi/Lanczos as matrix approximation problems, SIAM J. Sci. Comput., 15 (1994), pp. 359-368.
17. W. JOUBERT, A robust GMRES-based adaptive polynomial preconditioning algorithm for nonsymmetric linear systems, SIAM J. Sci. Comput., 15 (1994), pp. 427-439.
18. L. KNIZHNERMAN, On GMRES-Equivalent Bounded Operators, preprint, 1998.
19. T. KOCH AND J. LIESEN, The conformal bratwurst maps and associated Faber polynomials, Numer. Math., to appear.
20. J. LIESEN, Computable Convergence Bounds for GMRES, Preprint 98-043, Sonderforschungsbereich 343, Universität Bielefeld, Bielefeld, Germany, 1998.
21. J. LIESEN, Construction and Analysis of Polynomial Iterative Methods for Non-Hermitian Systems of Linear Equations, Ph.D. thesis, Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany, 1998; also available from http://archiv.ub.uni-bielefeld.de/disshabi/ mathe.htm.
22. M. MARCUS AND H. MINC, A Survey of Matrix Theory and Matrix Inequalities, Dover, New York, 1992.
23. N. M. NACHTIGAL, S. REDDY, AND L. N. TREFETHEN, How fast are nonsymmetric matrix iterations?, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 778-795.
24. M. ROZLOŽNÍK, Numerical Stability of the GMRES Method, Ph.D. thesis, Institute of Computer Science, Academy of Sciences of the Czech Republic, 1997.
25. M. ROZLOŽNÍK AND Z. STRAKOŠ, Variants of the residual minimizing Krylov space methods, in Proceedings of the Eleventh Summer School on Software and Algorithms of Numerical Mathematics, I. Marek, ed., 1995, pp. 208-225.
26. Y. SAAD, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl., 34 (1980), pp. 269-295.
27. Y. SAAD, Iterative Methods for Solving Sparse Linear Systems, PWS Publishing Company, Boston, MA, 1996.
28. 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.
29. V. SMIRNOV AND N. LEBEDEV, Functions of a Complex Variable - Constructive Theory, MIT Press, Cambridge, MA, 1968.
30. G. STARKE, Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems, Numer. Math., 78 (1997), pp. 103-117.
31. Z. STRAKOŠ, Convergence and numerical behavior of the Krylov space methods, in Proceedings of the NATO ASI Institute "Algorithms for Large Sparse Linear Algebraic Systems: The State of the Art and Applications in Science and Engineering" (invited lectures), Kluwer Academic Publishers, 1998, pp. 175-196.
32. THE MATHWORKS, Using MATLAB (December 1996), The MathWorks Inc., Natick, MA, 1996.
33. K.-C. TOH, GMRES vs. ideal GMRES, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 30-36.
34. H. F. WALKER, Implementation of the GMRES method using Householder transformations, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 152-163.
35. H. F. WALKER AND L. ZHOU, A simpler GMRES, Numer. Linear Algebra Appl., 1 (1994), pp. 571-581.
36. J. WALSH, Interpolation and Approximation by Rational Functions in the Complex Domain, 5th ed., AMS, Providence, RI, 1969.