Finding the solution of nonlinear equations by a class of optimal methods

AbstractThis paper is devoted to the study of an iterative class for numerically approximating the solution of nonlinear equations. In fact, a general class of iterations using two evaluations of the first order derivative and one evaluation of the function per computing step is presented. It is also proven that the class reaches the fourth-order convergence. Therefore, the novel methods from the class are Jarratt-type iterations, which agree with the optimality hypothesis of Kung–Traub. The derived class is further extended for multiple roots. That is to say, a general optimal quartic class of iterations for multiple roots is contributed, when the multiplicity of the roots is available. Numerical experiments are employed to support the theory developed in this work