An \epsilon -Free a Posteriori Stopping Rule for Certain Iterative Regularization Methods

DOI10.1137/0730063MaRDI QIDQ3136571zbMATH OpenOpenAlexFDO

Authors Martin Hanke

Publication date 18 October 1993

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0730063

zbMATH Keywords

numerical experimentsstopping ruleJacobi polynomialsLandweber iterationdiscrepancy principleChristoffel functionsill-posed linear problems\(ny\)-methodtwo-step iterative regularization methodsupdate criterion

Mathematics Subject Classification ID

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

Recommendations

• An optimal stopping rule for the v-method for solving ill-posed problems, using Christoffel functions
• scientific article; zbMATH DE number 3864400
• Stopping rules for solving nonlinear ill-posed problems
• A Lepskij-type stopping rule for regularized Newton methods
• Some a posteriori termination rules for the iterative solution of linear ill-posed problems

Cited in

(6)

• A Lepskij-type stopping rule for regularized Newton methods
• Recursive pseudo-inversion of the Laplace transform on the real line
• Automatic stopping rule for iterative methods in discrete ill-posed problems
• A study of a posteriori stopping in iteratively regularized Gauss-Newton-type methods for approximating quasi-solutions of irregular operator equations
• Asymptotics of orthogonal polynomials and the numerical solution of ill-posed problems
• A Lepskij-type Stopping-Rule for Newton-type Methods with Random Noise

This page was built for publication: An $\epsilon $-Free a Posteriori Stopping Rule for Certain Iterative Regularization Methods

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