Zero-finder methods derived using Runge-Kutta techniques
From MaRDI portal
Publication:628883
DOI10.1016/j.amc.2010.11.059zbMath1229.65079OpenAlexW2001276876MaRDI QIDQ628883
José Luis Dıáz-Barrero, Miquel Grau-Sánchez
Publication date: 8 March 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.11.059
Related Items (4)
Several new third-order and fourth-order iterative methods for solving nonlinear equations ⋮ Full linear multistep methods as root-finders ⋮ Finding the solution of nonlinear equations by a class of optimal methods ⋮ Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On computational efficiency for multi-precision zero-finding methods
- A Hummel \& Seebeck family of iterative methods with improved convergence and efficiency
- A modified Newton method for rootfinding with cubic convergence.
- Some variant of Newton's method with third-order convergence.
- 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
This page was built for publication: Zero-finder methods derived using Runge-Kutta techniques
