A note on conjugate-gradient type methods for indefinite and/or inconsistent linear systems
Article
- 83 Downloads
- 4 Citations
Abstract
To design a conjugate-gradient type method for a given linear system one has to choose an inner product space and to compute residual polynomials which minimize the induced norm. Here we propose a unified treatment of this approach for symmetric linear systems. We mainly focus on indefinite and/or inconsistent systems.
Keywords
Linear System Product Space Type Method Unify Treatment Inconsistent System
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- [1]D. Calvetti, L. Reichel and Q. Zhang, Conjugate gradient algorithms for symmetric inconsistent linear systems,Proceedings of the Lanczos International Centenary Conference, eds. M. Chu, R.J. Plemmons, D. Brown and D. Ellison (SIAM, Philadelphia, 1994) pp. 267–272.Google Scholar
- [2]M. Eiermann, I. Marek and W. Niethammer, On the solution of singular linear systems of algebraic equations by semiiterative methods, Numer. Math. 53 (1988) 265–283.CrossRefGoogle Scholar
- [3]B. Fischer,Polynomial Based Iteration Methods for Symmetric Linear Systems (Teubner, Stuttgart, 1996).Google Scholar
- [4]R. Freund, Über einige CG-ähnliche Verfahren zur Lösung linearer Gleichungssysteme, Dissertation, Universität Würzburg (1983).Google Scholar
- [5]V.M. Fridman, The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix, USSR Comput. Math. Math. Phys. 2 (1963) 362–363.CrossRefGoogle Scholar
- [6]G.H. Golub and R.S. Varga, Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. Numer. Math. 3 (1961) 147–168.CrossRefGoogle Scholar
- [7]M. Hanke,Conjugate Gradient Type Methods for Ill-Posed Problems to appear in: Pitman Research Notes in Mathematics (Longman Scientific & Technical, Harlow, Essex, UK).Google Scholar
- [8]M. Hanke and M. Hochbruck, A Chebyshev-like semiiteration for inconsistent linear systems, Elec. Trans. Numer. Anal. 1 (1993) 89–103.Google Scholar
- [9]M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Standards 49 (1952) 409–436.Google Scholar
- [10]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) 255–282.Google Scholar
- [11]C.C. Paige and M.A. Saunders, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. 12 (1975) 617–629.Google Scholar
- [12]H. Rutishauser, Theory of gradient methods, in:Refined Iterative Methods for Computation of the Solution and the Eigenvalues of Self-adjoint Boundary Value Problems, eds. M. Engeli, T. Ginsburg, H. Rutishauser and E. Stiefel (Birkhäuser, Basel/Stuttgart, 1959).Google Scholar
- [13]J. Stoer and R. Freund, On the solution of large indefinite systems of linear equations by conjugate gradient algorithms, in:Computing Methods in Applied Sciences and Engineering, eds. V.R. Glowinski and J.L. Lions (North-Holland, Amsterdam, 1982).Google Scholar
Copyright information
© J. C. Baltzer AG, Science Publishers 1996