Julia sets for the super-Newton method, Cauchy's method, and Halley's method

Chaos

Volumn 11, Issue 2, 2001, Pages 359-370

  Kneisl, Kyle ^a  

^a The University of North Carolina at Chapel Hill   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035376969     PISSN: 10541500     EISSN: None     Source Type: Journal    
DOI: 10.1063/1.1368137     Document Type: Article

References (21)

1. S. Smale, "On the efficiency of algorithms of analysis," Bull. Am. Math. Soc. 13, 87-105 (1985).
2. C. McMullen, "Families of rational maps and iterative root-finding algorithms," Ann. Math. 125, 467-493 (1987).
3. A. M. Ostrowski, Solution of Equations in Euclidean and Banach Spaces (Academic, New York, 1973).
4. J. F. Traub, Iterative Methods for the Solution of Equations (Prentice-Hall, Englewood Cliffs, NJ, 1964).
5. K. Kneisl, "Dynamical and numerical properties of root-finding algorithms" (working title), Ph.D. dissertation, University of North Carolina at Chapel Hill, in preparation.
6. F. V. Haeseler and H.-O. Peitgen, "Newton's method and complex dynamical systems," Acta Appl. Math. 13, 3-58 (1988).
7. M. Shub and S. Smale, "On the existence of generally convergent algorithms," J. Complexity 2, 2-11 (1986).
8. E. Vrscay and W. Gilbert, "Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions," Numer. Math. 52, 1-16 (1988).
9. E. Vrscay, "Julia sets and Mandelbrot-like sets associated with higher order Schröder rational iteration functions: A computer assisted study," Math. Comput. 46, 151-169 (1986).
10. D. Young and R. T. Gregory, A Survey of Numerical Mathematics, two volumes (Dover, New York, 1973).
11. E. Halley, "Methodus Nova. Accurata and Facilis Inveniendi Radices Æquationum Quarumcumque Generaliter, Sine Prævia Reductione," Philos. Trans. R. Soc. London 18, 136-148 (1694).
12. A. W. Al-Khafaji and J. R. Tooley, Numerical Methods in Engineering Practice (Holt, Rinehart, and Winston, New York, 1986).
13. E. Hansen and M. Patrick, "A family of root finding methods," Numer. Math. 27, 257-269 (1977).
14. X. Buff, Université Paul Sebatier, Toulouse, France, private communication.
15. A. S. Householder, The Numerical Treatment of a Single Nonlinear Equation (McGraw-Hill, New York, 1970).
16. R. P. Boas, Invitation to Complex Analysis (Random House Birkhäuser Mathematics Series, New York, 1987).
17. E. Schröder, "Über unendlich viele Algorithmen zur Auflösung der Gleichungen," Math. Ann. 2, 317-364 (1870).
18. W. Gilbert, "Newton's iteration method and its generalizations," Fractals (to be published).
19. A. Beardon, Iteration of Rational Functions (Springer-Verlag, New York, 1991).
20. L. Carleson and T. Gamelin, Complex Dynamics (Springer, New York, 1995).
21. J. Hawkins, "McMullen's root finding algorithm for cubic polynomials," preprint, University of North Carolina at Chapel Hill.