Computer Methodologies for the Comparison of Some Efficient Derivative Free Simultaneous Iterative Methods for Finding Roots of Non-Linear Equations

In this article, we construct the most powerful family of simultaneous iterative method with global convergence behavior among all the existing methods in literature for finding all roots of non-linear equations. Convergence analysis proved that the order of convergence of the family of derivative free simultaneous iterative method is nine. Our main aim is to check out the most regularly used simultaneous iterative methods for finding all roots of non-linear equations by studying their dynamical planes, numerical experiments and CPU time-methodology. Dynamical planes of iterative methods are drawn by using MATLAB for the comparison of global convergence properties of simultaneous iterative methods. Convergence behavior of the higher order simultaneous iterative methods are also illustrated by residual graph obtained from some numerical test examples. Numerical test examples, dynamical behavior and computational efficiency are provided to present the performance and dominant efficiency of the newly constructed derivative free family of simultaneous iterative method over existing higher order simultaneous methods in literature.

[1]  N. A. Mir,et al.  Derivative free iterative simultaneous method for finding distinct roots of polynomial equation , 2020, Alexandria Engineering Journal.

[2]  Fei Peng,et al.  A reversible watermarking for authenticating 2D CAD engineering graphics based on iterative embedding and virtual coordinates , 2019, Multimedia Tools and Applications.

[3]  Fei Yu,et al.  Cluster synchronization of two-layer nonlinearly coupled multiplex networks with multi-links and time-delays , 2019, Neurocomputing.

[4]  Kenli Li,et al.  A robust and fixed-time zeroing neural dynamics for computing time-variant nonlinear equation using a novel nonlinear activation function , 2019, Neurocomputing.

[5]  Miodrag S. Petkovic,et al.  On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros , 2019, Appl. Math. Comput..

[6]  Alicia Cordero,et al.  Stability and applicability of iterative methods with memory , 2018, Journal of Mathematical Chemistry.

[7]  Stoil I. Ivanov,et al.  Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros , 2017 .

[8]  Petko D. Proinov,et al.  On the Convergence of Halley’s Method for Multiple Polynomial Zeros , 2015 .

[9]  S. Siegmund,et al.  A new class of three-point methods with optimal convergence order eight and its dynamics , 2015, Numerical Algorithms.

[10]  Petko D. Proinov,et al.  A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously , 2014, J. Complex..

[11]  Changbum Chun,et al.  A new optimal eighth-order family of iterative methods for the solution of nonlinear equations , 2013, Appl. Math. Comput..

[12]  Gyurhan H. Nedzhibov,et al.  Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations , 2013, Int. J. Comput. Math..

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

[14]  N. A. Mir,et al.  Some Families of Two-Step Simultaneous Methods for Determining Zeros of Nonlinear Equations , 2011 .

[15]  Steven C. Chapra,et al.  Applied Numerical Methods with MATLAB for Engineers and Scientists , 2004 .

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