We establish new iterative methods of local order fourteen to approximate the simple roots of nonlinear equations. The considered three-step eighth-order construction can be viewed as a variant of Newton’s method in which the concept of Hermite interpolation is used at the third step to reduce the number of evaluations. This scheme includes three evaluations of the function and one evaluation of the first derivative per iteration, hence its efficiency index is 1.6817. Next, the obtained approximation for the derivative of the Newton’s iteration quotient is again taken into consideration to furnish novel fourteenth-order techniques consuming four function and one first derivative evaluations per iteration. In providing such new fourteenth-order methods, we also take a special heed to the computational burden. The contributed four-step methods have 1.6952 as their efficiency index. Finally, various numerical examples are given to illustrate the accuracy of the developed techniques.
Nonlinear equations Three-step methods Four-step methods Efficiency index Order of convergence Simple root
Mathematics Subject Classifications (2010)
This is a preview of subscription content, log in to check access.
Cordero, A., Hueso, J.L., Martinez, M., Torregrosa, J.R.: Efficient three-step iterative methods with sixth order convergence for nonlinear equations. Numer. Algorithms 53, 485–495 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
Kung, H.T., Traub, J.F.: Optimal order of one-point and multipoint iteration. J. Assoc. Comput. Math. 21, 643–651 (1974)MathSciNetzbMATHGoogle Scholar
Kyurkchiev, N., Iliev, A.: A note on the constructing of nonstationary methods for solving nonlinear equations with raised speed of convergence. Serdica J. Comput. 3, 47–74 (2009)MathSciNetzbMATHGoogle Scholar