How to be sure of finding a root of a complex polynomial using Newton's method

DOI10.1007/BF01232940zbMath0776.65035MaRDI QIDQ5285715

Anthony Manning

Publication date: 29 June 1993

Published in: [https://portal.mardi4nfdi.de/entity/Q2710393 Boletim da Sociedade Brasileira de Matem�tica] (Search for Journal in Brave)

zbMATH Keywords

Newton's methodJulia setroot of a complex polynomial

Mathematics Subject Classification ID

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) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Related Items

Moduli space of cubic Newton maps, A uniform bound for the distance to a root of complex polynomials under Newton's method, Geometry of polynomials and root-finding via path-lifting, On the connectivity of the Julia sets of meromorphic functions, Some Connections of Complex Dynamics, A characterization of postcritically minimal Newton maps of complex exponential functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cayley's problem and Julia sets
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• On the convergence of Newton's method
• Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
• Complex analytic dynamics on the Riemann sphere
• Newton's Method, Circle Maps, and Chaotic Motion
• On the cost of computing roots of polynomials
• Multiple attractors in Newton's method
• Newton’s Algorithm and Chaotic Dynamical Systems
• On the efficiency of algorithms of analysis
• Computational complexity. On the geometry of polynomials and a theory of cost. I
• The fundamental theorem of algebra and complexity theory
• Practical Problems Arising in the Solution of Polynomial Equations