A New Variant of Restarted GMRES

Numerical Linear Algebra with Applications

Volumn 6, Issue 1, 1999, Pages 61-77

  Simoncini, V ^a  

^a CNR   (Italy)

Author keywords

Iterative methods; Linear systems; Residual polynomials; Restarts

Indexed keywords

EID: 0033421859     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1506(199901/02)6:1<61::AID-NLA146>3.0.CO;2-W     Document Type: Article

References (28)

1. M. Arioli, I. S. Duff and D. Ruiz. Stopping criteria for iterative solvers. SIAM J. Matrix Anal. Appl., 13, 138-144, 1992.
2. J. Baglama, D. Calvetti, G. H. Golub and L. Reichel. Adaptively preconditioned GMRES algorithms. Technical Report, 1996.
3. A. Chapman and Y. Saad. Deflated and augmented Krylov subspace techniques. J. Numer. Linear Algebra with Appl., 4, 43-66, 1997.
4. J. Cullum and A. Greenbaum. Relations between Galerkin and norm-minimizing iterative methods for solving linear systems. SIAM J. Matrix Anal. Appl., 17, 223-247, 1996.
5. I. S. Duff, R. G. Grimes and J. G. Lewis. User's guide for the Harwell-Boeing sparse matrix collection (Release I). Technical Report TR/PA/92/86, CERFACS, Toulouse Cedex, France, October 1992.
6. E. De Sturler, Truncation strategies for optimal Krylov subspace methods. Technical Report 96-38, CSCS, Zurich, Switzerland, 1996.
7. J. Erhel, K. Burrage and B. Pohl. Restarted GMRES preconditioned by deflation. Technical Report, Seminar für Angewandte Mathematik, Eidgenössische Technische Hochschule, Zürich, Switzerland, July 1994.
8. R. W. Freund. Quasi-kernel polynomials and their use in non-Hermitian matrix iterations. /. Comput. Appl. Math., 43, 135-158, 1992.
9. G. Golub and C. F. Van Loan. Matrix Computations, third edition, The Johns Hopkins University Press, Baltimore, 1996.
10. W. D. Joubert. A robust GMRES-based adaptive polynomial preconditioning algorithm for nonsymmetric linear systems. SIAM J. Sci. Comput., 15, 427-439, 1994.
11. W. D. Joubert. On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems. J. Numer. Linear Algebra with Appl., 1, 427-448, 1994.
12. E. M. Kasenally and V. Simoncini. Analysis of a minimum perturbation algorithm for nonsymmetric linear systems. SIAM J. Numer. Anal., 34, 48-66, 1997.
13. R. B. Morgan. A restarted GMRES method augmented with eigenvectors. SIAM J. Matrix Anal. Appl., 16, 1154-1171, 1995.
14. R. B. Morgan. Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations. Technical Report. Baylor University, US, 1997.
15. N. M. Nachtigal, L. Reichel and L. N. Trefethen. A hybrid GMRES algorithm for nonsymmetric matrix iterations. SIAM J. Matrix Anal. Appl., 13, 796-825, 1992.
16. Y. Saad. Numerical Methods for Large Eigenvalue Problems, Halstead Press, New York, 1992.
17. Y Saad. Iterative Methods for Sparse Linear Systems, The PWS Publishing Company, Boston, MA, 1996.
18. Y. Saad. Analysis of augmented Krylov subspace methods. SIAM J. Matrix Anal. Appl., 18, 435-449, 1997.
19. Y. Saad. Further analysis of minimum residual iterations. Technical Report umsi-97-14, Department of Computer Sciences, University of Minnesota, Minneapolis, MN, August 1997.
20. Y. Saad and M. H. Schultz, GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput., 7, 856-869, 1986.
21. P. E. Saylor and D. C. Smolarski. Implementation of an adaptive algorithm for Richardson's method. Lin. Alg. Appl., V. 154-156, 1991.
22. P. E. Saylor and D. C. Smolarski. Computing the roots of complex orthogonal and kernel polynomials. SIAM J. Sci. Comput, 9, 1-13, 1988.
23. V. Simoncini. On the convergence of restarted Krylov subspace methods, IAN Tech. Rep. 1093 (1998)
24. G. Starke and R. S. Varga. A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations. Numer. Math., 64, 213-240, 1993.
25. J. C. Strikwerda and S. C. Stodder. Convergence results of GMRES. Technical Report, Department of Computer Sciences, University of Wisconsin, Madison, WI, August 1995.
26. L. N. Trefethen. Approximation theory and numerical linear algebra. In J. C. Mason and M. G. Cox, editors, Algorithms for Approximation II, pp. 336-360, Chapman and Hall, London, UK, 1990.
27. H. A. van der Vorst and C. Vuik. The superlinear convergence behaviour of GMRES. J. of Comp. and Appl. Math., 48, 327-341, 1993.
28. L. Zhou and H. F. Walker. Residual smoothing techniques for iterative methods. SIAM J. Sci. Comput., 15, 297-312 1994.