The Minimal Error Conjugate Gradient Method is a Regularization Method

DOI10.2307/2161097zbMath0851.65033OpenAlexW4230422079MaRDI QIDQ4874206

Martin Hanke

Publication date: 26 November 1996

Full work available at URL: https://doi.org/10.2307/2161097

zbMATH Keywords

Hilbert spacesconjugate gradient methoddiscrepancy principlestopping rulelinear ill-posed problemorder-optimal convergence

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Related Items (6)

The minimal error method for the Cauchy problem in linear elasticity. Numerical implementation for two-dimensional homogeneous isotropic linear elasticity ⋮ Kernel methods in system identification, machine learning and function estimation: a survey ⋮ An accelerated alternating procedure for the Cauchy problem for the Helmholtz equation ⋮ Identification of a temporal load in a cantilever beam from measured boundary bending moment ⋮ Boundary element-minimal error method for the Cauchy problem associated with Helmholtz-type equations ⋮ Ill-posed problems and the conjugate gradient method: optimal convergence rates in the presence of discretization and modelling errors

Cites Work

• Orthogonal polynomials and measures with end point masses
• A minimal error conjugate gradient method for ill-posed problems
• Accelerated Landweber iterations for the solution of ill-posed equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Minimal Error Conjugate Gradient Method is a Regularization Method