Some sixth order zero-finding variants of Chebyshev-Halley methods

DOI10.1016/j.amc.2009.01.022zbMath1400.65026OpenAlexW2118123804MaRDI QIDQ1021494

Miquel Grau-Sánchez, José Luis Dıáz-Barrero

Publication date: 8 June 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.01.022

zbMATH Keywords

efficiencyiterative methodsnonlinear equationsorder of convergenceChebyshev-Halley's methods

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

An efficient method based on progressive interpolation for solving non-linear equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improvement of the Euler-Chebyshev iterative method
• Construction of Newton-like iteration methods for solving nonlinear equations
• A family of composite fourth-order iterative methods for solving nonlinear equations
• Geometric constructions of iterative functions to solve nonlinear equations
• A variant of Cauchy's method with accelerated fifth-order convergence.
• Some new sixth-order methods for solving non-linear equations
• Accelerated iterative methods for finding solutions of a system of nonlinear equations
• An improvement to Ostrowski root-finding method
• Improvements of the efficiency of some three-step iterative like-Newton methods
• A family of Chebyshev-Halley type methods in Banach spaces
• An acceleration of Newton's method: Super-Halley method