Newton-like methods for the computation of fixed points (Q793499)

From MaRDI portal





scientific article; zbMATH DE number 3856307
Language Label Description Also known as
default for all languages
No label defined
    English
    Newton-like methods for the computation of fixed points
    scientific article; zbMATH DE number 3856307

      Statements

      Newton-like methods for the computation of fixed points (English)
      0 references
      0 references
      1984
      0 references
      This paper deals with iteration schemes of type \(y_ i=F(x_ i)\), \(x_{i+1}=x_ i-[I-F'(\gamma x_ i+(1-\gamma)y_ i)]^{-1}(x_ i- F(x_ i))\), \(i=0,1,2,..\). for a fixed point problem \(F(x)=x,F:\quad X\to X\) a contraction on a Banach space. \(\gamma =1\) corresponds to Newton's method, while \(\gamma =0\) corresponds to the method of Stirling. The author derives error estimates and convergence results suggesting \(\gamma =1/2\) as an optimal parameter. An integral equation is considered as a numerical example. The results are extended to noncontractive operators.
      0 references
      fixed points
      0 references
      contraction
      0 references
      Newton's method
      0 references
      Stirling method
      0 references
      Banach space
      0 references
      error estimates
      0 references
      convergence
      0 references
      optimal parameter
      0 references
      numerical example
      0 references

      Identifiers