Adaptively preconditioned gmres algorithms

SIAM Journal on Scientific Computing

Volumn 20, Issue 1, 1998, Pages 243-269

  Baglama, J ^a   Calvetti, D ^b   Golub, G H ^c   Reichel, L ^d  

^a Department of Mathematics ^*  (United States)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

^c Stanford University   (United States)

^d KENT STATE UNIVERSITY   (United States)

Author keywords

Arnoldi process; Iterative method; Nonsymmetric linear system; Preconditioner

Indexed keywords

ARNOLDI PROCESS; GENERALIZED MINIMAL RESIDUAL (GMRES) ALGORITHMS;

CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; LINEAR EQUATIONS; MATRIX ALGEBRA;

ITERATIVE METHODS;

EID: 0032131177     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827596305258     Document Type: Article

References (29)

1. W. E. ARNOLDI, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. O. AXELSSON, Iterative Solution Methods, Cambridge University Press, Cambridge, 1994.
3. J. BAGLAMA, D. CALVETTI, AND L. REICHEL, Iterative methods for computing a few eigenvalues of a large symmetric matrix, BIT, 36 (1996), pp. 400-412.
4. Z. BAI, D. Hu, AND L. REICHEL, A Newton basis GMRES implementation, IMA J. Numer. Anal., 14 (1994), pp. 563-581.
5. D. CALVETTI, J. PETERSEN, AND L. REICHEL, A parallel implementation of the GMRES algorithm, in Numerical Linear Algebra, L. Reichel, A. Ruttan, and R. S. Varga, eds., de Gruyter, Berlin, 1993, pp. 31-46.
6. D. CALVETTI, L. REICHEL, AND D. C. SORENSEN, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Elec. Trans. Numer. Anal., 2 (1994), pp. 1-21.
7. A. CHAPMAN AND Y. SAAD, Deflated and Augmented Krylov Subspace Techniques, Report UMSI 95/181, University of Minnesota, Supercomputer Institute, Minneapolis, MN, 1995.
8. R. D. DA CUNHA AND T. HOPKINS, A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations, Adv. Comput. Math., 2 (1994), pp. 261-277.
9. J. DRKOSOVA, A. GREENBAUM, M. ROZLOZNIK, AND Z. STRAKOS, Numerical stability of GMRES, BIT, 35 (1995), pp. 309-320.
10. H. C. ELMAN AND R. L. STREIT, Polynomial iteration for nonsymmetric indefinite linear systems, in Numerical Analysis, J. P. Hennart, ed., Lecture Notes in Mathematics 1230, Springer, New York, 1984, pp. 103-117.
11. J. ERHEL, A parallel GMRES version for general sparse matrices, Elec. Trans. Numer. Anal., 3 (1995), pp. 160-176.
12. J. ERHEL, K. BURRAGE, AND B. POHL, Restarted GMRES preconditioned by deflation, J. Comput. Appl. Math., 69 (1996), pp. 303-318.
13. B. FISCHER AND L. REICHEL, A stable Richardson iteration method for complex linear systems, Numer. Math., 54 (1988), pp. 225-242.
14. R. W. FREUND, G. H. GOLUB, AND N. M. NACHTIGAL, Iterative solution of linear systems, Acta Numerica, 1992, pp. 57-100.
15. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, 1989.
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. M. J. GROTE AND T. HUCKLE, Parallel preconditioning with sparse approximate inverses, SIAM J. Sci. Comput., 18 (1997), pp. 838-853.
18. S. A. KHARCHENKO AND A. Yu. YEREMIN, Eigenvalue translation based preconditioned for the GMRES(k) method, Numer. Linear Algebra Appl., 2 (1995), pp. 51-77.
19. R. LEHOUCQ, Analysis and Implementation of an Implicitly Restarted Arnoldi Iteration, Ph.D. Thesis, Rice University, Houston, 1995.
20. R. B. MORGAN, A restarted GMRES method augmented with eigenvectors, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 1154-1171.
21. N. M. NACHTIGAL, L. REICHEL, AND L. N. TREFETHEN, A hybrid GMRES algorithm for non-symmetric linear systems, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 796-825.
22. Y. SAAD, Krylov subspace methods for solving large unsymmetric systems of linear equations, Math. Comp., 37 (1981), pp. 105-126.
23. Y. SAAD, Preconditioned Krylov Subspace Methods for CFD Applications, Report UMSI 94/171, Supercomputer Institute, University of Minnesota, Minneapolis, MN, 1994.
24. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimum residual algorithm for solving non-symmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
25. G. D. SMITH, Numerical Solution of Partial Differential Equations: Finite Difference Methods, Oxford University Press, New York, 1978.
26. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
27. J. STOER AND R. BULIRSCH, Introduction to Numerical Analysis, Springer, New York, 1980.
28. H. A. VAN DER VORST AND C. VUIK, The superlinear convergence behaviour of GMRES, J. Comput. Appl. Math., 48 (1993), pp. 327-341.
29. H. F. WALKER AND L. ZHOU, A simpler GMRES, Numer. Linear Algebra Appl., 1 (1994), pp. 571-581.