Adams-like techniques for zero-finder methods
From MaRDI portal
Publication:1021497
DOI10.1016/j.amc.2009.01.021zbMath1162.65344OpenAlexW1990941778MaRDI QIDQ1021497
Miquel Grau-Sánchez, Miquel Noguera, José Luis Dıáz-Barrero
Publication date: 8 June 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.01.021
Related Items (2)
Full linear multistep methods as root-finders ⋮ Zero-finder methods derived from Obreshkov's techniques
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improvement of the Euler-Chebyshev iterative method
- Construction of Newton-like iteration methods for solving nonlinear equations
- A family of composite fourth-order iterative methods for solving nonlinear equations
- A weighted variant family of Newton's method with accelerated third-order convergence
- A family of fifth-order iterations composed of Newton and third-order methods
- A Hummel \& Seebeck family of iterative methods with improved convergence and efficiency
- Some efficient methods for enclosing simple zeros of nonlinear equations
- An improvement to the computing of nonlinear equation solutions
- On Newton-type methods with cubic convergence
- A variant of Cauchy's method with accelerated fifth-order convergence.
- Some new variants of Newton's method.
- A new iterative method for solving nonlinear equations
- Improvements of the efficiency of some three-step iterative like-Newton methods
- A variant of Newton's method with accelerated third-order convergence
This page was built for publication: Adams-like techniques for zero-finder methods
