On the improvement of the order of convergence of iterative methods for solving nonlinear systems by means of memory (Q2176502)

This paper is devoted to a family of Newton-like methods with memory for solving nonlinear systems defined by: \[ \begin{array}{l} \omega^{(k)}=x^{(k)}-[2x^{(k)}-x^{(k-1)},x^{(k-1)};F]^{-1}F(x^{(k)}), \\[6pt] x^{(k+1)}=x^{(k)}-[\omega^{(k)},x^{(k)};F]^{-1}F(x^{(k)}), \\[2pt] \end{array} \] for \(k=0,1,\ldots \). The Kurchatov's divided difference method is significantly used to implement the scheme. Under some constraints it is shown that the iterations of the proposed method have convergence order \(\tau =3\) (see Theorem 2). The authors study also an iterative procedure with memory with order of convergence \(\tau =5\) (see Theorem 3). The new theoretical results are tested on some numerical examples and the performance of the method is established.