A technique for accelerating the convergence of restarted gmres

SIAM Journal on Matrix Analysis and Applications

Volumn 26, Issue 4, 2005, Pages 962-984

  Baker, A H ^a   Jessup, E R ^b   Manteuffel, T ^c  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b University of Colorado   (United States)

^c UNIVERSITY OF COLORADO   (United States)

Author keywords

GMRES; Iterative methods; Krylov subspace; Nonsymmetric linear systems; Restart

Indexed keywords

GMRES; KRYLOV SUBSPACE; NONSYMMETRIC LINEAR SYSTEMS; RESTART;

ALGORITHMS; FUNCTIONS; ITERATIVE METHODS; POLYNOMIALS; VECTORS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 27144443419     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/S0895479803422014     Document Type: Article

References (31)

1. S. F. ASHBY, T. A. MANTEUFFEL, AND P. E. SAYLOR, A taxonomy for conjugate gradient methods, SIAM J. Numer. Anal., 27 (1990), pp. 1542-1568.
2. A. BAKER, J. DENNIS, AND E. R. JESSUP, Toward memory-efficient linear solvers, in VEC-PAR'2002, Fifth International Conference on High Performance Computing for Computational Science: Selected Papers and Invited Talks, J. Palma, J. Dongarra, V. Hernandez, and A. A. Sousa, eds., Lecture Notes in Comput. Sci. 2565, Springer-Verlag, New York, 2003, pp. 315-327.
3. S. BALAY, K. BUSCHELMAN, W. D. GROPP, D. KAUSHIK, L. C. MCINNES, AND B. F. SMITH, PETSc home page, http://www.mcs.anl.gov/petsc, 2001.
4. S. BALAY, W. D. GROPP, L. C. MCINNES, AND B. F. SMITH, PETSc Users Manual, Tech. report ANL-95/11, Revision 2.1.3, Argonne National Laboratory, Argonne, IL, 2002.
5. A. CHAPMAN AND Y. SAAD, Deflated and augmented Krylov subspace techniques, Numer. Linear Algebra Appl., 4 (1997), pp. 43-66.
6. T. DAVIS, University of Florida sparse matrix collection, http://www.cise.ufl.edu/research/sparse/matrices, 2002.
7. E. DE STURLER, Nested Krylov methods based on GCR, J. Comput. Appl. Math., 67 (1996), pp. 15-41.
8. E. DE STURLER, Truncation strategies for optimal Krylov subspace methods, SIAM J. Numer. Anal., 36 (1999), pp. 864-889.
9. E. DE STURLER AND D. R. FOKKEMA, Nested Krylov methods and preserving orthogonality, in Sixth Copper Mountain Conference on Multigrid Methods, N. Melson, T. Manteuffel, and S. McCormick, eds., Part 1 of NASA Conference Publication 3324, NASA, 1993, pp. 111-126.
10. M. EIERMANN AND O. G. ERNST, Geometric aspects in the theory of Krylov subspace methods, in Acta Numerica, Acta Numer. 10, Cambridge University Press, Cambridge, UK, 2001, pp. 251-312.
11. M. EIERMANN, O. G. ERNST, AND O. SCHNEIDER, Analysis of acceleration strategies for restarted minimum residual methods, J. Comput. Appl. Math., 123 (2000), pp. 261-292.
12. 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.
13. M. EMBREE, The tortoise and the hare restart GMRES, SIAM Rev., 45 (2003), pp. 259-266.
14. O. ERNST, A numerical study of acceleration schemes for restarted minimum residual methods, Presentation at the Seventh Copper Mountain Conference on Iterative Methods, Copper Mountain, CO, 2002.
15. D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Accelerated inexact Newton schemes for large systems of nonlinear equations, SIAM J. Sci. Comput., 19 (1998), pp. 657-674.
16. A. GREBNBAUM AND Z. STRAKOŠ, Matrices that generate the same Krylov residual spaces, in Recent Advances in Iterative Methods, G. Golub, A. Greenbaum, and M. Luskin, eds., Springer-Verlag, New York, 1994, pp. 95-118.
17. W. JOUBERT, On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems, Numer. Linear Algebra Appl., 1 (1994), pp. 427-447.
18. R. B. MORGAN, A restarted GMRES method augmented with eigenvectors, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 1154-1171.
19. R. B. MORGAN, Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 1112-1135.
20. R. B. MORGAN, GMRES with deflated restarting, SIAM J. Sci. Comput., 24 (2002), pp. 20-37.
21. N. M. NACHITGAL, L. REICHEL, AND L. N. TREFETHEN, A hybrid GMRES algorithm for nonsymmetric linear systems, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 796-825.
22. 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.
23. NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY, MATHEMATICAL AND COMPUTATIONAL SCIENCES DIVISION, Matrix Market, http://math.nist.gov/ MatrixMarket, 2002.
24. Y. SAAD, A flexible inner-outer preconditioned GMRES algorithm, SIAM J. Sci. Comput., 14 (1993), pp. 461-469.
25. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston, 1996.
26. Y. SAAD, Analysis of augmented Krylov subspace methods, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 435-449.
27. 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.
28. V. SIMONCINI, On the convergence of restarted Krylov subspace methods, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 430-452.
29. H. A. VAN DER VORST AND C. VUIK, The superlinear convergence behavior of GMRES, J. Comput. Appl. Math., 48 (1993), pp. 327-341.
30. H. A. VAN DER VORST AND C. VUIK, GMRESR: A family of nested GMRES methods, Numer. Linear Algebra Appl., 1 (1994), pp. 369-386.
31. D. M. YOUNG AND K. C. JEA, Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods, Linear Algebra Appl., 34 (1980), pp. 154-194.