Numerical properties of different root-finding algorithms obtained for approximating continuous Newton's method

DOI10.3390/a8041210zbMath1461.65076OpenAlexW2218281265MaRDI QIDQ1736745

Xianqiang Yang

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a8041210

zbMATH Keywords

Newton's methoditerative methodsnonlinear equationscontinuous Newton's method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (4)

Iterative parameter estimation algorithms for dual-frequency signal models ⋮ An acceleration of the continuous Newton's method ⋮ Moving mesh strategies of adaptive methods for solving nonlinear partial differential equations ⋮ On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros

Cites Work

• Unnamed Item
• Unnamed Item
• Graphic and numerical comparison between iterative methods
• An extension of Gander's result for quadratic equations
• Dynamics of a family of Chebyshev-Halley type methods
• On Halley's Iteration Method
• A family of Chebyshev-Halley type methods in Banach spaces
• Fractal Basins of Attraction Associated with a Damped Newton's Method
• Continuous Newton's method for polynomials.

This page was built for publication: Numerical properties of different root-finding algorithms obtained for approximating continuous Newton's method