A two-parameter family of fourth-order iterative methods with optimal convergence for multiple zeros
From MaRDI portal
Publication:2375524
DOI10.1155/2013/369067zbMath1266.65077WikidataQ59005607 ScholiaQ59005607MaRDI QIDQ2375524
Publication date: 14 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/369067
65H04: Numerical computation of roots of polynomial equations
Related Items
A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics, Constructing a family of optimal eighth-order modified Newton-type multiple-zero finders along with the dynamics behind their purely imaginary extraneous fixed points, Second derivative free sixth order continuation method for solving nonlinear equations with applications, On constructing two-point optimal fourth-order multiple-root finders with a generic error corrector and illustrating their dynamics, A sixth-order family of three-point modified Newton-like multiple-root finders and the dynamics behind their extraneous fixed points, On the dynamics of a triparametric family of optimal fourth-order multiple-zero finders with a weight function of the principal \(m\)th root of a function-to-function ratio, Long-term orbit dynamics viewed through the yellow main component in the parameter space of a family of optimal fourth-order multiple-root finders, A new class of Halley's method with third-order convergence for solving nonlinear equations, A family of optimal quartic-order multiple-zero finders with a weight function of the principal \(k\)th root of a derivative-to-derivative ratio and their basins of attraction, The dynamical analysis of a uniparametric family of three-point optimal eighth-order multiple-root finders under the Möbius conjugacy map on the Riemann sphere, A triparametric family of optimal fourth-order multiple-root finders and their dynamics, A new biparametric family of two-point optimal fourth-order multiple-root finders, Stability analysis of a family of optimal fourth-order methods for multiple roots
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative methods for solving nonlinear equations with finitely many roots in an interval
- Constructing higher-order methods for obtaining the multiple roots of nonlinear equations
- Fifth-order iterative method for finding multiple roots of nonlinear equations
- Modified Chebyshev-Halley type method and its variants for computing multiple roots
- Two optimal eighth-order derivative-free classes of iterative methods
- Modified Jarratt method for computing multiple roots
- Newton's method's basins of attraction revisited
- A new fourth-order iterative method for finding multiple roots of nonlinear equations
- A derivative free iterative method for finding multiple roots of nonlinear equations
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
- Construction of optimal derivative-free techniques without memory
- Computing simple roots by an optimal sixteenth-order class
- High-order nonlinear solver for multiple roots
- Extension of Murakami's high-order non-linear solver to multiple roots
- A new family of higher order methods for solving equations
- A family of multiopoint iterative functions for finding multiple roots of equations
- Optimal Order of One-Point and Multipoint Iteration
- Some efficient fourth order multipoint methods for solving equations
- New high-order convergence iteration methods without employing derivatives for solving nonlinear equations