Avoiding breakdown in Van der Vorst's method

Numerical Algorithms

Volumn 21, Issue 1-4, 1999, Pages 205-223

  Graves Morris, P R ^a   Salam, A ^b  

^a UNIVERSITY OF BRADFORD   (United Kingdom)

^b UNIVERSITÉ DU LITTORAL CÔTE D OPALE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033425706     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1019145010317     Document Type: Article

References (15)

1. 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) 21-43.
2. C. Brezinski, A transpose-free "Lanczos-Orthodir" algorithm for linear systems, C. R. Acad. Sci. Paris 324 (1997) 349-354.
3. C. Brezinski and M. Redivo-Zaglia, Look-ahead in Bi-CGStab and other product methods for linear systems, BIT 35 (1995) 169-201.
4. C. Brezinski, M. Redivo-Zaglia and H. Sadok, Avoiding breakdown and near-breakdown in Lanczos type algorithms, Numer. Algorithms 1 (1991) 261-284.
5. C. Brezinski, M. Redivo-Zaglia and H. Sadok, A breakdown-free Lanczos type algorithm for solving linear systems, Numer. Math. 63 (1992) 29-38.
6. C. Brezinski, M. Redivo-Zaglia and H. Sadok, New look-ahead Lanczos-type algorithms for linear systems, LMA No. 40, L'Université du Littoral, preprint (1997); Numer. Math., to appear.
7. C. Brezinski and H. Sadok, Lanczos type algorithms for solving systems of linear equations, Appl. Numer. Math. 11 (1993) 443-473.
8. R.W. Freund, E.H. Golub and N.M. Nachtigal, Iterative solution of linear systems, Acta Numerica 1 (1992) 57-100.
9. W. Gander, E.H. Golub and D. Gruntz, Solving linear equations by extrapolation, in: Supercomputing, Trondheim (1989), Computer Systems Science, Vol. 62 (Springer, Berlin, 1989) pp. 279-293.
10. W.B. Gragg, Matrix interpretations and applications of the continued fraction algorithm, Rocky Mountain J. Math. 4 (1974) 213-225.
11. P.R. Graves-Morris, A "Look-around Lanczos" algorithm for solving a system of linear equations, Numer. Algorithms 15 (1997) 247-274.
12. M.H. Gutknecht, Lanczos-type solvers for non-symmetric linear systems of equations, Acta Numerica 6 (1997) 271-397.
13. M.H. Gutknecht and M. Hochbruck, Optimised look-ahead recurrences for adjacent rows in the Padé table, BIT 36 (1996) 264-286.
14. 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) 631-644.
15. P.K.W. Vinsome, Orthomin, an iterative method for solving sparse sets of simultaneous linear equations, in: Proc. 4th Symp. on Reservoir Simulation (Society of Petroleum Engineers of AIME, 1976) pp. 149-159.