Improvements of the efficiency of some three-step iterative like-Newton methods
From MaRDI portal
Publication:2642289
DOI10.1007/S00211-007-0088-8zbMATH Open1123.65037OpenAlexW1996947083MaRDI QIDQ2642289FDOQ2642289
Authors: Miquel Grau-Sánchez 
Publication date: 20 August 2007
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-007-0088-8
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
numerical experimentscomputational efficiencyNewton's methodorder of convergencethree-step iterative methods
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamics of the King and Jarratt iterations
- A Family of Fourth Order Methods for Nonlinear Equations
- Title not available (Why is that?)
- An improvement of the Euler-Chebyshev iterative method
- A composite fourth-order iterative method for solving nonlinear equations
- A variant of Cauchy's method with accelerated fifth-order convergence.
- An improvement to Ostrowski root-finding method
- A family of fifth-order iterations composed of Newton and third-order methods
- A variant of Chebyshev's method with sixth-order convergence
- Construction of Newton-like iteration methods for solving nonlinear equations
- Title not available (Why is that?)
- Some variants of Ostrowski's method with seventh-order convergence
- An improvement to the computing of nonlinear equation solutions
- A new iterative method for solving nonlinear equations
- A weighted variant family of Newton's method with accelerated third-order convergence
- On computational efficiency for multi-precision zero-finding methods
Cited In (23)
- Zero-finder methods derived using Runge-Kutta techniques
- Some eighth-order root-finding three-step methods
- On the computational efficiency index and some iterative methods for solving systems of nonlinear equations
- Sixth order derivative free family of iterative methods
- Some improvements of Ostrowski's method
- Some new efficient multipoint iterative methods for solving nonlinear systems of equations
- Adams-like techniques for zero-finder methods
- Some sixth order zero-finding variants of Chebyshev-Halley methods
- On new computational local orders of convergence
- On the local convergence of a third order family of iterative processes
- Analysis of two Chebyshev-like third order methods free from second derivatives for solving systems of nonlinear equations
- On computational efficiency for multi-precision zero-finding methods
- A Hummel \& Seebeck family of iterative methods with improved convergence and efficiency
- On the local convergence of a fifth-order iterative method in Banach spaces
- Some higher-order modifications of Newton's method for solving nonlinear equations
- Spectral analysis of the errors of some families of multi-step Newton-like methods
- New variants of Jarratt's method with sixth-order convergence
- Improving order and efficiency: Composition with a modified Newton's method
- Variants of a classic Traub's result
- Note on improvements of order and efficiency in some iterative methods for solving nonlinear equations
- Some variants of the Chebyshev-Halley family of methods with fifth order of convergence
- On some computational orders of convergence
- Title not available (Why is that?)
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)
