Low-complexity root-finding iteration functions with no derivatives of any order of convergence

In this paper, a procedure to design Steffensen-type methods of different orders for solving nonlinear equations is suggested. By using a particular divided difference of first order we can transform many iterative methods into derivative-free iterative schemes, holding the order of convergence of the departure original method. Numerical examples and the study of the dynamics are made to show the performance of the presented schemes and to compare them with another ones.This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02 and by Vicerrectorado de Investigacion, Universitat Politecnica de Valencia PAID-SP2012-0498.Cordero Barbero, A.; Torregrosa Sánchez, JR. (2015). Low-complexity root-finding iteration functions with no derivatives of any order of convergence. Journal of Computational and Applied Mathematics. 275:502-515. https://doi.org/10.1016/j.cam.2014.01.02450251527