Regularizing algorithms based on the conjugate-gradient method

DOI10.1016/0041-5553(86)90174-6MaRDI QIDQ4720690zbMATH OpenOpenAlexFDO

Authors S. F. Gilyazov

Publication date 1986

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(86)90174-6

zbMATH Keywords

conjugate gradient methoderror boundsHilbert spaceill-posed problemsregularization algorithmsstopping rules

Mathematics Subject Classification ID

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

Cited in

(7)

• The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides
• Regularization of linear approximate schemes by the gradient descent
• Optimal algorithms for linear ill-posed problems yield regularization methods
• The Minimal Error Conjugate Gradient Method is a Regularization Method
• Identification of a temporal load in a cantilever beam from measured boundary bending moment
• The regularized global GMERR method for solving large-scale linear discrete ill-posed problems
• The instability of some gradient methods for ill-posed problems

This page was built for publication: Regularizing algorithms based on the conjugate-gradient method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4720690)