Minimum residual methods for augmented systems

BIT Numerical Mathematics

Volumn 38, Issue 3, 1998, Pages 527-543

  Fischer, B ^a   Ramage, A ^b   Silvester, D J ^c   Wathen, A J ^d  

^a UNIVERSITY OF LÜBECK   (Germany)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^c UNIVERSITY OF MANCHESTER   (United Kingdom)

^d UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Conjugate gradients; Indefinite systems; Minimum residual methods; Preconditioners

Indexed keywords

EID: 0000382130     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02510258     Document Type: Article

References (20)

1. W. Arnoldi, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. Å. Björck, Iterative refinement of linear least squares solutions, BIT, 7 (1967), pp. 257-278.
3. R. Chandra, Conjugate Gradient Methods for Partial Differential Equations, PhD thesis, Yale University Res. Rep. 129, 1978.
4. I. S. Duff, The solution of augmented systems, in Numerical Analysis 1993, D.F. Griffiths and G.A. Watson, eds., Longman, London, 1994, pp. 40-55.
5. S. Eisenstat, Some observations on the generalized conjugate gradient method, in Numerical Methods, V. Pereyra and A. Reinoza, eds., Lecture Notes in Mathematics, Volume 1005, Springer-Verlag, Berlin, 1983, pp. 99-107.
6. H. C. Elman and D. J. Silvester, Fast nonsymmetric iterations and preconditioning for Navier-Stokes equations, SIAM J. Sci. Comput., 17 (1996), pp. 33-46.
7. V. Faber and T. Manteuffel, Necessary and sufficient conditions for the existence of a conjugate gradient method, SIAM J. Numer. Anal., 21 (1984), pp. 352-362.
8. B. Fischer, Polynomial Based Iteration Methods for Symmetric Linear Systems, Wiley-Teubner Series in Advances in Numerical Mathematics, Wiley-Teubner, Chichester, 1996.
9. M. Fortin and F. Brezzi, Mixed and Hybrid Finite Elements Methods, Springer-Verlag, Berlin, 1991.
10. 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.
11. R. W. Freund and N. M. Nachtigal, A new Krylov-subspace method for symmetric indefinite linear systems, in Proceedings of the 14th IMACS World Congress on Computational and Applied Mathematics, W. F. Ames, ed., IMACS, 1994, pp. 1253-1256.
12. G. H. Golub and C. F. Van Loan, Matrix Computations, 2nd ed., Johns Hopkins University Press, London, 1989.
13. C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Stand., 45 (1950), pp. 255-282.
14. N. M. Nachtigal, S. C. Reddy and L. N. Trefethen, How fast are nonsymmetric matrix iterations?, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 778-795.
15. C. C. Paige and M. A. Saunders, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. 12 (1975), pp. 617-629.
16. C. C. Paige and M. A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software 8 (1982), pp. 43-71.
17. Y. Saad and M. H. Schultz, GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869.
18. M. A. Saunders, Solution of sparse rectangular systems using LSQR and Craig, BIT, 35 (1995), pp. 588-604.
19. D. J. Silvester and A. J. Wathen, Fast iterative solution of stabilised Stokes systems part II: using general block preconditioners, SIAM J. Numer. Anal., 31 (1994), pp. 1352-1367.
20. G. Szegö, Orthogonal Polynomials, AMS Colloquium Publications XXIII (revised ed.), AMS, New York, 1959.