On the efficient global dynamics of Newton’s method for complex polynomials
DOI10.1088/1361-6544/ACB18EOpenAlexW1874590269MaRDI QIDQ5872372FDOQ5872372
Authors: Dierk Schleicher 
Publication date: 27 January 2023
Published in: Nonlinearity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.5773
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical methods for roots of polynomials. Part I
- Numerical methods for roots of polynomials. II
- Solving secular and polynomial equations: a multiprecision algorithm
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- On location and approximation of clusters of zeros of analytic functions
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Title not available (Why is that?)
- Absence of wandering domains for some real entire functions with bounded singular sets
- On Newton's method for entire functions
- A 2002 update of the supplementary bibliography on roots of polynomials
- A fast implicit QR eigenvalue algorithm for companion matrices
- On an inequality for the hyperbolic measure and its applications in the theory of functions
- How to find all roots of complex polynomials by Newton's method.
- On the distribution of roots of polynomials
- Immediate and virtual basins of Newton's method for entire functions.
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Title not available (Why is that?)
- The connectivity of the Julia set and fixed points
- Rational and transcendental Newton maps
- Critical points of Green's function and geometric function theory
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- On the number of iterations of Newton's method for complex polynomials
- Geometry of polynomials and root-finding via path-lifting
- 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
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
- Finding polynomial roots by dynamical systems -- a case study
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- On the speed of convergence of Newton's method for complex polynomials
Cited In (16)
- Finding polynomial roots by dynamical systems -- a case study
- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
- On the speed of convergence of Newton's method for complex polynomials
- A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method
- Newton's method and the computational complexity of the fundamental theorem of algebra
- How to find all roots of complex polynomials by Newton's method.
- On the number of iterations of Newton's method for complex polynomials
- Geometry of polynomials and root-finding via path-lifting
- Newton's method as a dynamical system: Efficient root finding of polynomials and the Riemann \(\zeta\)-function
- A note on the newton method for degree four 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
- Moduli space of cubic Newton maps
- How to be sure of finding a root of a complex polynomial using Newton's method
- A uniform bound for the distance to a root of complex polynomials under Newton's method
- The Weierstrass–Durand–Kerner root finder is not generally convergent
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
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)
