Look-ahead procedures for lanczos-type product methods based on three-term lanczos recurrences

SIAM Journal on Matrix Analysis and Applications

Volumn 21, Issue 4, 2000, Pages 1051-1078

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

^a ETH ZURICH   (Switzerland)

^b GERMAN AEROSPACE CENTER DLR   (Germany)

Author keywords

Iterative methods; Lanczos type product methods; Look ahead; Non hermitian matrices; Sparse linear systems

Indexed keywords

EID: 0034144748     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479896306744     Document Type: Article

References (48)

1. E. AYACHOUR, Avoiding the look-ahead in the Lanczos method, Appl. Math. (Warsaw), 26 (1999), pp. 33-62.
2. D. L. BOLEY, S. ELHAY, G. H. GOLUB, AND M. H. GUTKNECHT, Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights, Numer. Algorithms, 1 (1991), pp. 21-43.
3. C. BREZINSKI, CGM: A Whole Class of Lanczos-Type Solvers for Linear Systems, Tech. Report ANO-253, Université Lille Flandres Artois, France, 1991.
4. C. BREZINSKI AND M. REDIVO ZAGLIA, Breakdowns in the computation of orthogonal polynomials, in Nonlinear Numerical Methods and Rational Approximation II, A. Cuyt, ed., Kluwer, Dordrecht, The Netherlands, 1994, pp. 49-59.
5. C. BREZINSKI AND M. REDIVO ZAGLIA, Treatment of near-breakdown in the CGS algorithms, Numer. Algorithms, 7 (1994), pp. 33-73.
6. C. BREZINSKI AND M. REDIVO ZAGLIA, Look-ahead in Bi-CGSTAB and other product methods for linear systems, BIT, 35 (1995), pp. 169-201.
7. C. BREZINSKI, M. REDIVO ZAGLIA, AND H. SADOK, New look-ahead Lanczos-type algorithms for linear systems, Numer. Math., 83 (1999), pp. 53-85.
8. C. BREZINSKI AND H. SADOK, Avoiding breakdown in the CGS algorithm, Numer. Algorithms, 1 (1991), pp. 199-206.
9. Z.-H. CAO, Avoiding breakdown in variants of the BI-CGSTAB algorithm, Linear Algebra Appl., 263 (1997), pp. 113-132.
10. Z.-H. CAO, On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems, Appl. Numer. Math., 27 (1998), pp. 123-140.
11. 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.
12. V. EIJKHOUT, LAPACK Working Note 78: Computational Variants of the CGS and BiCGstab Methods, Tech. Report UT-CS-94-241, Computer Science Department, University of Tennessee, Knoxville, TN, 1994.
13. D. A. FLANDERS AND G. SHORTLY, Numerical determination of fundamental modes, J. Appl. Phys., 21 (1950), pp. 1326-1332.
14. R. W. FREUND, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput., 14 (1993), pp. 470-482.
15. 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.
16. R. W. FREUND AND N. M. NACHTIGAL, QMR: A quasi-minimal residual method for nonHermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
17. R. W. FREUND AND H. ZHA, A look-ahead algorithm for the solution of general Hankel systems, Numer. Math., 64 (1993), pp. 295-321.
18. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
19. P. R. GRAVES-MORRIS, A "look-around Lanczos" algorithm for solving a system of linear equations, Numer. Algorithms, 15 (1997), pp. 247-274.
20. M. H. GUTKNECHT, The unsymmetric Lanczos algorithms and their relations to Padé approximation, continued fractions, and the qd algorithm, in Preliminary Proceedings of the Copper Mountain Conference on Iterative Methods, Copper Mountain, CO, 1990.
21. M. H. GUTKNECHT, A completed theory of the unsymmetric Lanczos process and related algorithms, I, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 594-639.
22. M. H. GUTKNECHT, Variants of BiCGStab for matrices with complex spectrum, SIAM J. Sci. Comput., 14 (1993), pp. 1020-1033.
23. M. H. GUTKNECHT, A completed theory of the unsymmetric Lanczos process and related algorithms, II, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 15-58.
24. M. H. GUTKNECHT, The Lanczos process and Padé approximation, in Proceedings of the Cornelius Lanczos International Centenary Conference, J. D. Brown, M. T. Chu, D. C. Ellison, and R. J. Plemmons, eds., SIAM, Philadelphia, PA, 1994, pp. 61-75.
25. M. H. GUTKNECHT, Lanczos-type solvers for nonsymmetric linear systems of equations, Acta Numer., 6 (1997), pp. 271-397.
26. M. H. GUTKNECHT AND K. J. RESSEL, Look-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Recurrences, Tech. Report TR-96-19, Swiss Center for Scientific Computing, Manno, Switzerland, 1996.
27. M. HOCHBRUCK, Lanczos- und Krylov-Verfahren für nicht-Hermitesche lineare Systeme, Ph.D. thesis, Fakultät für Mathematik, Universität Karlsruhe, Karlsruhe, Germany, 1992.
28. M. HOCHBRUCK, The Padé table and its relation to certain numerical algorithms, Habilitationsschrift, Universität Tübingen, Germany, 1996.
29. W. D. JOUBERT, Generalized Conjugate Gradient and Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations, Ph.D. thesis, Center for Numerical Analysis, University of Texas at Austin, 1990.
30. W. D. JOUBERT, Iterative Methods for the Solution of Nonsymmetric Systems of Linear Equations, Tech. Report CNA-239, Center for Numerical Analysis, University of Texas at Austin, 1990.
31. W. JOUBERT, Lanczos methods for the solution of nonsymmetric systems of linear equations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 926-943.
32. C. LANCZOS, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Research Nat. Bur. Standards, 45 (1950), pp. 255-281.
33. T. A. MANTEUFFEL, The Tchebyshev iteration for nonsymmetric linear systems, Numer. Math., 28 (1977), pp. 307-327.
34. B. N. PARLETT, Reduction to tridiagonal form and minimal realizations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 567-593.
35. 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.
36. K. J. RESSEL AND M. H. GUTKNECHT, QMR smoothing for Lanczos-type product methods based on three-term recurrences, SIAM J. Sci. Comput., 19 (1998), pp. 55-73.
37. W. SCHÖNAUER, Scientific Computing on Vector Computers, Elsevier, Amsterdam, 1987.
38. G. L. G. SLEIJPEN AND D. R. FOKKEMA, BiCGstab(l) for linear equations involving unsymmetric matrices with complex spectrum, Electron. Trans. Numer. Anal., 1 (1993), pp. 11-32.
39. G. L. G. SLEIJPEN AND H. A. VAN DER VORST, Maintaining convergence properties of BiCGstab methods in finite precision arithmetic, Numer. Algorithms, 10 (1995), pp. 203-223.
40. G. L. G. SLEIJPEN AND H. A. VAN DER VORST, An overview of approaches for the stable computation of hybrid BiCG methods, Appl. Numer. Math., 19 (1995), pp. 235-254.
41. G. L. G. SLEIJPEN, H. A. VAN DER VORST, AND D. R. FOKKEMA, BiCGstab(l) and other hybrid Bi-CG methods, Numer. Algorithms, 7 (1994), pp. 75-109.
42. P. SONNEVELD, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 36-52.
43. D. R. TAYLOR, Analysis of the Look Ahead Lanczos Algorithm, Ph.D. thesis, Department of Mathematics, University of California, Berkeley, 1982.
44. H. A. VAN DER VOHST, 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.
45. H. E. WRIGLEY, Accelerating the Jacobi method for solving simultaneous equations by Chebyshev extrapolation when the eigenvalues of the iteration matrix are complex, Comput. J., 6 (1963), pp. 169-176.
46. S.-L. ZHANG, GPBI-CG: Generalized product-type methods based on Bi-CG for solving nonsymmetric linear systems, SIAM J. Sci. Comput., 18 (1997), pp. 537-551.
47. L. ZHOU AND H. F. WALKER, Residual smoothing techniques for iterative methods, SIAM J. Sci. Comput., 15 (1994), pp. 297-312.
48. M. ZIEGLER, Generalized biorthogonal bases and tridiagonalisation of matrices, Numer. Math., 77 (1977), pp. 407-421.