Computing multiple zeros using a class of quartically convergent methods

Abstract Targeting a new multiple zero finder, in this paper, we suggest an efficient two-point class of methods, when the multiplicity of the root is known. The theoretical aspects are investigated and show that each member of the contributed class achieves fourth-order convergence by using three functional evaluations per full cycle. We also employ numerical examples to evaluate the accuracy of the proposed methods by comparison with other existing methods. For functions with finitely many real roots in an interval, relatively little literature is known, while in applications, the users wish to find all the real zeros at the same time. Hence, the second aim of this paper will be presented by designing a fourth-order algorithm, based on the developed methods, to find all the real solutions of a nonlinear equation in an interval using the programming package Mathematica 8 .

[1]  Lizhi Cheng,et al.  Some second-derivative-free variants of Halley's method for multiple roots , 2009, Appl. Math. Comput..

[2]  Aurél Galántai,et al.  A study of accelerated Newton methods for multiple polynomial roots , 2010, Numerical Algorithms.

[3]  W. Tucker,et al.  Enclosing all zeros of an analytic function - A rigorous approach , 2009 .

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

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

[6]  P. I. Barton,et al.  Nonsmooth exclusion test for finding all solutions of nonlinear equations , 2010 .

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

[8]  Changbum Chun,et al.  On optimal fourth-order iterative methods free from second derivative and their dynamics , 2012, Appl. Math. Comput..

[9]  Roozbeh Hazrat.  Mathematica: A Problem-Centered Approach , 2010 .

[10]  Fazlollah Soleymani,et al.  NOVEL COMPUTATIONAL DERIVATIVE-FREE METHODS FOR SIMPLE ROOTS , 2012 .

[11]  R. Baker Kearfott,et al.  Introduction to Interval Analysis , 2009 .

[12]  J. Keiper.  Interval Arithmetic in Mathematica , 1993 .

[13]  R. Thukral.  New Sixteenth-Order Derivative-Free Methods for Solving Nonlinear Equations , 2012 .

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

[15]  F. Soleymani,et al.  A Taylor-type numerical method for solving nonlinear ordinary differential equations , 2013 .

[16]  N. Kalitkin,et al.  Determining the multiplicity of a root of a nonlinear algebraic equation , 2008 .

[17]  Muhammad Aslam Noor,et al.  Some iterative methods for solving a system of nonlinear equations , 2009, Comput. Math. Appl..

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

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

[20]  Beong In Yun,et al.  Iterative methods for solving nonlinear equations with finitely many roots in an interval , 2012, J. Comput. Appl. Math..

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

[22]  Stan Wagon.  Mathematica in action , 1991 .

[23]  Zhonggang Zeng,et al.  Multiple zeros of nonlinear systems , 2011, Math. Comput..

[24]  Fazlollah Soleymani,et al.  Some Iterative Methods Free from Derivatives and Their Basins of Attraction for Nonlinear Equations , 2013 .

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

[26]  F. Soleymani.  Some efficient seventh-order derivative-free families in root-finding , 2013 .

[27]  R. F. King,et al.  A secant method for multiple roots , 1977 .