An efficient class of fourth-order derivative-free method for multiple-roots
From MaRDI portal
Recommendations
- A new higher-order optimal derivative free scheme for multiple roots
- Derivative free multipoint iterative methods for simple and multiple roots
- An efficient class of Traub-Steffensen-like seventh order multiple-root solvers with applications
- On a novel optimal quartically class of methods
- An efficient class of Traub-Steffensen-type methods for computing multiple zeros
Cites work
- scientific article; zbMATH DE number 3740677 (Why is no real title available?)
- A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics
- 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 new fourth-order iterative method for finding multiple roots of nonlinear equations
- A variant of Newton's method with accelerated third-order convergence
- An optimal multiple root-finding method of order three
- Constructing a family of optimal eighth-order modified Newton-type multiple-zero finders along with the dynamics behind their purely imaginary extraneous fixed points
- Constructing higher-order methods for obtaining the multiple roots of nonlinear equations
- Families of third and fourth order methods for multiple roots of nonlinear equations
- Finding the solution of nonlinear equations by a class of optimal methods
- Modified Jarratt method for computing multiple roots
- New third order nonlinear solvers for multiple roots
- On a numerical technique for finding multiple zeros and its dynamic
- Optimal Order of One-Point and Multipoint Iteration
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
Cited in
(5)- A robust family of optimal fourth-order iteration schemes for multiple roots with applications
- On generalized one-step derivative-free iterative family for evaluating multiple roots
- Perturbative derivation and comparisons of root-finding algorithms with fourth order derivatives
- New optimal class of higher-order methods for multiple roots, permitting \(f'(x_{n})=0\)
- Efficient family of three-step with-memory methods and their dynamics
This page was built for publication: An efficient class of fourth-order derivative-free method for multiple-roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698638)
