Some variants of the Chebyshev–Halley family of methods with fifth order of convergence
DOI10.1080/00207160802208358zbMath1193.65060OpenAlexW2044396497MaRDI QIDQ3568422
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
numerical examplesiterative methodscomputational efficiencyorder of convergencenon-linear equationasymptotic error constantsChebyshev--Halley method
Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphic and numerical comparison between iterative methods
- An improvement of the Euler-Chebyshev iterative method
- A variant of Chebyshev's method with sixth-order convergence
- A family of fifth-order iterations composed of Newton and third-order methods
- Chebyshev-Halley methods for analytic functions
- On computational efficiency for multi-precision zero-finding methods
- \(n\)th root extraction: Double iteration process and Newton's method
- Geometric constructions of iterative functions to solve nonlinear equations
- Calculus of \(n\)th roots and third order iterative methods.
- Improvements of the efficiency of some three-step iterative like-Newton methods
- NEWTON'S VERSUS HALLEY'S METHOD: A DYNAMICAL SYSTEMS APPROACH
- Julia sets for the super-Newton method, Cauchy’s method, and Halley’s method
- A variant of Newton's method with accelerated third-order convergence
This page was built for publication: Some variants of the Chebyshev–Halley family of methods with fifth order of convergence