Accurate fourteenth-order methods for solving nonlinear equations
From MaRDI portal
Publication:652328
DOI10.1007/s11075-011-9467-4zbMath1242.65100OpenAlexW2035972127MaRDI QIDQ652328
Fazlollah Soleymani, Parviz Sargolzaei
Publication date: 14 December 2011
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-011-9467-4
Newton's methodnumerical examplesiterative methodsnonlinear equationsorder of convergenceHermite interpolationefficiency indexsimple rootconvergence simple rootfour-step methodsthree-step methods
Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)
Related Items (18)
On modified two-step iterative method in the fractional sense: some applications in real world phenomena ⋮ A class of optimal eighth-order derivative-free methods for solving the Danchick-Gauss problem ⋮ Monotone convergence of Newton-like methods for \(M\)-matrix algebraic Riccati equations ⋮ Some modifications of King's family with optimal eighth order of convergence ⋮ A general three-step class of optimal iterations for nonlinear equations ⋮ A class of three-step derivative-free root solvers with optimal convergence order ⋮ An improvement of Ostrowski's and King's techniques with optimal convergence order eight ⋮ Two new classes of optimal Jarratt-type fourth-order methods ⋮ An efficient multi-step iterative method for computing the numerical solution of systems of nonlinear equations associated with ODEs ⋮ Simply constructed family of a Ostrowski's method with optimal order of convergence ⋮ Optimal Steffensen-type methods with eighth order of convergence ⋮ Finding the solution of nonlinear equations by a class of optimal methods ⋮ Optimized Steffensen-type methods with eighth-order convergence and high efficiency index ⋮ A family of fourteenth-order convergent iterative methods for solving nonlinear equations ⋮ Numerical solution of nonlinear equations by an optimal eighth-order class of iterative methods ⋮ Novel computational iterative methods with optimal order for nonlinear equations ⋮ A fast and robust method for computing real roots of nonlinear equations ⋮ An optimal family of fast 16th-order derivative-free multipoint simple-root finders for nonlinear equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multi-parameter family of three-step eighth-order iterative methods locating a simple root
- Modified Jarratt method with sixth-order convergence
- A family of fifth-order iterations composed of Newton and third-order methods
- On new third-order convergent iterative formulas
- Efficient three-step iterative methods with sixth order convergence for nonlinear equations
- Modified Ostrowski's method with eighth-order convergence and high efficiency index
- A study of accelerated Newton methods for multiple polynomial roots
- Some sixth-order variants of Ostrowski root-finding methods
- Iterative methods based on the signum function approach for solving nonlinear equations
- Modified Newton's method with third-order convergence and multiple roots
- Improving order and efficiency: Composition with a modified Newton's method
- Error analysis for the Newton-Raphson method
- On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency
- Optimal Order of One-Point and Multipoint Iteration
- A variant of Newton's method with accelerated third-order convergence
- A new family of modified Ostrowski's methods with accelerated eighth order convergence
This page was built for publication: Accurate fourteenth-order methods for solving nonlinear equations
