On the efficient global dynamics of Newton’s method for complex polynomials
From MaRDI portal
Publication:5872372
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Combinatorics and topology in relation with holomorphic dynamical systems (37F20) Numerical computation of roots of polynomial equations (65H04) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Dynamical systems in numerical analysis (37N30)
Recommendations
- On the speed of convergence of Newton's method for complex polynomials
- Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
- How to find all roots of complex polynomials by Newton's method.
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- Newton's method as a dynamical system: Efficient root finding of polynomials and the Riemann \(\zeta\)-function
Cites work
- scientific article; zbMATH DE number 4153532 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- scientific article; zbMATH DE number 3057606 (Why is no real title available?)
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- A 2002 update of the supplementary bibliography on roots of polynomials
- A fast implicit QR eigenvalue algorithm for companion matrices
- A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method
- Absence of wandering domains for some real entire functions with bounded singular sets
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Critical points of Green's function and geometric function theory
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
- Finding polynomial roots by dynamical systems -- a case study
- Geometry of polynomials and root-finding via path-lifting
- How to find all roots of complex polynomials by Newton's method.
- Immediate and virtual basins of Newton's method for entire functions.
- Newton's method as a dynamical system: Efficient root finding of polynomials and the Riemann \(\zeta\)-function
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- Numerical methods for roots of polynomials. II
- Numerical methods for roots of polynomials. Part I
- On Newton's method for entire functions
- On an inequality for the hyperbolic measure and its applications in the theory of functions
- On location and approximation of clusters of zeros of analytic functions
- On the distribution of roots of polynomials
- On the number of iterations of Newton's method for complex polynomials
- On the speed of convergence of Newton's method for complex polynomials
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Rational and transcendental Newton maps
- Solving secular and polynomial equations: a multiprecision algorithm
- The connectivity of the Julia set and fixed points
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(17)- Newton's method and the computational complexity of the fundamental theorem of algebra
- Finding polynomial roots by dynamical systems -- a case study
- A note on the newton method for degree four polynomials
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- On the number of iterations of Newton's method for complex polynomials
- The Weierstrass–Durand–Kerner root finder is not generally convergent
- On the speed of convergence of Newton's method for complex polynomials
- A uniform bound for the distance to a root of complex polynomials under Newton's method
- Moduli space of cubic Newton maps
- How to be sure of finding a root of a complex polynomial using Newton's method
- On the Efficient Global Dynamics of Newton's Method for Complex Polynomials
- Geometry of polynomials and root-finding via path-lifting
- How to find all roots of complex polynomials by Newton's method.
- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
- A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method
- Newton's method as a dynamical system: Efficient root finding of polynomials and the Riemann \(\zeta\)-function
- Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
This page was built for publication: On the efficient global dynamics of Newton’s method for complex polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5872372)
