An optimal multiple root-finding method of order three
From MaRDI portal
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)
An optimal one-point iterative method of order three for determining a multiple zero of a complex function in a complex variable which requires less computational effort per iteration step than three known such optimal methods is presented. One numerical example with a non-real zero of multiplicity 5/2 is given.
Recommendations
- On some optimal multiple root-finding methods and their dynamics
- scientific article; zbMATH DE number 3876483
- A general family of third order method for finding multiple roots
- Modified Jarratt method for computing multiple roots
- An optimal order method for multiple roots in case of unknown multiplicity
Cites work
Cited in
(71)- A third-order modification of Newton's method for multiple roots
- Some second-derivative-free variants of Halley's method for multiple roots
- Locating three-dimensional roots by a bisection method
- Newton-like iteration method for solving algebraic equations
- Improving the order of convergence of iteration functions
- Comparative study of methods of various orders for finding repeated roots of nonlinear equations
- Convergence radius of Halley's method for multiple roots under center-Hölder continuous condition
- Computing multiple zeros by using a parameter in Newton-secant method
- Fifth-order iterative method for solving multiple roots of the highest multiplicity of nonlinear equation
- An optimal order method for multiple roots in case of unknown multiplicity
- Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
- On zero-finding methods of the fourth order
- Three new optimal fourth-order iterative methods to solve nonlinear equations
- An excellent derivative-free multiple-zero finding numerical technique of optimal eighth order convergence
- 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
- Basins of attraction for several optimal fourth order methods for multiple roots
- General family of third order methods for multiple roots of nonlinear equations and basin attractors for various methods
- On the convergence radius of the modified Newton method for multiple roots under the center-Hölder condition
- Local convergence and dynamics of a family of iterative methods for multiple roots of nonlinear equations
- On developing a novel sixth order transformation method for multiple roots and its basins of attraction
- An efficient class of Traub-Steffensen-type methods for computing multiple zeros
- Review of some iterative methods for solving nonlinear equations with multiple zeros
- Effective high-order iterative methods via the asymptotic form of the Taylor-Lagrange remainder
- New families of third-order iterative methods for finding multiple roots
- An efficient class of Traub-Steffensen-like seventh order multiple-root solvers with applications
- On Newton-type methods for multiple roots with cubic convergence
- Asymptotic error constants of cubically convergent zero finding methods
- An efficient class of fourth-order derivative-free method for multiple-roots
- A general family of third order method for finding multiple roots
- Convergence radius of Osada's method under center-Hölder continuous condition
- A three point formula for finding roots of equations by the method of least squares
- On some optimal multiple root-finding methods and their dynamics
- Dynamical behaviors of some iterative methods for multiple roots of nonlinear equations
- Corrigendum to: ``On a family of Laguerre methods to find multiple roots of nonlinear equations
- scientific article; zbMATH DE number 3876483 (Why is no real title available?)
- Family of Cubically Convergent Schemes Using Inverse Newton Function for Multiple Roots
- scientific article; zbMATH DE number 5530463 (Why is no real title available?)
- Families of third and fourth order methods for multiple roots of nonlinear equations
- Iterative methods for solving nonlinear equations with finitely many roots in an interval
- Basin attractors for various methods for multiple roots
- On some modified families of multipoint iterative methods for multiple roots of nonlinear equations
- On the construction of simultaneous methods for multiple zeros
- On a family of Laguerre methods to find multiple roots of nonlinear equations
- On the optimality of some multi-point methods for finding multiple roots of nonlinear equation
- An alternative analysis for the local convergence of iterative methods for multiple roots including when the multiplicity is unknown
- A family of fifth-order iterative methods for finding multiple roots of nonlinear equations
- Extended Kung-Traub-type method for solving equations
- SOME FAMILIES OF ONE AND TWO-STEP ITERATIVE METHODS FOR APPROXIMATING MULTIPLE ROOTS OF NONLINEAR EQUATIONS
- Unified ball convergence of inexact methods for finding zeros with multiplicity
- New third and fourth order nonlinear solvers for computing multiple roots
- A new third-order family of nonlinear solvers for multiple roots
- Development of cubically convergent iterative derivative free methods for computing multiple roots
- New higher order methods for solving nonlinear equations with multiple roots
- Two‐step iterative methods for multiple roots and their applications for solving several physical and chemical problems
- Fifth-order iterative method for finding multiple roots of nonlinear equations
- Convergence of the modified Halley's method for multiple zeros under Hölder continuous derivative
- A robust iterative family for multiple roots of nonlinear equations: enhancing accuracy and handling critical points
- A sixth order transformation method for finding multiple roots of nonlinear equations and basin attractors for various methods
- Comparing the basins of attraction for Kanwar-Bhatia-Kansal family to the best fourth order method
- Basins of attraction for several third order methods to find multiple roots of 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
- Transformation methods for finding multiple roots of nonlinear equations
- Convergence radius of the modified Newton method for multiple zeros under Hölder continuous derivative
- 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
- Chebyshev-Halley methods for analytic functions
- New third order nonlinear solvers for multiple roots
- New families of nonlinear third-order solvers for finding multiple roots
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
This page was built for publication: An optimal multiple root-finding method of order three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334505)
