Third Order Root-Finding Methods based on a Generalization of Gander's Result
From MaRDI portal
Publication:6120111
DOI10.47836/mjms.16.4.01OpenAlexW4312200112MaRDI QIDQ6120111
Sonia Busquier, José Manuel Gutiérrez Jimenez, Higinio Ramos
Publication date: 25 March 2024
Published in: Malaysian Journal of Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.47836/mjms.16.4.01
Numerical computation of solutions to systems of equations (65H10) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The application of Newton's method in vector form for solving nonlinear scalar equations where the classical Newton method fails
- Study of iterative methods through the Cayley quadratic test
- A new approach based on the Newton's method to solve systems of nonlinear equations
- Graphic and numerical comparison between iterative methods
- A complex dynamical approach of Chebyshev's method
- Geometric constructions of iterative functions to solve nonlinear equations
- Superattracting extraneous fixed points and \(n\)-cycles for Chebyshev's method on cubic polynomials
- Some variants of Halley's method with memory and their applications for solving several chemical problems
- On the dynamics of the Euler iterative function
- An adaptive version of a fourth-order iterative method for quadratic equations
- On Halley's Iteration Method
- Classroom Note:Geometry and Convergence of Euler's and Halley's Methods
This page was built for publication: Third Order Root-Finding Methods based on a Generalization of Gander's Result