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

نویسندگان

چکیده

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

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global Saturation of Regularization Methods for Inverse Ill-Posed Problems

In this article the concept of saturation of an arbitrary regularization method is formalized based upon the original idea of saturation for spectral regularization methods introduced by Neubauer [5]. Necessary and sufficient conditions for a regularization method to have global saturation are provided. It is shown that for a method to have global saturation the total error must be optimal in t...

متن کامل

Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems

Numerical solution of ill-posed problems is often accomplished by discretization (projection onto a finite dimensional subspace) followed by regularization. If the discrete problem has high dimension, though, typically we compute an approximate solution by projecting the discrete problem onto an even smaller dimensional space, via iterative methods based on Krylov subspaces. In this work we pre...

متن کامل

Learning, Regularization and Ill-Posed Inverse Problems

Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal evidence neither that learning from examples could be seen as an inverse problem nor that theoretical results in learning theory could be independently derived using tools from regularization theory. In this paper we pro...

متن کامل

Ill-Posed and Linear Inverse Problems

In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.

متن کامل

Nonlinear regularization methods for ill-posed problems

In this paper we consider nonlinear ill-posed problems with piecewise constant or strongly varying solutions. A class of nonlinear regularization methods is proposed, in which smooth approximations to the Heavyside function are used to reparameterize functions in the solution space by an auxiliary function of levelset type. The analysis of the resulting regularization methods is carried out in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Inverse Problems and Imaging

سال: 2021

ISSN: ['1930-8345', '1930-8337']

DOI: https://doi.org/10.3934/ipi.2020062