On a numerical technique for finding multiple zeros and its dynamic
From MaRDI portal
Publication:392353
DOI10.1016/j.joems.2013.03.011zbMath1281.65079OpenAlexW2078749110MaRDI QIDQ392353
Taher Lotfi, Diyashvir Kreetee Rajiv Babajee, Fazlollah Soleymani
Publication date: 13 January 2014
Published in: Journal of the Egyptian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.joems.2013.03.011
Related Items (21)
Optimal iterative methods for finding multiple roots of nonlinear equations using free parameters ⋮ An optimal scheme for multiple roots of nonlinear equations with eighth-order convergence ⋮ Optimal iterative methods for finding multiple roots of nonlinear equations using weight functions and dynamics ⋮ Multiplicity anomalies of an optimal fourth-order class of iterative methods for solving nonlinear equations ⋮ On developing fourth-order optimal families of methods for multiple roots and their dynamics ⋮ An efficient family of optimal fourth-order iterative methods for finding multiple roots of nonlinear equations ⋮ Development of cubically convergent iterative derivative free methods for computing multiple roots ⋮ An optimal reconstruction of Chebyshev-Halley type methods for nonlinear equations having multiple zeros ⋮ Stability analysis of a family of optimal fourth-order methods for multiple roots ⋮ Stability analysis of fourth-order iterative method for finding multiple roots of non-linear equations ⋮ An efficient class of fourth-order derivative-free method for multiple-roots ⋮ An Optimal Eighth-Order Scheme for Multiple Zeros of Univariate Functions ⋮ A class of computationally efficient numerical algorithms for locating multiple zeros ⋮ An excellent numerical technique for multiple roots ⋮ A family of optimal eighth order iteration functions for multiple roots and its dynamics ⋮ HIGHER-ORDER FAMILIES OF MULTIPLE ROOT FINDING METHODS SUITABLE FOR NON-CONVERGENT CASES AND THEIR DYNAMICS ⋮ Optimal eighth-order iterative methods for approximating multiple zeros of nonlinear functions ⋮ Local convergence balls for nonlinear problems with multiplicity and their extension to eighth-order convergence ⋮ A triparametric family of optimal fourth-order multiple-root finders and their dynamics ⋮ An efficient family of optimal eighth-order multiple root finders ⋮ An efficient class of Traub-Steffensen-like seventh order multiple-root solvers with applications
Uses Software
Cites Work
- Solving nonsmooth equations using family of derivative-free optimal methods
- Some optimal iterative methods and their with memory variants
- Basin attractors for various methods for multiple roots
- Finding the solution of nonlinear equations by a class of optimal methods
- Constructing higher-order methods for obtaining the multiple roots of nonlinear equations
- A new third-order family of nonlinear solvers for multiple roots
- Graphic and numerical comparison between iterative methods
- Modified Jarratt method for computing multiple roots
- From third to fourth order variant of Newton's method for simple roots
- A study of accelerated Newton methods for multiple polynomial roots
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
- A family of root finding methods
- The theory of Newton's method
- Construction of optimal derivative-free techniques without memory
- Computing simple roots by an optimal sixteenth-order class
- High-order nonlinear solver for multiple roots
- Hermite interpolation and a new iterative method for the computation of the roots of non-linear equations
- A higher order method for multiple zeros of nonlinear functions
- Optimal Order of One-Point and Multipoint Iteration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On a numerical technique for finding multiple zeros and its dynamic
