QMR smoothing for Lanczos-type product methods based on three-term recurrences

SIAM Journal on Scientific Computing

Volumn 19, Issue 1, 1998, Pages 55-73

  Ressel, Klaus J ^a,b   Gutknecht, Martin H ^a  

^a Centro Svizzero Di Calcolo Scientifico   (Switzerland)

^b GERMAN AEROSPACE CENTER DLR   (Germany)

Author keywords

Iterative methods; Lanczos type product methods; Non Hermitian matrices; QMR smoothing; Sparse linear systems

Indexed keywords

EID: 0001746830     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827596304812     Document Type: Article

References (36)

1. T. BARTH AND T. A. MANTEUFFEL, Estimating the Spectrum of a Matrix Using the Roots of the Polynomials Associated with the QMR Iterations, Tech. report, Center for Computational Mathematics, University of Colorado at Denver, Denver, CO, 1993.
2. T. BARTH AND T. A. MANTEUFFEL, Variable metric conjugate gradient methods, in Advances in Numerical Methods for Large Sparse Sets of Linear Equations, N. Natori and T. Nodera, eds., No. 10 in Matrix Analysis and Parallel Computing, PCG '94, Keio University, Yokahama, Japan, 1994, pp. 165-188.
3. C. BREZINSKI AND M. REDIVO ZAGLIA, Treatment of near-breakdown in the CGS algorithms, Numer. Algorithms, 7 (1994), pp. 33-73.
4. C. BREZINSKI AND M. REDIVO ZAGLIA, Look-ahead in BI-CGSTAB and other product-type methods for linear systems, BIT, 35 (1995), pp. 169-201.
5. P. N. BROWN, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 58-78.
6. Z.-H. CAO, On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems, manuscript, 1995.
7. T. F. CHAN, E. GALLOPOULOS, V. SIMONCINI, T. SZETO, AND C. H. TONG, A quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems, SIAM J. Sci. Comput., 15 (1994), pp. 338-347.
8. J. CULLUM, Peaks, plateaus, numerical instabilities in a Galerkin/minimal residual pair of methods for solving Ax = b, Appl. Numer. Math., 19 (1995), pp. 255-278.
9. J. CULLUM AND A. GREENBAUM, Relations between Galerkin and norm-minimizing iterative methods for solving linear systems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 223-247.
10. V. FABER AND T. A. MANTEUFFEL, Necessary and sufficient conditions for the existence of a conjugate gradient method, SIAM J. Numer. Anal., 21 (1984), pp. 352-362.
11. 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.
12. D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Generalized conjugate gradient squared, J. Comput. Appl. Math., 71 (1996), pp. 125-146.
13. R. W. FREUND, Transpose-free quasi-minimal residual methods for non-Hermitian linear systerns, SIAM J. Sci. Comput., 14 (1993), pp. 470-482.
14. 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.
15. 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.
16. M. H. GUTKNECHT, Changing the norm in conjugate gradient type algorithms, SIAM J. Numer. Anal., 30 (1993), pp. 40-56.
17. M. H. GUTKNECHT, Variants of BICGSTAB for matrices with complex spectrum, SIAM J. Sci. Comput., 14 (1993), pp. 1020-1033.
18. M. H. GUTKNECHT, A completed theory of the unsymmetric Lanczos process and related algorithms, Parts I and II, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 594-639 and 15 (1994), pp. 15-58.
19. M. H. GUTKNECHT, A completed theory of the unsymmetric Lanczos process and related algorithms, Parts I and II, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 594-639 and 15 (1994), pp. 15-58.
20. M. H. GUTKNECHT AND K. J. RESSEL, Look-ahead procedures for Lanczos-type product methods based on three-term recurrences, SIAM J. Matrix Anal. Appl., submitted.
21. C. LANCZOS, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Standards, 45 (1950), pp. 255-281.
22. C. LANCZOS, Solution of systems of linear equations by minimized iterations, J. Res. Nat. Bur. Standards, 49 (1952), pp. 33-53.
23. T. A. MANTEUFFEL, The Tchebychev iteration for nonsymmetric linear systems, Numer. Math., 28 (1977), pp. 307-327.
24. T. A. MANTEUFFEL, Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration, Numer. Math., 31 (1978), pp. 183-208.
25. 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.
26. K. J. RESSEL, Hybrid Lanczos-type product methods, in preparation.
27. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing, Boston, MA, 1996.
28. W. SCHÖNAUER, Scientific Computing on Vector Computers, Elsevier, Amsterdam, 1987.
29. G. L. G. SLEIJPEN AND D. R. FOKKEMA, BiCGstab(l) for linear equations involving matrices with complex spectrum, Electron. Trans. Numer. Anal., 1 (1993), pp. 11-32.
30. P. SONNEVELD, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 36-52.
31. C. H. TONG, A family of quasi-minimal residual methods for nonsymmetric linear systems, SIAM J. Sci. Comput., 15 (1994), pp. 89-105.
32. H. A. VAN DER VORST, 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), pp. 631-644.
33. R. WEISS, Convergence Behavior of Generalized Conjugate Gradient Methods, Ph.D. thesis, University of Karlsruhe, Germany, 1990.
34. R. WEISS, Properties of generalized conjugate gradient methods, J. Numer. Linear Algebra Appl., 1 (1994), pp. 45-63.
35. S.-L. ZHANG, GPBi-CG: Generalized product-type methods based on Bi-CG for solving non-symmetric linear systems, SIAM J. Sci. Comput., 18 (1997), pp. 537-551.
36. L. ZHOU AND H. F. WALKER, Residual smoothing techniques for iterative methods, SIAM J. Sci. Comput., 15 (1994), pp. 297-312.