Relations between Galerkin and norm-minimizing iterative methods for solving linear systems

SIAM Journal on Matrix Analysis and Applications

Volumn 17, Issue 2, 1996, Pages 223-247

  Cullum, Jane ^a   Greenbaum, Anne ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Arnoldi; Biconjugate gradients; GMRES; Iterative methods; QMR

Indexed keywords

EID: 0030542825     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479893246765     Document Type: Article

References (28)

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. C. BREZINSKI, M. REDIVO ZAGLIA, AND H. SADOK, A breakdown-free Lanczos type algorithm for solving linear systems, Numer. Math., 63 (1992), pp. 29-38.
3. P. N. BROWN, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 58-78.
4. J. K. CULLUM, Peaks and plateaus in Lanczos methods for solving nonsymmetric systems of equations Ax = b, IBM research report RC 18084, T. J. Watson Research Center, Yorktown Heights, NY, 1992.
5. J. K. CULLUM AND R. A. WILLOUGHBY, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. 1, Theory, Progress in Scientific Computing Vol. 3, S. Abarbanel et al. eds., Birkhäuser, Basel, Switzerland, 1985.
6. J. DRKOŠOVÁ, A. GREENBAUM, M. ROZLOŽNÍK, AND Z. STRAKOŠ, Numerical stability of GMRES, BIT, 35 (1995), pp. 309-330.
7. R. FLETCHER, Conjugate gradient methods for indefinite systems, in Numerical Analysis Dundee 1975, G. A. Watson, ed., Lecture Notes in Mathematics 506, Springer-Verlag, Berlin, 1976, pp. 73-89.
8. R. W. FREUND AND N. M. NACHTIGAL, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
9. R. W. FREUND, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput., 14 (1993), pp. 470-482.
10. R. W. FREUND, M. H. GUTKNECHT, AND N. M. NACHTIGAL, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput., 14 (1993), pp. 137-158.
11. G. H. GOLUB AND W. KAHAN, Calculating the singular values and pseudo-inverse of a matrix, SIAM J. Numer. Anal., 2 (1965), pp. 205-224.
12. A. GREENBAUM, Behavior of slightly perturbed Lanczos and conjugate gradient recurrences, Lin. Algebra Appl., 113 (1989), pp. 7-63.
13. A. GREENBAUM AND Z. STRAKOS, Predicting the behavior of finite precision Lanczos and conjugate gradient computations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 121-137.
14. A. GREENBAUM, Accuracy of computed solutions from conjugate-gradient-like methods, in PCG '94: Advances in Numerical Methods for Large Sparse Sets of Linear Equations, M. Natori and T. Nodera, eds., Keio University, Yokahama, Japan, 1994, pp. 126-138.
15. M. H. GUTKNECHT, Changing the norm in conjugate gradient type algorithms, SIAM J. Numer. Anal., 30 (1993), pp. 40-56.
16. R. O. HILL, JR. AND B. N. PARLETT, Refined interlacing properties, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 239-247.
17. C. LANCZOS, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Natl. Bur. Stand., 45 (1950), pp. 255-282.
18. C. C. PAIGE, Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix, J. Inst. Math. Appl., 18 (1976), pp. 341-349.
19. _, Bidiagonalization of matrices and solution of linear equations, SIAM J. Numer. Anal., 11 (1974), pp. 197-209.
20. C. C. PAIGE AND M. A. SAUNDERS, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1975), pp. 617-629.
21. B. N. PARLETT, D. R. TAYLOR, AND Z. A. LIU, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp., 44 (1985), pp. 105-124.
22. Y. SAAD, Krylov subspace methods for solving unsymmetric linear systems, Math. Comp., 37 (1981), pp. 105-126.
23. 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.
24. G. SZEGO, Orthogonal Polynomials, American Mathematical Society Colloquium Publications, Volume XXIII, New York, 1959.
25. H. A. VAN DER VORST AND C. VUIK, The superlinear convergence behavior of GMRES, J. Comp. Appl. Math., 48 (1993), pp. 327-341.
26. A. VAN DER SLUIS AND H. A. VAN DER VORST, The convergence behavior of Ritz values in the presence of close eigenvalues, Lin. Algebra Appl. 88/89 (1987), pp. 651-694.
27. H. F. WALKER, Implementation of the GMRES method using Householder transformations, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 152-163.
28. R. WEISS, Convergence behavior of generalized conjugate gradient methods, Ph.D. thesis, University of Karlsruhe, Karlsruhe, Germany, 1990.