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

dc.contributor.authorShams, Mudassir
dc.contributor.authorKausar, Nasreen
dc.contributor.authorAraci, Serkan
dc.contributor.authorKong, Liang
dc.contributor.authorCarpentieri, Bruno
dc.date.accessioned2023-12-27T07:59:56Z
dc.date.available2023-12-27T07:59:56Z
dc.date.issued2024en_US
dc.departmentDiğeren_US
dc.description.abstractIn 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. © 2023 the Author(s), licensee AIMS Press.en_US
dc.identifier.citationShams M., Kausar N., Araci S., Kong L. & Carpentieri B. (2024). Highly efficient family of two-step simultaneous method for all polynomial roots. Aims Mathematics. ( 9, 1, 1755-1771.). https://doi.org/10.3934/math.2024085.en_US
dc.identifier.doi10.3934/math.2024085
dc.identifier.endpage1771en_US
dc.identifier.issn24736988
dc.identifier.issue1en_US
dc.identifier.orcid0000-0003-0796-4649en_US
dc.identifier.scopus2-s2.0-85179720262
dc.identifier.scopusqualityQ1
dc.identifier.startpage1755en_US
dc.identifier.urihttps://doi.org/10.3934/math.2024085
dc.identifier.urihttps://hdl.handle.net/20.500.11782/4140
dc.identifier.volume9en_US
dc.identifier.wosWOS:001141943700040
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherAmerican Institute of Mathematical Sciencesen_US
dc.relation.ispartofAims Mathematics
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/restrictedAccessen_US
dc.subjectCPU-timeen_US
dc.subjectfractalsen_US
dc.subjectiterative methodsen_US
dc.subjectnumerical algorithmen_US
dc.subjectpolynomial equationsen_US
dc.titleHighly efficient family of two-step simultaneous method for all polynomial roots
dc.typeArticle

Dosyalar

Orijinal paket

Listeleniyor 1 - 1 / 1
Yükleniyor...
Küçük Resim
İsim:
103934math2024085.pdf
Boyut:
830.43 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale Dosyası

Lisans paketi

Listeleniyor 1 - 1 / 1
Yükleniyor...
Küçük Resim
İsim:
license.txt
Boyut:
1.44 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama: