A class of iterative methods of conjugate gradient type
- 1 January 1990
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 11 (3-4) , 283-302
- https://doi.org/10.1080/01630569008816376
Abstract
A one parameter family of iterative methods for solving an operator equation with a bounded linear operator between Hilbert spaces is introduced and analyzed. The classical conjugate gradient method is included in the family as is a method due to Le Foll. The latter method is also studied without the assumption that the equation have a solution and convergence properties of the iterates are established in this setting. A general convergence theorem is given and a variety of known bounds for rates of convergence of the conjugate gradient method are extended to the entire class of methods.Keywords
This publication has 9 references indexed in Scilit:
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976SIAM Review, 1989
- A minimal error conjugate gradient method for ill-posed problemsJournal of Optimization Theory and Applications, 1989
- A limited survey of various conjugate gradient methods for solving complex matrix equations arising in electromagnetic wave interactionsWave Motion, 1988
- CONVERGENCE OF THE CONJUGATE GRADIENT METHOD FOR COMPACT OPERATORSPublished by Elsevier ,1987
- Some Superlinear Convergence Results for the Conjugate Gradient MethodSIAM Journal on Numerical Analysis, 1980
- Proof of a conjecture of Askey on orthogonal expansions with positive coefficientsBulletin of the American Mathematical Society, 1975
- On the Convergence of the Conjugate Gradient Method for Singular Linear Operator EquationsSIAM Journal on Numerical Analysis, 1972
- Approximate Solution of Operator EquationsPublished by Springer Nature ,1972
- О некоторых вычислительных схемах итерационных процессовUkrainian Mathematical Journal, 1962