Increasing the order of convergence for iterative methods to solve nonlinear systems (Q331791): Difference between revisions

The article is devoted to describe a class of iterative methods for solving a nonlinear system \(F(x)=0\), where \(F:D\subset \mathbb{R}^n\to\mathbb{R}^n\) is a ``sufficiently Fréchet differentiable'' function in a neighborhood of a zero \(\alpha\) of \(F\). Generalizing previous methods of \textit{A. Cordero} et al. [Appl. Math. Lett. 25, No. 12, 2369--2374 (2012; Zbl 1252.65093)] and \textit{J. R. Sharma} and \textit{P. Gupta} [Comput. Math. Appl. 67, No. 3, 591--601 (2014; Zbl 1350.65048)], in the paper under review the authors propose a technique for accelerating a method of order of convergence \(p\) to \(p+2\), using only one additional evaluation of the function \(F\) under consideration. This technique is applied to some known method, obtaining methods of fifth, sixth and seventh order of convergence. Computational efficiency of the new methods is compared with that of the previous ones and numerical examples are considered to illustrate their practical behavior.