Reasons for stability in the construction of derivative‐free multistep iterative methods

Abstract

In this paper, a deep dynamical analysis is made, by using tools from multidimensional real discrete dynamics, of some derivative‐free iterative methods with memory. All of them have good qualitative properties, but one of them (due to Traub) shows to have the same behavior as Newton's method on quadratic polynomials. Then, the same techniques are employed to analyze the performance of several multipoint schemes with memory, whose first step is Traub's method, but their construction was made using different procedures. Therefore, their stability is analyzed, showing which is the best in terms of wideness of basins of convergence or the existence of free critical points that would yield to convergence toward different elements from the desired zeros of the nonlinear function. Therefore, the best stability properties are linked with the best estimations made in the iterative expressions, rather than in their simplicity. These results have been checked with numerical and graphical comparison with many other known methods with and without memory, with different order of convergence, with excellent performance.

A family of iterative methods to solve nonlinear problems with applications in fractional differential equations

“…Many authors have proposed good efforts to make methods to compute the roots of problems [14][15][16][17]. Cordero et al constructed a multi-step method based on Steffensen's method [18].…”