Numerical comparison of regularization algorithms for solving ill-posed problems

MaRDI QIDQ2981004zbMATH OpenFDO

Authors Reimo Palm

Publication date 8 May 2017

Full work available at URL http://dspace.ut.ee/bitstream/handle/10062/14623/palm_reimo.pdf?sequence=1&isAllowed=y, http://hdl.handle.net/10062/14623

zbMATH Keywords

numerical experimentsill-posed problemsregularization methodsparameter choice rulesdoctoral thesisTikhonov and Lavrentiev method

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Recommendations

• On minimization strategies for choice of the regularization parameter in ill-posed problems
• On the quasioptimal regularization parameter choices for solving ill-posed problems
• On the choice of the regularization parameter in ill-posed problems with approximately given noise level of data
• A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
• Old and new parameter choice rules for discrete ill-posed problems

Cited in

(12)

• A simplified L-curve method as error estimator
• Comparison of parameter choices in regularization algorithms in case of different information about noise level
• Comparing parameter choice methods for regularization of ill-posed problems
• Numerical implementation of special regularization algorithms for solving a class of ill-posed problems with sourcewise representable solutions
• Heuristic parameter choice in Tikhonov method from minimizers of the quasi-optimality function
• Determination of regularization parameter via solving a multi-objective optimization problem
• A family of rules for parameter choice in Tikhonov regularization of ill-posed problems with inexact noise level
• Comparison of two regularizing algorithms for the solution of a coefficient inverse problem
• Some non-standard regularizing algorithms and their numerical realization
• A numerical comparison of some heuristic stopping rules for nonlinear Landweber iteration
• A comparison of regularizations for an ill-posed problem
• The quasi-optimality criterion in the linear functional strategy

This page was built for publication: Numerical comparison of regularization algorithms for solving ill-posed problems

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