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

DOI10.1007/S11075-023-01625-7MaRDI QIDQ6202789zbMATH OpenOpenAlexFDO

Authors Sania Qureshi, Ioannis Konstantinos Argyros, Amanullah Soomro, Krzysztof Gdawiec, Asif Ali Shaikh, Evren Hincal

Publication date 26 March 2024

Published in Numerical Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• New optimal fourth-order iterative method based on linear combination technique
• Higher-order root-finding algorithms and their basins of attraction
• A modified iterative method for finding the real roots of a polynomial
• scientific article; zbMATH DE number 1921312

Cites work

• scientific article; zbMATH DE number 3875911 (Why is no real title available?)
• scientific article; zbMATH DE number 708393 (Why is no real title available?)
• scientific article; zbMATH DE number 3206520 (Why is no real title available?)
• A Family of Fourth Order Methods for Nonlinear Equations
• A comparison of some fixed point iteration procedures by using the basins of attraction
• A composite fourth-order iterative method for solving nonlinear equations
• A new time-efficient and convergent nonlinear solver
• Computational geometry as a tool for studying root-finding methods
• Finding roots of a real polynomial simultaneously by means of Bairstow's method
• Modified Chebyshev-Halley methods free from second derivative
• Optimal Order of One-Point and Multipoint Iteration
• Polynomial root-finding and polynomiography
• Predictor-corrector Halley method for nonlinear equations
• Semilocal convergence of a computationally efficient eighth-order method in Banach spaces under \(w\)-continuity condition
• Some new variants of Newton's method.
• Some novel sixth-order iteration schemes for computing zeros of nonlinear scalar equations and their applications in engineering

Cited in

(13)

• A robust family of optimal fourth-order iteration schemes for multiple roots with applications
• A convergent and stable fourth-order iterative procedure based on Kung-Traub conjecture for nonlinear systems
• A modified two-step optimal iterative method for solving nonlinear models in one and higher dimensions
• Optimal fourth- and eighth-order iterative methods for solving nonlinear equations with basins of attraction
• An extended study of two multistep higher order convergent methods for solving nonlinear equations
• Use of fractional calculus to avoid divergence in Newton-like solver for solving one-dimensional nonlinear polynomial-based models
• Inverse-free Newton's method
• A new optimal two-step root-finding algorithm using exponential method
• Dynamical analysis of optimal iterative methods for solving nonlinear equations with applications
• A sixth-order bi-parametric iterative method for nonlinear systems: theory, stability and computational complexity
• Optimal fourth-order iterative methods for solving nonlinear equations: an innovative general class with stable members and engineering applications
• Analysis of the basins of attraction generated by a pseudo Newton-Raphson method iterating over complex order derivatives
• Modeling and qualitative dynamics of the effects of internal and external storage device in a discrete fractional computer virus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202789)