Inverse Family of Numerical Methods for Approximating All Simple and Roots with Multiplicity of Nonlinear Polynomial Equations with Engineering Applications

A new inverse family of the iterative method is interrogated in the present article for simultaneously estimating all distinct and multiple roots of nonlinear polynomial equations. Convergence analysis proves that the order of convergence of the newly constructed family of methods is two. The computer algebra systems CAS-Mathematica is used to determine the lower bound of convergence order, which justifies the local convergence of the newly developed method. Some nonlinear models from physics, chemistry, and engineering sciences are considered to demonstrate the performance and efficiency of the newly constructed family of inverse simultaneous methods in comparison to classical methods in the literature. The computational time in seconds and residual error graph of the inverse simultaneous methods are also presented to elaborate their convergence behavior.

[1]  Choonkill Park,et al.  On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously , 2021, Advances in Differential Equations.

[2]  N. A. Mir,et al.  Study of Dynamical Behavior and Stability of Iterative Methods for Nonlinear Equation with Applications in Engineering , 2020, Mathematical Problems in Engineering.

[3]  N. Rafiq,et al.  On Dynamics of Iterative Techniques for Nonlinear Equation with Applications in Engineering , 2020 .

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

[5]  H. Ramos,et al.  Some variants of Halley’s method with memory and their applications for solving several chemical problems , 2020, Journal of Mathematical Chemistry.

[6]  Slav I. Cholakov,et al.  Local and Semilocal Convergence of Wang-Zheng's Method for Simultaneous Finding Polynomial Zeros , 2019, Symmetry.

[7]  Alicia Cordero,et al.  Generating Root-Finder Iterative Methods of Second Order: Convergence and Stability , 2019, Axioms.

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

[9]  J. Carrasco,et al.  A parameterized multi-step Newton method for solving systems of nonlinear equations , 2016, Numerical Algorithms.

[10]  Maria T. Vasileva,et al.  On a family of Weierstrass-type root-finding methods with accelerated convergence , 2015, Appl. Math. Comput..

[11]  Juan A. Carrasco,et al.  Higher order multi-step Jarratt-like method for solving systems of nonlinear equations: Application to PDEs and ODEs , 2015, Comput. Math. Appl..

[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]  Miquel Grau-Sánchez,et al.  On new computational local orders of convergence , 2012, Appl. Math. Lett..

[14]  Fazlollah Soleymani,et al.  An optimized derivative-free form of the Potra-Pták method , 2012, Math. Comput. Model..

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

[16]  Tetsuro Yamamoto,et al.  On some methods for the simultaneous determination of polynomial zeros , 1996 .

[17]  Y. Chu,et al.  Computer Methodologies for the Comparison of Some Efficient Derivative Free Simultaneous Iterative Methods for Finding Roots of Non-Linear Equations , 2020, Computers Materials & Continua.

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

[19]  Abdel Wahab M. Anourein An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial , 1977 .