An infinite family of one-step iterators for solving nonlinear equations to increase the order of convergence and a new algorithm of global convergence

DOI10.1016/j.camwa.2013.08.003zbMath1350.65044OpenAlexW1969414885MaRDI QIDQ316152

Mohammad Hasan, M. Dambrine

Publication date: 26 September 2016

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2013.08.003

zbMATH Keywords

algorithmglobal convergenceiterative methodsnonlinear equationsconvergence orderroot-solver

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

A new algorithm for solving all the real roots of a nonlinear system of equations in a given feasible region

Cites Work

• Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems
• Recurrence relations for rational cubic methods. II: The Chebyshev method
• An improvement of the Euler-Chebyshev iterative method
• A family of fifth-order iterations composed of Newton and third-order methods
• Recurrence relations for rational cubic methods. I: The Halley method
• A local convergence theorem for the super-Halley method in a Banach space
• On Newton-type methods with cubic convergence
• A variant of Jarratt method with sixth-order convergence
• An improvement of the Jarratt method
• An improvement to Ostrowski root-finding method
• Results on the Chebyshev method in banach spaces
• A family of Chebyshev-Halley type methods in Banach spaces
• Some Fourth Order Multipoint Iterative Methods for Solving Equations

This page was built for publication: An infinite family of one-step iterators for solving nonlinear equations to increase the order of convergence and a new algorithm of global convergence