A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography

DOI10.1007/s11075-023-01625-7OpenAlexW4385553012MaRDI QIDQ6202789

Sania Qureshi, Ioannis K. Argyros, Asif Ali Shaikh, Evren Hincal, Krzysztof Gdawiec, Amanullah Soomro

Publication date: 26 March 2024

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-023-01625-7

zbMATH Keywords

root findingfourth-order methodpolynomiographylocal and semilocal analysis

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A composite fourth-order iterative method for solving nonlinear equations
• Some new variants of Newton's method.
• Semilocal convergence of a computationally efficient eighth-order method in Banach spaces under \(w\)-continuity condition
• Finding roots of a real polynomial simultaneously by means of Bairstow's method
• A new time-efficient and convergent nonlinear solver
• Some novel sixth-order iteration schemes for computing zeros of nonlinear scalar equations and their applications in engineering
• Predictor-corrector Halley method for nonlinear equations
• Modified Chebyshev-Halley methods free from second derivative
• Optimal Order of One-Point and Multipoint Iteration
• Computational geometry as a tool for studying root-finding methods
• A Family of Fourth Order Methods for Nonlinear Equations

This page was built for publication: A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography