A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography
From MaRDI portal
Publication:6202789
Recommendations
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
(3)- Optimal fourth- and eighth-order iterative methods for solving nonlinear equations with basins of attraction
- Dynamical analysis of optimal iterative methods for solving nonlinear equations with applications
- 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)