On a Class of Optimal Fourth Order Multiple Root Solvers without Using Derivatives

Many optimal order multiple root techniques involving derivatives have been proposed in literature. On the contrary, optimal order multiple root techniques without derivatives are almost nonexistent. With this as a motivational factor, here we develop a family of optimal fourth-order derivative-free iterative schemes for computing multiple roots. The procedure is based on two steps of which the first is Traub–Steffensen iteration and second is Traub–Steffensen-like iteration. Theoretical results proved for particular cases of the family are symmetric to each other. This feature leads us to prove the general result that shows the fourth-order convergence. Efficacy is demonstrated on different test problems that verifies the efficient convergent nature of the new methods. Moreover, the comparison of performance has proven the presented derivative-free techniques as good competitors to the existing optimal fourth-order methods that use derivatives.

[1]  Ernst Schröder,et al.  Ueber unendlich viele Algorithmen zur Auflösung der Gleichungen , 1870 .

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

[3]  E. Hansen,et al.  A family of root finding methods , 1976 .

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

[5]  Beny Neta,et al.  A higher order method for multiple zeros of nonlinear functions , 1983 .

[6]  Chen Dong,et al.  A family of multiopoint iterative functions for finding multiple roots of equations , 1987 .

[7]  Naoki Osada,et al.  An optimal multiple root-finding method of order three , 1994 .

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

[9]  B. Bradie A Friendly Introduction to Numerical Analysis , 2003 .

[10]  Beny Neta,et al.  New third order nonlinear solvers for multiple roots , 2008, Appl. Math. Comput..

[11]  Liao Xiangke,et al.  A new fourth-order iterative method for finding multiple roots of nonlinear equations , 2009 .

[12]  Xiangke Liao,et al.  A new fourth-order iterative method for finding multiple roots of nonlinear equations , 2009, Appl. Math. Comput..

[13]  Rajni Sharma,et al.  Modified Jarratt method for computing multiple roots , 2010, Appl. Math. Comput..

[14]  Beny Neta,et al.  Author's Personal Copy Computers and Mathematics with Applications Some Fourth-order Nonlinear Solvers with Closed Formulae for Multiple Roots , 2022 .

[15]  Yongzhong Song,et al.  Constructing higher-order methods for obtaining the multiple roots of nonlinear equations , 2011, J. Comput. Appl. Math..

[16]  Fazlollah Soleymani,et al.  Finding the solution of nonlinear equations by a class of optimal methods , 2012, Comput. Math. Appl..

[17]  Fazlollah Soleymani,et al.  On a numerical technique for finding multiple zeros and its dynamic , 2013 .

[18]  Young Hee Geum,et al.  A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics , 2015, Appl. Math. Comput..

[19]  Lorentz Jäntschi,et al.  Conformational study of C24 cyclic polyyne clusters , 2018 .

[20]  Vojko Matko,et al.  Improved Data Center Energy Efficiency and Availability with Multilayer Node Event Processing , 2018, Energies.

[21]  M. T. Mustafa,et al.  Invariant Solutions of the Wave Equation on Static Spherically Symmetric Spacetimes Admitting G7 Isometry Algebra , 2018, Symmetry.

[22]  Ramandeep Behl,et al.  An Optimal Eighth-Order Scheme for Multiple Zeros of Univariate Functions , 2017, International Journal of Computational Methods.

[23]  Lorentz Jäntschi,et al.  The Eigenproblem Translated for Alignment of Molecules , 2019, Symmetry.

[24]  Saurabh Bhatia,et al.  On Some Optimal Multiple Root-Finding Methods and their Dynamics , 2022 .