Some second-derivative-free variants of Halley's method for multiple roots
The authors discuss the problem of finding a multiple root of a nonlinear equation using iterative methods. The authors propose two new families of third-order iterative methods based on the known Halley's method for simple roots. The first family of methods is obtained from Halley's method by replacing the second derivative with a finite difference between the first derivatives. The second family of the proposed methods is obtained also from Halley's method by a modification of the algorithm with a new approximation formed by the function instead of its first derivative. Both families of the new methods are free of second derivatives. One of the families requires one evaluation of the function and two of its first derivative per iteration, and the other family requires two evaluations of the function and one of its first derivative. By introducing three new parameters, the algorithms are modified again, so that the methods are of third-order convergence in case of a multiple root. Many concret methods belonging to these families of methods are specified. Numerical examples are performed using the new methods and comparison with other iterative methods of third-order are presented.
- Some variants of Chebyshev-halley methods free from second derivative
- Some second-derivative-free variants of Chebyshev-halley methods
- Modified Chebyshev-Halley type method and its variants for computing multiple roots
- Some new variants of Chebyshev-Halley methods free from second derivative
- Third-order and fourth-order iterative methods free from second derivative for finding multiple roots of nonlinear equations
- A derivative free iterative method for finding multiple roots of nonlinear equations
- scientific article; zbMATH DE number 3874500
- Derivative free multipoint iterative methods for simple and multiple roots
- Second-derivative-free variants of Cauchy's method
- A second-order iterative method for extracting multiple roots of nonlinear equations
- 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
- High-order nonlinear solver for multiple roots
- scientific article; zbMATH DE number 1931017 (Why is no real title available?)
- scientific article; zbMATH DE number 3806835 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Modified Halley's method free from second derivative
- New families of nonlinear third-order solvers for finding multiple roots
- New third order nonlinear solvers for multiple roots
- On Halley-type iterations with free second derivative
- A new fifth-order iterative method free from second derivative for solving nonlinear equations
- On developing a novel sixth order transformation method for multiple roots and its basins of attraction
- New families of third-order iterative methods for finding multiple roots
- On the convergence of Halley's method for multiple polynomial zeros
- Higher order two-point efficient family of Halley type methods for simple roots
- Constructing third-order derivative-free iterative methods
- scientific article; zbMATH DE number 5810123 (Why is no real title available?)
- Computational implementation of the multivariate Halley method for solving nonlinear systems of equations
- A family of fifth-order iterative methods for finding multiple roots of nonlinear equations
- On generalized Halley-like methods for solving nonlinear equations
- At Steffensen's type method with modified functions
- New third and fourth order nonlinear solvers for computing multiple roots
- An iteration method with maximal order based on standard information
- On Halley-type iterations with free second derivative
- Derivative free algorithm for solving nonlinear equations
- Modified Chebyshev-Halley type method and its variants for computing multiple roots
- Exploring weight functions: a family of one-point methods for multiple roots
- Efficient finite element strategy using enhanced high-order and second-derivative-free variants of Newton's method
- Convergence radius of the modified Newton method for multiple zeros under Hölder continuous derivative
- Modified Halley's method free from second derivative
- Some iterative methods free from second derivatives for nonlinear equations
This page was built for publication: Some second-derivative-free variants of Halley's method for multiple roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1039687)