Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Hurley (1986)
Multiple attractors in Newton's methodErgodic Theory and Dynamical Systems, 6
A. Cayley (1880)
On the Newton-Fourier imaginary problemProc. Cam. Phil. Soc., 3
S. Smale (1985)
On the efficiency of algorithms of analysisBulletin of the American Mathematical Society, 13
H. Peitgen, Dietmar Saupe, F. Haeseler (1984)
Cayley’s problem and Julia setsThe Mathematical Intelligencer, 6
P. Blanchard (1984)
Complex analytic dynamics on the Riemann sphereBulletin of the American Mathematical Society, 11
H. Peitgen, P. Richter (1987)
The Beauty of Fractals1988
H. Kuhn, Ze-ke Wang, Senlin Xu (1984)
On the cost of computing roots of polynomialsMathematical Programming, 28
B. Barna (1956)
Uber die Divergenzpunkte des Newtonschen Verfahrens zur Bestimmung von Wurzeln algebraischen Gleichungen IIPubl. Math. Debrecen, 4
J. Renegar (1987)
On the worst-case arithmetic complexity of approximating zeros of polynomialsJ. Complex., 3
M. Shub, S. Smale (1985)
Computational complexity: on the geometry of polynomials and a theory of cost. IAnnales Scientifiques De L Ecole Normale Superieure, 18
G. Peters, J.H. Wilkinson (1971)
Practical problems arising in the solution of polynomial equationsJour. Inst. Math. Appl., 8
S. Smale (1981)
The fundamental theorem of algebra and complexity theoryBulletin of the American Mathematical Society, 4
J. Friedman (1989)
On the convergence of newton's methodJ. Complex., 5
F. Przytycki (1989)
Dynamical Systems and Ergodic Theory
D. Saari, John Urenko (1984)
NEWTON'S METHOD, CIRCLE MAPS, AND CHAOTIC MOTIONAmerican Mathematical Monthly, 91
M. Hurley, C. Martin (1984)
Newton’s Algorithm and Chaotic Dynamical SystemsSiam Journal on Mathematical Analysis, 15
F. Przytycki (1989)
Remarks on the simple connectedness of basins of sinks for iterations of rational mapsBanach Center Publications, 23
M. Shub, S. Smale (1986)
Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: IISIAM J. Comput., 15
G. Peters, J. Wilkinson (1971)
Practical Problems Arising in the Solution of Polynomial EquationsIma Journal of Applied Mathematics, 8
S. Sutherland, P. Blanchard (1989)
Finding roots of complex polynomials with newton's method
P. Duren (1983)
Univalent functions
M. Marden (1970)
Geometry of Polynomials
The trouble with Newton's method for finding the roots of a complex polynomial is knowing where to start the iteration. In this paper we apply the theory of rational maps and some estimates based on distortion theorems for univalent functions to find lower bounds, depending only on the degreed, for the size of regions from which the iteration will certainly converge to a root. We can also bound the number of iterations required and we give a method that works for every polynomial and takes at most some constant timesd 2(logd)2 log(d 3/∈) iterations to find one root to within an accuracy of ∈.
Bulletin of the Brazilian Mathematical Society, New Series – Springer Journals
Published: Feb 11, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.