Higher-order root-finding algorithms and their basins of attraction
Summary: In this paper, we proposed and analyzed three new root-finding algorithms for solving nonlinear equations in one variable. We derive these algorithms with the help of variational iteration technique. We discuss the convergence criteria of these newly developed algorithms. The dominance of the proposed algorithms is illustrated by solving several test examples and comparing them with other well-known existing iterative methods in the literature. In the end, we present the basins of attraction using some complex polynomials of different degrees to observe the fractal behavior and dynamical aspects of the proposed algorithms.
- Three-point iterative algorithm in the absence of the derivative for solving nonlinear equations and their basins of attraction
- Optimal methods for finding simple and multiple roots of nonlinear equations and their basins of attraction
- A new iterative method for finding the multiple roots of nonlinear equations
- Numerical algorithms for finding zeros of nonlinear equations and their dynamical aspects
- A new third-order Newton-type iterative method for solving nonlinear equations
- A family of Chebyshev-Halley type methods in Banach spaces
- A new family of optimal eighth order methods with dynamics for nonlinear equations
- A new high-order and efficient family of iterative techniques for nonlinear models
- A new Householder's method free from second derivatives for solving nonlinear equations and polynomiography
- A new modified Halley method without second derivatives for nonlinear equation
- A note on the Halley method in Banach spaces
- An acceleration of Newton's method: Super-Halley method
- An optimal eighth-order class of three-step weighted Newton's methods and their dynamics behind the purely imaginary extraneous fixed points
- Construction of Newton-like iteration methods for solving nonlinear equations
- Fractal patterns from the dynamics of combined polynomial root finding methods
- Generalized Newton Raphsons method free from second derivative
- Homotopy perturbation technique
- scientific article; zbMATH DE number 1821102 (Why is no real title available?)
- scientific article; zbMATH DE number 1414604 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method
- New classes of iterative methods for nonlinear equations
- Newton's method's basins of attraction revisited
- Newton-ellipsoid polynomiography
- Numerical algorithms for finding zeros of nonlinear equations and their dynamical aspects
- Polynomial root-finding and polynomiography
- Some iterative methods free from derivatives and their basins of attraction for nonlinear equations
- The improvements of modified Newton's method
- Variants of Newton's method using fifth-order quadrature formulas
- Variational iteration method -- a kind of non-linear analytical technique: Some examples
- Variational iteration method -- some recent results and new interpretations
- Variational iteration technique for solving nonlinear equations
- Some novel sixth-order iteration schemes for computing zeros of nonlinear scalar equations and their applications in engineering
- Three-point iterative algorithm in the absence of the derivative for solving nonlinear equations and their basins of attraction
- Numerical algorithms for finding zeros of nonlinear equations and their dynamical aspects
- On the basins of attraction of a one-dimensional family of root finding algorithms: from Newton to Traub
- scientific article; zbMATH DE number 3945258 (Why is no real title available?)
- A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography
- Basins of attraction of a one-parameter family of root-finding techniques
- Higher-order root-finding algorithm and its applications
This page was built for publication: Higher-order root-finding algorithms and their basins of attraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225550)
