Development of cubically convergent iterative derivative free methods for computing multiple roots
From MaRDI portal
Publication:6055840
DOI10.1007/s40324-022-00300-6zbMath1520.65031OpenAlexW4293071515MaRDI QIDQ6055840
No author found.
Publication date: 29 September 2023
Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40324-022-00300-6
convergencemultiple rootsderivative-free algorithmsstirred tank reactor problemVan der Waals problem
Cites Work
- Unnamed Item
- On a numerical technique for finding multiple zeros and its dynamic
- 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 class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics
- Modified Jarratt method for computing multiple roots
- A new fourth-order iterative method for finding multiple roots of nonlinear equations
- New third order nonlinear solvers for multiple roots
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
- A family of root finding methods
- An optimal multiple root-finding method of order three
- An efficient class of Traub-Steffensen-type methods for computing multiple zeros
- A family of multiopoint iterative functions for finding multiple roots of equations
- A higher order method for multiple zeros of nonlinear functions
- An Optimal Eighth-Order Scheme for Multiple Zeros of Univariate Functions
- A variant of Newton's method with accelerated third-order convergence
This page was built for publication: Development of cubically convergent iterative derivative free methods for computing multiple roots
