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

DOI10.3390/A8041210MaRDI QIDQ1736745zbMATHOpenAlexFDO

Authors 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

iterative methodsnonlinear equationsNewton's methodcontinuous Newton's method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Recommendations

• An acceleration of the continuous Newton's method
• Approximations of continuous Newton's method: an extension of Cayley's problem
• Discrete versus continuous Newton's method: A case study
• The convergence of iterations based on a continuous analogue of Newton's method
• On the convergence rate of the continuous Newton method

Cites work

• scientific article; zbMATH DE number 3778641 (Why is no real title available?)
• A family of Chebyshev-Halley type methods in Banach spaces
• An extension of Gander's result for quadratic equations
• Approximations of continuous Newton's method: an extension of Cayley's problem
• Continuous Newton's method for polynomials.
• Dynamics of a family of Chebyshev-Halley type methods
• Fractal Basins of Attraction Associated with a Damped Newton's Method
• Graphic and numerical comparison between iterative methods
• On Halley's Iteration Method

Cited in

(9)

• Moving mesh strategies of adaptive methods for solving nonlinear partial differential equations
• scientific article; zbMATH DE number 778185 (Why is no real title available?)
• On the use of the root locus of polynomials with complex coefficients for estimating the basin of attraction for the continuous-time Newton and Householder methods
• Dynamical analysis in explicit continuous iteration algorithm and its applications
• Approximations of continuous Newton's method: an extension of Cayley's problem
• An acceleration of the continuous Newton's method
• On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
• Iterative parameter estimation algorithms for dual-frequency signal models
• Newton's method and high-order algorithms for the \(n\)th root computation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736745)