Newton type iteration for Tikhonov regularization of non-linear ill-posed Hammerstein type equations (Q2511415): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s12190-013-0681-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142617864 / rank
 
Normal rank

Revision as of 02:06, 20 March 2024

scientific article
Language Label Description Also known as
English
Newton type iteration for Tikhonov regularization of non-linear ill-posed Hammerstein type equations
scientific article

    Statements

    Newton type iteration for Tikhonov regularization of non-linear ill-posed Hammerstein type equations (English)
    0 references
    0 references
    0 references
    5 August 2014
    0 references
    The authors propose a modified Gauss-Newton method for Tikhonov regularization for solving ill-posed Hammerstein type equations \(KF(x)=y^\delta\). The method consists of two steps. First, one solves the linear ill-posed problem \(Kz=y^\delta\), by means of Tikhonov regularization, and then the nonlinear equation \(F(x)=z\). This splitting separates the ill-posed and nonlinearity, and may be advantageous in some applications. The regularization parameter is chosen by an adaptive rule due to \textit{S. Pereverzev} and \textit{E. Schock} [SIAM J. Numer. Anal. 43, No. 5, 2060--2076 (2005; Zbl 1103.65058)]. Some error estimates are provided under a certain source and nonlinearity condition at the initial guess. The analysis is complemented with some numerical experiments.
    0 references
    0 references
    Gauss-Newton method
    0 references
    nonlinear ill-posed problems
    0 references
    Hammerstein operators
    0 references
    Tikhonov regularization
    0 references
    iterative regularization method
    0 references
    adaptive choice
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references