Search

The main goal of this paper is to study the order of convergence and the efficiency of four families of iterative methods using frozen divided differences. The first two families correspond to a generalization of the secant method and the implementation made by Schmidt and Schwetlick. The other two frozen schemes consist of a generalization of Kurchatov method and an improvement of this method applying the technique used by Schmidt and Schwetlick previously. An approximation of the local convergence order is generated by the examples, and it numerically confirms that the order of the methods is well deduced. Moreover, the computational efficiency indexes of the four algorithms are presented and computed in order to compare their efficiency. [ABSTRACT FROM AUTHOR]