High-order convergence of the \(k\)-fold pseudo-Newton's irrational method locating a simple real zero (Q861133)

Let \(\mathbb{R}\) and \(\mathbb{N}\) denote the sets of real and natural numbers, respectively. For finding a simple zero \(\alpha\) of the equation (1) \(f(x)= 0\), where \(f: \mathbb{R}\to\mathbb{R}\) and \(f\) is sufficiently smooth in a neighbourhood of \(\alpha\), the authors first rewrite (1) in the form \(x- g(x)= 0\), where \(g: \mathbb{R}\to\mathbb{R}\) is also assumed to be sufficiently smooth in a neighbourhood of \(\alpha\). To approximate \(\alpha\) by an iterative method of the type \(x_{n+1}= g(x_n)\), \(n= 0,1,2,\dots\), they define a function \[ w_k= F(w_{k-1})= w_{k-1}- f(w_{k-1})/\sqrt{f'(x)^2- f(w_{k-1})f''(x)}, \] where for an arbitrary given \(x\in\mathbb{R}\) \[ w_0= F(x)= x- f(x)/\sqrt{f'(x)^2- f(x) f''(x)}. \] Hence, \(w_k= F^k(w_0)= F_{k+1}(x)\) for \(x\in\mathbb{N}\), where \(F^k(w_0)= F(F(\dots F(w_0)\dots))\). The iterative method with \(x_0\in\mathbb{R}\) \[ x_{n+1}= F^{k+1}(x_n)= g(x_n)\tag{2} \] is called the \(k\)-fold pseudo-Newton's irrational method (pseudo-Ostrowski's method). If \(k= 0\), it is called the Newton's irrational method or Ostrowski's method having cubic convergence. It is proved that the \(k\)-fold pseudo-Newton's method defined by (2) is at least of order \(k+ 3\). The computational results of two numerical examples indicate that the number of iterations gets smaller as \(k\) increases.