Startseite An application of Newton-type iterative method for the approximate implementation of Lavrentiev regularization
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

An application of Newton-type iterative method for the approximate implementation of Lavrentiev regularization

  • Santhosh George EMAIL logo und Suresan Pareth
Veröffentlicht/Copyright: 1. Oktober 2013

Abstract.

Motivated by the two-step directional Newton method considered by Argyros and Hilout (2010) for approximating a zero of a differentiable function F defined on a convex set of a Hilbert space H, we consider a two-step Newton–Lavrentiev method (TSNLM) for obtaining an approximate solution to the nonlinear ill-posed operator equation , where is a nonlinear monotone operator defined on a real Hilbert space X. It is assumed that and that the only available data are with . We prove that the TSNLM converges cubically to a solution of the equation (such solution is an approximation of ) where x0 is the initial guess. Under a general source condition on , we derive order optimal error bounds by choosing the regularization parameter α according to the balancing principle considered by Perverzev and Schock (2005). The computational results provided endorse the reliability and effectiveness of our method.

Received: 2012-03-06
Revised: 2012-09-21
Accepted: 2012-10-04
Published Online: 2013-10-01
Published in Print: 2013-12-01

© 2013 by Walter de Gruyter Berlin Boston

Heruntergeladen am 21.11.2025 von https://www.degruyterbrill.com/document/doi/10.1515/jaa-2013-0011/html
Button zum nach oben scrollen