Newton-like methods for the computation of fixed points (Q793499): Difference between revisions

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.