HIGHER-ORDER FAMILIES OF MULTIPLE ROOT FINDING METHODS SUITABLE FOR NON-CONVERGENT CASES AND THEIR DYNAMICS
From MaRDI portal
Publication:4959448
DOI10.3846/mma.2019.026OpenAlexW2953282801WikidataQ127723037 ScholiaQ127723037MaRDI QIDQ4959448
Young Ik Kim, Vinay Kanwar, Ramandeep Behl
Publication date: 13 September 2021
Published in: Mathematical Modelling and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3846/mma.2019.026
Cites Work
- Unnamed Item
- On a numerical technique for finding multiple zeros and its dynamic
- Basin attractors for various methods
- Three-point methods with and without memory for solving nonlinear equations
- On some modified families of multipoint iterative methods for multiple roots of nonlinear equations
- Basins of attraction for several methods to find simple roots of nonlinear equations
- Constructing higher-order methods for obtaining the multiple roots of nonlinear equations
- Modified Jarratt method for computing multiple roots
- A new fourth-order iterative method for finding multiple roots of nonlinear equations
- New optimal class of higher-order methods for multiple roots, permitting \(f'(x_{n})=0\)
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
- Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
- On extraneous fixed-points of the basic family of iteration functions
- Higher-order derivative-free families of Chebyshev-Halley type methods with or without memory for solving nonlinear equations
- Convergence of the Newton process to multiple solutions
- Optimal Order of One-Point and Multipoint Iteration
- A variant of Newton's method with accelerated third-order convergence
This page was built for publication: HIGHER-ORDER FAMILIES OF MULTIPLE ROOT FINDING METHODS SUITABLE FOR NON-CONVERGENT CASES AND THEIR DYNAMICS
