Approximate solution of nonlinear inverse problems by fixed-point iteration
Sergiy Pereverzyev, René Pinnau, Norbert Siedow
Abstract
Open-access reader
Sergiy Pereverzyev, René Pinnau, Norbert Siedow
Abstract
Open-access reader
In this paper we propose a derivative-free iterative method for the approximate solution of a nonlinear inverse problem Fx = y . In this method the iterations are defined as Gx k +1 = Gx k + ( Sy − SFx k ), where G is an easily invertible operator and S is an operator from a data space to a solution space. We give general suggestions for the choice of operators G and S and show a practically relevant example of an inverse problem where such a method is succesfully applied. We carry out analysis of the proposed method for linear inverse problems. Using the recently introduced balancing principle we construct a stopping rule. Under reasonable assumptions, we show that this stopping rule leads to the regularization algorithm. Numerical results for a test example show its satisfactory behavior.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we propose a derivative-free iterative method for the approximate solution of a nonlinear inverse problem Fx = y . In this method the iterations are defined as Gx k +1 = Gx k + ( Sy − SFx k ), where G is an easily invertible operator and S is an operator from a data space to a solution space. We give general suggestions for the choice of operators G and S and show a practically relevant example of an inverse problem where such a method is succesfully applied. We carry out analysis of the proposed method for linear inverse problems. Using the recently introduced balancing principle we construct a stopping rule. Under reasonable assumptions, we show that this stopping rule leads to the regularization algorithm. Numerical results for a test example show its satisfactory behavior.
Key concepts: Invertible matrix, Regularization (linguistics), Mathematics, Inverse problem, Applied mathematics, Nonlinear system, Linear map, Inverse