Modified Chebyshev-Halley type method and its variants for computing multiple roots
Two families of third order methods for finding multiple roots of nonlinear equations are presented in this paper. One family is based on the Chebyshev-Halley scheme (for simple roots) and includes Halley, Chebyshev and Chun-Neta methods as particular cases for multiple roots. The second family is based on the variant of Chebyshev-Halley scheme and includes the methods of Dong, Homeier, Neta and Li et al. as particular cases. The efficacy is tested on a number of relevant numerical problems. It is observed that the new methods of the families are equally competitive with the well known special cases of the families.
- Some second-derivative-free variants of Halley's method for multiple roots
- On some modified families of multipoint iterative methods for multiple roots of nonlinear equations
- Modified families of Newton, Halley and Chebyshev methods
- Chebyshev-Halley methods for analytic functions
- New families of third-order iterative methods for finding multiple roots
- A family of Chebyshev-Halley type methods in Banach spaces
- A family of multiopoint iterative functions for finding multiple roots of equations
- A family of root finding methods
- A higher order method for multiple zeros of nonlinear functions
- A third-order modification of Newton's method for multiple roots
- An optimal multiple root-finding method of order three
- Extension of Murakami's high-order non-linear solver to multiple roots
- High-order nonlinear solver for multiple roots
- scientific article; zbMATH DE number 3806835 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- New third and fourth order nonlinear solvers for computing multiple roots
- New third order nonlinear solvers for multiple roots
- Numerical analysis. An introduction
- On Newton-type methods for multiple roots with cubic convergence
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
- Some second-derivative-free variants of Halley's method for multiple roots
- Some second-derivative-free variants of Halley's method for multiple roots
- The rate of multiplicity of the roots of nonlinear equations and its application to iterative methods
- Iterative methods for ill-conditioned roots
- Convergence analysis of the modified Chebyshev's method for finding multiple roots
- General family of third order methods for multiple roots of nonlinear equations and basin attractors for various methods
- On developing a novel sixth order transformation method for multiple roots and its basins of attraction
- A new biparametric family of two-point optimal fourth-order multiple-root finders
- A two-parameter family of fourth-order iterative methods with optimal convergence for multiple zeros
- An optimal reconstruction of Chebyshev-Halley type methods for nonlinear equations having multiple zeros
- A family of fifth-order iterative methods for finding multiple roots of nonlinear equations
- On generalized Halley-like methods for solving nonlinear equations
- Variants of Chebyshev's method with optimal order of convergence
- Convergence and convexity of two families of third-order methods for computing simple roots of nonlinear equations
- A sixth order transformation method for finding multiple roots of nonlinear equations and basin attractors for various methods
- Chebyshev-Halley methods for analytic functions
- Modified families of Newton, Halley and Chebyshev methods
This page was built for publication: Modified Chebyshev-Halley type method and its variants for computing multiple roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695044)
