|
This article is cited in 4 scientific papers (total in 4 papers)
Locally extra-optimal regularizing algorithms and a posteriori estimates of the accuracy for ill-posed problems with discontinuous solutions
A. S. Leonov National Nuclear Research University MEPhI, Moscow Engineering Physics Institute, Kashirskoe sh. 31, Moscow, 115409, Russia
Abstract:
Local a posteriori estimates of the accuracy of approximate solutions to ill-posed inverse problems with discontinuous solutions from the classes of functions of several variables with bounded variations of the Hardy or Giusti type are studied. Unlike global estimates (in the norm), local estimates of accuracy are carried out using certain linear estimation functionals (e.g., using the mean value of the solution on a given fragment of its support). The concept of a locally extra-optimal regularizing algorithm for solving ill-posed inverse problems, which has an optimal in order local a posteriori estimate, was introduced. A method for calculating local a posteriori estimates of accuracy with the use of some distinguished classes of linear functionals for the problems with discontinuous solutions is proposed. For linear inverse problems, the method is bases on solving specialized convex optimization problems. Examples of locally extra-optimal regularizing algorithms and results of numerical experiments on a posteriori estimation of the accuracy of solutions for different linear estimation functionals are presented.
Key words:
ill-posed problems, discontinuous solutions, local a posteriori estimate of accuracy, locally extra-optimal regularizing algorithm.
Received: 28.04.2015
Citation:
A. S. Leonov, “Locally extra-optimal regularizing algorithms and a posteriori estimates of the accuracy for ill-posed problems with discontinuous solutions”, Zh. Vychisl. Mat. Mat. Fiz., 56:1 (2016), 3–15; Comput. Math. Math. Phys., 56:1 (2016), 1–13
Linking options:
https://www.mathnet.ru/eng/zvmmf10322 https://www.mathnet.ru/eng/zvmmf/v56/i1/p3
|
Statistics & downloads: |
Abstract page: | 408 | Full-text PDF : | 71 | References: | 98 | First page: | 7 |
|