Third Order Root-Finding Methods based on a Generalization of Gander's Result
From MaRDI portal
Publication:6120111
Recommendations
- On several Gander's theorem based third-order iterative methods for solving nonlinear equations and their geometric constructions
- A class of Newton's methods with third-order convergence
- Geometry and convergence of some third-order methods
- A method for obtaining third-order iterative formulas
- New third order nonlinear solvers for multiple roots
Cites work
- scientific article; zbMATH DE number 7174150 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A complex dynamical approach of Chebyshev's method
- A new approach based on the Newton's method to solve systems of nonlinear equations
- An adaptive version of a fourth-order iterative method for quadratic equations
- Classroom Note:Geometry and Convergence of Euler's and Halley's Methods
- Geometric constructions of iterative functions to solve nonlinear equations
- Geometry and convergence of some third-order methods
- Graphic and numerical comparison between iterative methods
- Jacobian-free diagonal Newton's method for solving nonlinear systems with singular Jacobian
- On Halley's Iteration Method
- On the dynamics of the Euler iterative function
- Some variants of Halley's method with memory and their applications for solving several chemical problems
- Study of iterative methods through the Cayley quadratic test
- Superattracting extraneous fixed points and \(n\)-cycles for Chebyshev's method on cubic polynomials
- The application of Newton's method in vector form for solving nonlinear scalar equations where the classical Newton method fails
This page was built for publication: Third Order Root-Finding Methods based on a Generalization of Gander's Result
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120111)