How to find all roots of complex polynomials by Newton's method.
From MaRDI portal
Publication:5950709
DOI10.1007/s002220100149zbMath1048.37046OpenAlexW1998761587MaRDI QIDQ5950709
Scott Sutherland, John H. Hubbard, Dierk Schleicher
Publication date: 13 December 2001
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002220100149
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10)
Related Items (68)
ON THE DISTANCE TO A ROOT OF COMPLEX POLYNOMIALS UNDER NEWTON'S METHOD ⋮ Topological properties of the immediate basins of attraction for the secant method ⋮ Dynamics of Newton maps ⋮ Accumulation set of critical points of the multipliers in the quadratic family ⋮ On Newton's method applied to real polynomials ⋮ On general convergence in extracting radicals via a fundamental family of iteration functions ⋮ A Classification of Postcritically Finite Newton Maps ⋮ Dynamics of the Secant map near infinity ⋮ The Weierstrass–Durand–Kerner root finder is not generally convergent ⋮ Critical Points of the Multiplier Map for the Quadratic Family ⋮ Quadratic and cubic Newton maps of rational functions ⋮ Rigidity of Newton dynamics ⋮ Spectra of Jacobi operators via connection coefficient matrices ⋮ Moduli space of cubic Newton maps ⋮ Dynamics and limiting behavior of Julia sets of König's method for multiple roots ⋮ 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 ⋮ The Julia sets of Chebyshev's method with small degrees ⋮ CONJECTURES ABOUT SIMPLE DYNAMICS FOR SOME REAL NEWTON MAPS ON ℝ2 ⋮ A uniform bound for the distance to a root of complex polynomials under Newton's method ⋮ On the basins of attraction of a one-dimensional family of root finding algorithms: from Newton to Traub ⋮ The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis ⋮ On the core entropy of Newton maps ⋮ Newton-like components in the Chebyshev-Halley family of degree \(n\) polynomials ⋮ Newton’s Method Without Division ⋮ Berkovich dynamics of Newton maps ⋮ A characterization of all the static stabilizing controllers for LTI systems ⋮ On the support of the bifurcation measure of cubic polynomials ⋮ Geometry of polynomials and root-finding via path-lifting ⋮ Dynamics of Newton Maps of Quadratic Polynomial Maps of ℝ2 into Itself ⋮ Phénomènes de symétrie dans des formes linéaires en polyzêtas ⋮ Finding polynomial roots by dynamical systems -- a case study ⋮ Unnamed Item ⋮ The elliptic curves in gauge theory, string theory, and cohomology ⋮ Globally convergent, iterative path-following for algebraic equations ⋮ Inverse power and Durand-Kerner iterations for univariate polynomial root-finding ⋮ On the connectivity of the Julia sets of meromorphic functions ⋮ Some Connections of Complex Dynamics ⋮ Root-finding by expansion with independent constraints ⋮ Newton method for symmetric quartic polynomial ⋮ Newton maps of complex exponential functions and parabolic surgery ⋮ A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton’s method ⋮ Invisible tricorns in real slices of rational maps ⋮ Enclosing all zeros of a system of analytic functions ⋮ Immediate and virtual basins of Newton's method for entire functions. ⋮ Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves ⋮ New progress in real and complex polynomial root-finding ⋮ On the speed of convergence of Newton’s method for complex polynomials ⋮ Negativity of Lyapunov exponents and convergence of generic random polynomial dynamical systems and random relaxed Newton's methods ⋮ Newton's method's basins of attraction revisited ⋮ Smale’s 17th problem: Average polynomial time to compute affine and projective solutions ⋮ Explicit Presentations for Exceptional Braid Groups ⋮ Enclosing all zeros of an analytic function - a rigorous approach ⋮ Equilibrium Points and Basins of Convergence in the Triangular Restricted Four-Body Problem with a Radiating Body ⋮ Prace Kazimierza Żorawskiego z teorii iteracji ⋮ A combinatorial classification of postcritically fixed Newton maps ⋮ Global dynamics of the real secant method ⋮ On the Julia set of König’s root–finding algorithms ⋮ On the classification of critically fixed rational maps ⋮ Accesses to infinity from Fatou components ⋮ Puzzles and the Fatou–Shishikura injection for rational Newton maps ⋮ The polynomial pivots as initial values for a new root-finding iterative method ⋮ Finding a cluster of zeros of univariate polynomials ⋮ Combinatorial properties of Newton maps ⋮ Disconnected Julia set of Halley's method for exponential maps ⋮ Completely solving the quintic by iteration ⋮ On the efficient global dynamics of Newton’s method for complex polynomials ⋮ Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders ⋮ Newton's method in practice: finding all roots of polynomials of degree one million efficiently
This page was built for publication: How to find all roots of complex polynomials by Newton's method.
