Improving the Computational Efficiency of a Variant of Steffensen’s Method for Nonlinear Equations

Steffensen-type methods with memory were originally designed to solve nonlinear equations without the use of additional functional evaluations per computing step. In this paper, a variant of Steffensen’s method is proposed which is derivative-free and with memory. In fact, using an acceleration technique via interpolation polynomials of appropriate degrees, the computational efficiency index of this scheme is improved. It is discussed that the new scheme is quite fast and has a high efficiency index. Finally, numerical investigations are brought forward to uphold the theoretical discussions.

[1]  Taher Lotfi,et al.  A new family of adaptive methods with memory for solving nonlinear equations , 2018, Mathematical Sciences.

[2]  H. T. Kung,et al.  Optimal Order of One-Point and Multipoint Iteration , 1974, JACM.

[3]  José L. Hueso,et al.  A class of efficient high-order iterative methods with memory for nonlinear equations and their dynamics , 2018 .

[4]  Rostam K. Saeed,et al.  An iterative method with quartic convergence for solving nonlinear equations , 2008, Appl. Math. Comput..

[5]  Sunethra Weerakoon,et al.  A variant of Newton's method with accelerated third-order convergence , 2000, Appl. Math. Lett..

[6]  Miodrag S. Petkovic,et al.  Derivative free two-point methods with and without memory for solving nonlinear equations , 2010, Appl. Math. Comput..

[7]  Pavel Praks,et al.  Choosing the optimal multi-point iterative method for the Colebrook flow friction equation - Numerical validation , 2018, Processes.

[8]  Alicia Cordero,et al.  Steffensen type methods for solving nonlinear equations , 2012, J. Comput. Appl. Math..

[9]  F. K. Haghani A Modified Steffensen's Method with Memory for Nonlinear Equations , 2015 .

[10]  Miodrag S. Petkovic,et al.  On generalized biparametric multipoint root finding methods with memory , 2014, J. Comput. Appl. Math..

[11]  Michael Morrison,et al.  Hands-On Start to Wolfram Mathematica: And Programming with the Wolfram Language , 2015 .

[12]  Fayyaz Ahmad Comment on: On the Kung-Traub Conjecture for Iterative Methods for Solving Quadratic Equations. Algorithms 2016, 9, 1 , 2016, Algorithms.

[13]  F. Soleymani,et al.  Two Optimal Eighth-Order Derivative-Free Classes of Iterative Methods , 2012 .

[14]  Alicia Cordero,et al.  An Efficient Family of Optimal Eighth-Order Multiple Root Finders , 2018, Mathematics.

[15]  F. Soleymani,et al.  Some optimal iterative methods and their with memory variants , 2013 .

[16]  Jing Wang,et al.  A Steffensen-like method and its higher-order variants , 2009, Appl. Math. Comput..

[17]  F. Khaksar Haghani,et al.  A super-fast tri-parametric iterative method with memory , 2016, Appl. Math. Comput..

[18]  Taher Lotfi,et al.  On a New Efficient Steffensen-Like Iterative Class by Applying a Suitable Self-Accelerator Parameter , 2014, TheScientificWorldJournal.

[19]  Tatsuo Noda The Steffensen iteration method for systems of nonlinear equations, II , 1987 .

[20]  Jovana Dzunic On efficient two-parameter methods for solving nonlinear equations , 2012, Numerical Algorithms.

[21]  Li Zhang,et al.  Variants of Steffensen-secant method and applications , 2010, Appl. Math. Comput..

[22]  J. Traub Iterative Methods for the Solution of Equations , 1982 .