Using a priori information about a solution of an ill-posed problem for constructing regularizing algorithms and their applications

DOI10.1080/17415970600573809zbMath1113.80017OpenAlexW2170897873MaRDI QIDQ3426205

Anatoly G. Yagola, V. N. Titarenko

Publication date: 8 March 2007

Published in: Inverse Problems in Science and Engineering (Search for Journal in Brave)

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

zbMATH Keywords

error estimationcompact setill-posed problemregularizing algorithmmethod of extending compacts

Mathematics Subject Classification ID

Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Related Items (1)

Impact of conditional stability: Convergence rates for general linear regularization methods

Cites Work

• The problems of linear and quadratic programming for ill-posed problems on some compact sets

This page was built for publication: Using a priori information about a solution of an ill-posed problem for constructing regularizing algorithms and their applications