Some variants of the Chebyshev-Halley family of methods with fifth order of convergence
DOI10.1080/00207160802208358zbMATH Open1193.65060OpenAlexW2044396497MaRDI QIDQ3568422FDOQ3568422
Authors: Miquel Grau-Sánchez, José Manuel Gutiérrez Jimenez 
Publication date: 11 June 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160802208358
Recommendations
- Some variants of Chebyshev-Halley methods with fifth-order convergence
- On Chebyshev-Halley methods with sixth-order convergence for solving non-linear equations
- The improvements of Chebyshev-Halley methods with fifth-order convergence
- Sixth-order variants of Chebyshev-Halley methods for solving non-linear equations
- Some sixth order zero-finding variants of Chebyshev-Halley methods
numerical examplesiterative methodscomputational efficiencyorder of convergencenon-linear equationasymptotic error constantsChebyshev--Halley method
Complexity and performance of numerical algorithms (65Y20) Numerical computation of solutions to single equations (65H05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric constructions of iterative functions to solve nonlinear equations
- A variant of Newton's method with accelerated third-order convergence
- Graphic and numerical comparison between iterative methods
- An improvement of the Euler-Chebyshev iterative method
- Julia sets for the super-Newton method, Cauchy’s method, and Halley’s method
- NEWTON'S VERSUS HALLEY'S METHOD: A DYNAMICAL SYSTEMS APPROACH
- A family of fifth-order iterations composed of Newton and third-order methods
- A variant of Chebyshev's method with sixth-order convergence
- Title not available (Why is that?)
- Improvements of the efficiency of some three-step iterative like-Newton methods
- On computational efficiency for multi-precision zero-finding methods
- Chebyshev-Halley methods for analytic functions
- \(n\)th root extraction: Double iteration process and Newton's method
- Calculus of \(n\)th roots and third order iterative methods.
Cited In (11)
- On the local convergence of a family of two-step iterative methods for solving nonlinear equations
- Some variants of Chebyshev-Halley methods with fifth-order convergence
- High-order nonlinear initial-value problems countably determined
- Dynamics of a fifth-order iterative method
- A study of \(3 \mu\)th-order of convergence of Chebyshev-Halley family method and its convergence plane
- On the final steps of Newton and higher order methods
- The improvements of Chebyshev-Halley methods with fifth-order convergence
- Improving order and efficiency: Composition with a modified Newton's method
- Variants of a classic Traub's result
- Note on improvements of order and efficiency in some iterative methods for solving nonlinear equations
- Extending the applicability of the super-Halley-like method using \(\omega\)-continuous derivatives and restricted convergence domains
This page was built for publication: Some variants of the Chebyshev-Halley family of methods with fifth order of convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568422)
