z-logo
open-access-imgOpen Access
A Highly Efficient Computer Method for Solving Polynomial Equations Appearing in Engineering Problems
Author(s) -
Naila Rafiq,
Mudassir Shams,
Nazir Ahmad Mir,
Yaé Ulrich Gaba
Publication year - 2021
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2021/9826693
Subject(s) - convergence (economics) , residual , polynomial , computer science , scheme (mathematics) , mathematics , iterative method , numerical analysis , mathematical optimization , degree of a polynomial , algorithm , mathematical analysis , economics , economic growth
A highly efficient two-step simultaneous iterative computer method is established here for solving polynomial equations. A suitable special type of correction helps us to achieve a very high computational efficiency as compared to the existing methods so far in the literature. Analysis of simultaneous scheme proves that its convergence order is 14. Residual graphs are also provided to demonstrate the efficiency and performance of the newly constructed simultaneous computer method in comparison with the methods given in the literature. In the end, some engineering problems and some higher degree complex polynomials are solved numerically to validate its numerical performance.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom