AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (830.4 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Highly efficient family of two-step simultaneous method for all polynomial roots

Mudassir Shams1,2Nasreen Kausar3Serkan Araci4Liang Kong5Bruno Carpentieri1( )
Faculty of Engineering, Free University of Bozen-Bolzano (BZ), 39100, Italy
Department of Mathematics and Statistics, Riphah International University Ⅰ-14, Islamabad 44000, Pakistan
Department of Mathematics, Faculty of Arts and Science, Yildiz Technical University, Esenler 34220, Istanbul, Türkiye
Department of Basic Sciences, Faculty of Engineering, Hasan Kalyoncu University, TR-27010 Gaziantep, Türkiye
Department of Mathematical Sciences and Philosophy, University of Illinois Springfield, USA
Show Author Information

Abstract

In this article, we constructed a derivative-free family of iterative techniques for extracting simultaneously all the distinct roots of a non-linear polynomial equation. Convergence analysis is discussed to show that the proposed family of iterative method has fifth order convergence. Nonlinear test models including fractional conversion, predator-prey, chemical reactor and beam designing models are included. Also many other interesting results concerning symmetric problems with application of group symmetry are also described. The simultaneous iterative scheme is applied starting with the initial estimates to get the exact roots within the given tolerance. The proposed iterative scheme requires less function evaluations and computation time as compared to existing classical methods. Dynamical planes are exhibited in CAS-MATLAB (R2011B) to show how the simultaneous iterative approach outperforms single roots finding methods that might confine the divergence zone in terms of global convergence. Furthermore, convergence domains, namely basins of attraction that are symmetrical through fractal-like edges, are analyzed using the graphical tool. Numerical results and residual graphs are presented in detail for the simultaneous iterative method. An extensive study has been made for the newly developed simultaneous iterative scheme, which is found to be efficient, robust and authentic in its domain.

CLC number: 65H04, 65H05, 65Y05, 65M12

References

【1】
【1】
 
 
AIMS Mathematics
Pages 1755-1771

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Shams M, Kausar N, Araci S, et al. Highly efficient family of two-step simultaneous method for all polynomial roots. AIMS Mathematics, 2024, 9(1): 1755-1771. https://doi.org/10.3934/math.2024085

12

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 29 September 2023
Revised: 07 November 2023
Accepted: 07 November 2023
Published: 15 January 2024
©2024 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)