Abstract
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 Gxk+1 = Gxk + (Sy − SFxk), 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.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.