A class of iterative methods of conjugate gradient type

DOI10.1080/01630569008816376zbMath0727.65047OpenAlexW1974522276MaRDI QIDQ3349876

L. J. Lardy

Publication date: 1990

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630569008816376

zbMATH Keywords

convergenceerror boundsHilbert spacesconjugate gradient methoditerative methodserror estimationsleast squares solutionalpha processes

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50)

Related Items

A modified steepest descent scheme for solving a class of parameter identification problems, A modified convergence analysis for steepest descent scheme for solving nonlinear operator equation, A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems, Convergence rate results for steepest descent type method for nonlinear ill-posed equations, Multilevel algorithms for ill-posed problems, Iterative methods for computing generalized inverses related with optimization methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A minimal error conjugate gradient method for ill-posed problems
• A limited survey of various conjugate gradient methods for solving complex matrix equations arising in electromagnetic wave interactions
• Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
• Some Superlinear Convergence Results for the Conjugate Gradient Method
• Proof of a conjecture of Askey on orthogonal expansions with positive coefficients
• On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations