An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture
DOI10.1007/s12346-022-00572-3zbMath1485.65056OpenAlexW4213152079WikidataQ113899536 ScholiaQ113899536MaRDI QIDQ2114405
Publication date: 15 March 2022
Published in: Qualitative Theory of Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12346-022-00572-3
order of convergencebasins of attractionKung and Traub's conjecturemultipoint iterative methodssimple root
Numerical computation of solutions to single equations (65H05) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Complexity and performance of numerical algorithms (65Y20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Basins of attraction for several methods to find simple roots of nonlinear equations
- On a 4-point sixteenth-order King family of iterative methods for solving nonlinear equations
- Some novel and optimal families of King's method with eighth and sixteenth-order of convergence
- On a general class of optimal order multipoint methods for solving nonlinear equations
- Comparative study of eighth-order methods for finding simple roots of nonlinear equations
- A biparametric family of four-step sixteenth-order root-finding methods with the optimal efficiency index
- Graphic and numerical comparison between iterative methods
- Efficient methods of optimal eighth and sixteenth order convergence for solving nonlinear equations
- On some computational orders of convergence
- Eighth order family of iterative methods for nonlinear equations and their basins of attraction
- Improved King's methods with optimal order of convergence based on rational approximations
- Computing simple roots by an optimal sixteenth-order class
- Convergence and dynamics of structurally identical root finding methods
- Superattracting extraneous fixed points and \(n\)-cycles for Chebyshev's method on cubic polynomials
- Computer visualization and dynamic study of new families of root-solvers
- Two optimal general classes of iterative methods with eighth-order
- Efficient Ostrowski-like methods of optimal eighth and sixteenth order convergence and their dynamics
- Multipoint iterative methods for finding all the simple zeros in an interval
- Variants of Newton's method using fifth-order quadrature formulas
- An optimal three-point eighth-order iterative method without memory for solving nonlinear equations with its dynamics
- An efficient optimal family of sixteenth order methods for nonlinear models
- A biparametric family of optimally convergent sixteenth-order multipoint methods with their fourth-step weighting function as a sum of a rational and a generic two-variable function
- On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency
- Optimal Order of One-Point and Multipoint Iteration
- Efficient optimal families of higher-order iterative methods with local convergence
- Multipoint efficient iterative methods and the dynamics of Ostrowski's method
- Families of optimal multipoint methods for solving nonlinear equations: A survey
- A variant of Newton's method with accelerated third-order convergence
This page was built for publication: An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture
