Two new non-negativity preserving iterative regularization methods for ill-posed inverse problems

02/11/2020 ∙ by Ye Zhang, et al. ∙ 0

Many inverse problems are concerned with the estimation of non-negative parameter functions. In this paper, in order to obtain non-negative stable approximate solutions to ill-posed linear operator equations in a Hilbert space setting, we develop two novel non-negativity preserving iterative regularization methods. They are based on fixed point iterations in combination with preconditioning ideas. In contrast to the projected Landweber iteration, for which only weak convergence can be shown for the regularized solution when the noise level tends to zero, the introduced regularization methods exhibit strong convergence. There are presented convergence results, even for a combination of noisy right-hand side and imperfect forward operators, and moreover for one of the approaches also convergence rates results. A specifically adapted discrepancy principles are used as a posteriori stopping rule of the established iterative regularization algorithms. For an application of the suggested new approaches, we consider a biosensor problem, which is modelled as a two dimensional linear Fredholm integral equation of the first kind. Several numerical examples, as well as a comparison with the projected Landweber method, are presented to show the accuracy and the acceleration effect of the novel methods. As case studies concerning a real data problem indicate, the developed methods can produce meaningful featured regularized solutions.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.