Improvements of the efficiency of some three-step iterative like-Newton methods
From MaRDI portal
Publication:2642289
Recommendations
- The improvements of modified Newton's method
- Iterative methods of higher order for nonlinear equations
- Three-step iterative methods for nonlinear equations
- An efficient three-step iterative method for non-linear equations
- Efficient three-step iterative methods with sixth order convergence for nonlinear equations
Cites work
- scientific article; zbMATH DE number 1061412 (Why is no real title available?)
- scientific article; zbMATH DE number 3226460 (Why is no real title available?)
- scientific article; zbMATH DE number 3187178 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A Family of Fourth Order Methods for Nonlinear Equations
- A composite fourth-order iterative method for solving nonlinear equations
- A family of fifth-order iterations composed of Newton and third-order methods
- A new iterative method for solving nonlinear equations
- A variant of Cauchy's method with accelerated fifth-order convergence.
- A variant of Chebyshev's method with sixth-order convergence
- A weighted variant family of Newton's method with accelerated third-order convergence
- An improvement of the Euler-Chebyshev iterative method
- An improvement to Ostrowski root-finding method
- An improvement to the computing of nonlinear equation solutions
- Construction of Newton-like iteration methods for solving nonlinear equations
- Dynamics of the King and Jarratt iterations
- On computational efficiency for multi-precision zero-finding methods
- Some variants of Ostrowski's method with seventh-order convergence
Cited in
(26)- On improved three-step schemes with high efficiency index and their dynamics
- Some improvements of Ostrowski's method
- Thresholds of the inner steps in multi-step Newton method
- Improving order and efficiency: Composition with a modified Newton's method
- Sixth order derivative free family of iterative methods
- Some higher-order modifications of Newton's method for solving nonlinear equations
- Some eighth-order root-finding three-step methods
- Spectral analysis of the errors of some families of multi-step Newton-like methods
- Variants of a classic Traub's result
- On computational efficiency for multi-precision zero-finding methods
- Some new efficient multipoint iterative methods for solving nonlinear systems of equations
- Some sixth order zero-finding variants of Chebyshev-Halley methods
- Some variants of the Chebyshev-Halley family of methods with fifth order of convergence
- Note on improvements of order and efficiency in some iterative methods for solving nonlinear equations
- Adams-like techniques for zero-finder methods
- New variants of Jarratt's method with sixth-order convergence
- A Hummel \& Seebeck family of iterative methods with improved convergence and efficiency
- Extended convergence of Jarratt type methods
- Zero-finder methods derived using Runge-Kutta techniques
- On some computational orders of convergence
- On new computational local orders of convergence
- Analysis of two Chebyshev-like third order methods free from second derivatives for solving systems of nonlinear equations
- On the local convergence of a third order family of iterative processes
- Simple yet efficient Newton-like method for systems of nonlinear equations
- On the local convergence of a fifth-order iterative method in Banach spaces
- On the computational efficiency index and some iterative methods for solving systems of nonlinear equations
This page was built for publication: Improvements of the efficiency of some three-step iterative like-Newton methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642289)
