Generalizations and modifications of the GMRES iterative method

Numerical Algorithms

Volumn 21, Issue 1-4, 1999, Pages 119-146

  Chen, Jen Yuan ^a   Kincaid, David R ^b   Young, David M ^b  

^a I SHOU UNIVERSITY   (Taiwan)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Galerkin condition; Generalized Minimum Residual (GMRES) method; Iterative methods; Lanczos type methods; Minimization condition

Indexed keywords

EID: 0033456602     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1019105328973     Document Type: Article

References (19)

1. R.O. Abbassian, Lanczos algorithms for the acceleration of nonsymmetrizable iterative methods, Report CNA-193, Center for Numerical Analysis, University of Texas at Austin (1984).
2. W.E. Arnoldi, The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appl. Math. 9 (1951) 17-29.
3. A.M. Bruaset, A Survey of Preconditioned Iterative Methods (Longman Scientific & Technical/Wiley, New York, 1995).
4. J.-Y. Chen, Iterative solution of large sparse nonsymmetric linear systems, Report CNA-285, Center for Numerical Analysis, University of Texas at Austin (1997) (Ph.D. thesis, Dept. of Mathematics).
5. R. Fletcher, Conjugate gradient methods for indefinite systems, in: Proc. of the Dundee Conf. on Numerical Analysis (1975), Lecture Notes in Mathematics, Vol. 506 (Springer, New York, 1976) pp. 73-89.
6. R.W. Freund and N.M. Nachtigal, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math. 60 (1991) 315-339.
7. M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. National Bureau Standards 49(6) (1952) 409-436.
8. K.C. Jea, Generalized conjugate gradient acceleration of iterative methods, Report CNA-176, Center for Numerical Analysis, University of Texas at Austin (1982) (Ph.D. thesis, Dept. of Mathematics).
9. K.C. Jea and D.M. Young, On the simplification of generalized conjugate gradient methods for nonsymmetrizable linear systems, Linear Algebra Appl. 52/53 (1983) 399-417.
10. Y. Saad, Iterative Methods for Sparse Linear Systems (PWS Publ., Boston, MA, 1996).
11. Y. Saad and M.H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 7(3) (1986) 856-869.
12. P. Sonneveld, CGS: A fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 10(1) (1989) 36-52.
13. H.A. van der Vorst, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 13(2) (1992) 631-644.
14. P.K.W. Vinsome, ORTHOMIN: An iterative method for solving sparse sets of simultaneous linear equations, in: 4th Symp. of Numerical Simulation Reservoir Performance, Society of Petroleum Engineers of the AIME, Paper SPE 5739 (1976).
15. H.F. Walker, Implementation of the GMRES method using Householder transformations, SIAM J. Sci. Comput. 9 (1988) 152-163.
16. H.F. Walker and L. Zhou, A simpler GMRES, Report, Department of Mathematics and Statistics, Utah State University, Logan, UT (1992).
17. D.M. Young, L.J. Hayes and K.C. Jea, Generalized conjugate gradient acceleration of iterative methods, Part I: The symmetrizable case, Report CNA-162, Center for Numerical Analysis, University of Texas at Austin (1981).
18. D.M. Young and K.C. Jea, Generalized conjugate gradient acceleration of nonsymmetrizable iterative methods, Linear Algebra Appl. 34 (1980) 159-194.
19. D.M. Young and K.C. Jea, Generalized conjugate gradient acceleration of iterative methods, Part II: The nonsymmetrizable case, Report CNA-163, Center for Numerical Analysis, University of Texas at Austin (1981).