DocumentCode
2184723
Title
On Newton´s method for polynomials
Author
Friedman, Joel
fYear
1986
fDate
27-29 Oct. 1986
Firstpage
153
Lastpage
161
Abstract
Let Pd be the set of polynomials over the complex numbers of degree d with all its roots in the unit ball. For f ∈ Pd, let Γf be the set of points for which Newton´s method converges to a root, and let Af ≡ |Γf ∩ B2(O)|/|B2(O)|, i.e. the density of Γf in the ball of radius 2. For each d we consider Ad, the worst-case density Af for f ∈ Pd. In |S|, S. Smale conjectured that Ad ≫ 0 for all d ≥ 3 (it was wellknown that A1 = A2 = 1). In this paper we prove that (1/d)cd2 log d ≤ Ad for some constant c. In particular, Ad ≫ 0 for all d.
Keywords
Equations; Geometry; Newton method; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1986., 27th Annual Symposium on
Conference_Location
Toronto, ON, Canada
ISSN
0272-5428
Print_ISBN
0-8186-0740-8
Type
conf
DOI
10.1109/SFCS.1986.35
Filename
4568206
Link To Document