A fast implementation for GMRES method

Journal of Computational and Applied Mathematics

Volumn 159, Issue 2, 2003, Pages 269-283

  Ayachour, E H ^a  

^a UNIVERSITÉ DU HAVRE   (France)

Author keywords

Krylov subspaces; Least squares problems; Linear systems; Minimal residual methods

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL MODELS;

ARNOLDI PROCESS;

COMPUTATIONAL METHODS;

MATHEMATICAL METHOD;

EID: 0141750676     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(03)00534-X     Document Type: Article

References (33)

1. Arnoldi W.E. The principle of minimized iteration in the solution of the matrix eigenvalue problem Quart. Appl. Math. 9 1996 17-29
2. Axelsson O. Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations Linear Algebra Appl. 29 1980 1-16
3. E.H. Ayachour, Application de la Biorthogonalité aux Mé thodes de Projection, Ph.D. Thesis, USTL, Lille, 1998.
4. Ayachour E.H. Expanded systems and the ILU preconditioner for solving non-Hermitian linear systems Linear Algebra Appl. 293 1999 243-256
5. Björck A. Numerical Methods for Least Squares Problems 1996 Society for Industrial and Applied Mathematics Philadelphia, PA, USA
6. Brown P.N. A theoretical comparison of the Arnoldi and the GMRES algorithms SIAM J. Sci. Statist. Comput. 12 1991 58-78
7. Brown P.N. Walker H.F. GMRES on (nearly) singular systems SIAM J. Matrix Anal. Appl. 18 1997 37-51
8. Eisenstat S.C. Elman H.C. Schultz M.H. Variational iterative methods for nonsymmetric systems of linear equations SIAM J. Numer. Anal. 20 1983 345-357
9. H.C. Elman, Iterative Methods for Large, Sparse, Nonsymmetric Systems of Linear Equations, Ph.D. Thesis, Computer Science Department, Yale University, New Haven, CT, 1982.
10. Fletcher R. Conjugate Gradient methods for indefinite systems Watson G.A. Numerical Analysis Lecture Notes in Mathematics Vol. 506 1976 73-89 Springer Berlin
11. Freund R.W. QMR: a transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems SIAM J. Sci. Comput. 14 1993 425-448
12. Freund R.W. Nachtigal N.M. QMR: a quasi-minimal residual method for non-Hermitian linear systems Numer. Math. 60 1991 315-339
13. Gentleman W.M. Least squares computations by Givens transformations without square roots J. Inst. Math. Appl. 12 1973 329-336
14. Joly P. Meurant G. Complex conjugate gradient methods Numer. Algorithm 4 1993 379-406
15. Lanczos C. Solution of systems of linear equations by minimized iteration J. Res. Nat. Bur. Standards 49 1952 33-53
16. Morgan R.B. A restarted GMRES method augmented with eigenvectors SIAM J. Matrix Anal. Appl. 16 1995 1154-1171
17. 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. Thesis, Massachusetts Institute of Technology, 1991.
18. Paige C.C. Saunders M.A. Solution of sparse indefinite systems of linear equations SIAM J. Numer. Anal. 12 1975 617-629
19. Paige C.C. Saunders M.A. LSQR: an algorithm for sparse linear equations and sparse least squares ACM Trans. Math. Software 8 1982 43-71
20. Saad Y. Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices Linear Algebra Appl. 34 1980 269-295
21. Saad Y. Krylov subspace methods for solving large unsymmetric linear systems Math. Comput. 37 1981 105-126
22. Saad Y. A flexible inner-outer preconditioned GMRES algorithm SIAM J. Sci. Comput. 14 1993 461-469
23. Saad Y. Schultz M.H. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems SIAM J. Sci. Statist. Comput. 7 1986 856-869
24. Sadok H. CMRH: a new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm Numer. Algorithm 20 1999 303-321
25. Saunders M.A. Solution of sparse rectangular systems using LSQR and GRAIG BIT 35 1995 588-604
26. Saunders M.A. Simon H.D. Yip E.L. Two conjugate-gradient-type methods for unsymmetric linear equations SIAM J. Numer. Anal. 25 1988 927-940
27. Sonneveld P. CGS: a fast Lanczos-type solver for nonsymmetric linear systems SIAM J. Sci. Statist. Comput. 10 1989 36-52
28. Van Der Vorst H.A. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems SIAM J. Sci. Statist. Comput. 13 1992 631-644
29. Van Der Vorst H.A. Vuik C. A family of nested GMRES methods Numer. Linear Algebraic Appl. 1 1994 369-386
30. Vuik C. New insights in GMRES-like methods with variable preconditioners J. Comput. Appl. Math. 61 1995 189-204
31. Walker H.F. Implementation of the GMRES method using Householder transformations SIAM J. Sci. Statist. Comput. 9 1988 152-163
32. Walker H.F. Zhou L. A simpler GMRES Linear Algebra Appl. 1 1994 571-581
33. Young D.M. Jea K.C. Generalized conjugate-gradient acceleration for nonsymmetrizable iterative methods Linear Algebra Appl. 34 1980 159-194