Computer visualization and dynamic study of new families of root-solvers

Abstract The considered topic, the dynamic study of new root solvers using computer tools, is actually a “bridge” between computer science and applied mathematics. The goal of this paper is the construction and dynamic study of two new one-parameter families for solving nonlinear equations using advanced computer tools such as symbolic computation, computer graphics and multi-precision arithmetic. First family, based on Popovski’s third order method (Popovski, 1980), is modified and adapted for finding multiple zeros of differentiable functions. Its dynamic study is performed using basins of attraction and associated quantitative data. In the second part this one-point family for a single zero serves for the derivation of a very efficient family of iterative methods with corrections for the simultaneous determination of all multiple zeros of algebraic polynomials. The convergence analysis, performed by the help of symbolic computation in computer algebra system Mathematica, has shown that the order of convergence of the proposed family is four, five and six, depending of the type of used corrective approximations. A very fast convergence rate is obtained without any additional evaluations of a given polynomial  P and its derivatives  P ′ and  P ′ ′ , which points to the high computational efficiency of new methods. Choosing different values of the involved parameter, the presented family generates a variety of simultaneous methods. Employing multi-precision arithmetic, it has been shown by numerical experiments that four particular methods from the family produce approximations of very high accuracy. Computer visualization, carried out by plotting trajectories of zero approximations, points to the stability and robustness of the proposed simultaneous methods and indicates a conjecture on their globally convergent properties, one of the most important features of simultaneous methods for solving polynomial equations.

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

[2]  Ivan Petković,et al.  Computers in mathematical research: the study of three-point root-finding methods , 2019, Numerical Algorithms.

[3]  Changbum Chun,et al.  Basin attractors for various methods for multiple roots , 2012, Appl. Math. Comput..

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

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

[6]  Changbum Chun,et al.  On a family of Laguerre methods to find multiple roots of nonlinear equations , 2013, Appl. Math. Comput..

[7]  Victor Y. Pan,et al.  Numerical methods for roots of polynomials , 2007 .

[8]  B. Kalantari.  Polynomial Root-finding and Polynomiography , 2008 .

[9]  Changbum Chun,et al.  Comparative study of eighth-order methods for finding simple roots of nonlinear equations , 2017, Numerical Algorithms.

[10]  Petko D. Proinov.  New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems , 2010, J. Complex..

[11]  L. Jay,et al.  A Note on Q-order of Convergence , 2001 .

[12]  Petko D. Proinov.  Relationships between different types of initial conditions for simultaneous root finding methods , 2015, Appl. Math. Lett..

[13]  Petko D. Proinov.  General local convergence theory for a class of iterative processes and its applications to Newton's method , 2009, J. Complex..

[14]  Alicia Cordero,et al.  Complex dynamics of derivative-free methods for nonlinear equations , 2013, Appl. Math. Comput..

[15]  J. L. Varona,et al.  Graphic and numerical comparison between iterative methods , 2002 .

[16]  Ioannis K. Argyros,et al.  On the convergence of an optimal fourth-order family of methods and its dynamics , 2015, Appl. Math. Comput..

[17]  Beny Neta,et al.  On Popovski's method for nonlinear equations , 2008, Appl. Math. Comput..

[18]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[19]  Changbum Chun,et al.  Basins of attraction for several methods to find simple roots of nonlinear equations , 2012, Appl. Math. Comput..

[20]  Changbum Chun,et al.  Basins of attraction for several optimal fourth order methods for multiple roots , 2014, Math. Comput. Simul..

[21]  Ivan Petkovic,et al.  Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros , 2020, J. Comput. Appl. Math..

[22]  Changbum Chun,et al.  Basin attractors for various methods , 2011, Appl. Math. Comput..

[23]  Miodrag S. Petkovic,et al.  Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials , 2018, J. Comput. Appl. Math..

[24]  Oliver Aberth,et al.  Iteration methods for finding all zeros of a polynomial simultaneously , 1973 .

[25]  Miodrag S. Petković,et al.  Point Estimation of Root Finding Methods , 2008 .

[26]  G. Loizou,et al.  Locating multiple zeros interactively , 1985 .

[27]  M. Farmer,et al.  Computing the Zeros of Polynomials using the Divide and Conquer Approach , 2014 .

[28]  D. B. Popovski,et al.  A family of one-point iteration formulae for finding roots , 1980 .

[29]  Changbum Chun,et al.  Basins of attraction for Zhou-Chen-Song fourth order family of methods for multiple roots , 2015, Math. Comput. Simul..

[30]  S. Amat,et al.  Review of some iterative root-finding methods from a dynamical point of view , 2004 .

[31]  Changbum Chun,et al.  Comparative study of methods of various orders for finding repeated roots of nonlinear equations , 2018, J. Comput. Appl. Math..

[32]  B. D. Stewart.  Attractor basins of various root-finding methods , 2001 .