On an iterative algorithm of order 1.839… for solving nonlinear operator equations<sup>∗)</sup> (Q3219701)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3887007
Language Label Description Also known as
default for all languages
No label defined
    English
    On an iterative algorithm of order 1.839… for solving nonlinear operator equations<sup>∗)</sup>
    scientific article; zbMATH DE number 3887007

      Statements

      On an iterative algorithm of order 1.839… for solving nonlinear operator equations<sup>∗)</sup> (English)
      0 references
      0 references
      1984
      0 references
      secant-type method
      0 references
      generalized divided differences
      0 references
      Banach spaces
      0 references
      semi- local, and monotone convergence
      0 references
      For the solution of an equation \(Fx=0\) involving a nonlinear operator \(F: D\subset X\to Y\) between Banach spaces X, Y, the author considers the iterative process \[ x^{n+1}=x^ n-([x^ n,x^{n-1}]+[x^{n-2},x^ n]-[x^{n-2},x^{n-1}])^{-1}Fx^ n,\quad n=0,1,.... \] Here for fixed x,y\(\in D\), [x,y] denotes a generalized divided difference; that is, any linear operator from X into Y such that \([x,y](x-y)=Fx-Fy\). New local, semi-local, and monotone convergence theorems are proved which also show the R-order of the process to be equal to the positive root 1.839... of \(t^ 3-t^ 2-t-1=0\). The convergence theory involves second order divided differences and a first section collects some general results about divided difference operators. A scalar version of the process has been used by \textit{N. Anderson} and \textit{Å. Björk} [ibid. 13, 253-264 (1973; Zbl 0263.65054)] and \textit{R. F. King} [ibid. 13, 423-427 (1973; Zbl 0266.65038) and Computing 17, 49-57 (1976; Zbl 0332.65028)].
      0 references

      Identifiers