Newton's method's basins of attraction revisited

Applied Mathematics and Computation

Volumn 215, Issue 3, 2009, Pages 1084-1090

  Susanto, H ^a   Karjanto, N ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITY OF NOTTINGHAM MALAYSIA CAMPUS   (Malaysia)

Author keywords

Iteration methods; Newton Raphson methods; Nodules

Indexed keywords

BASINS OF ATTRACTION; ITERATION METHODS; MODIFIED NEWTON METHOD; NEWTON'S METHODS; NODULES; NUMBER OF ITERATIONS; SIMPLE ALGORITHM;

NEWTON-RAPHSON METHOD;

EID: 69249220033     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2009.06.041     Document Type: Article

References (33)

1. Nordgaard M.A. A Historical Survey of Algebraic Methods of Approximating the Roots of Numerical Higher Equations up to the Year 1819 (1922), Columbia University, New York
2. Cajori F. Historical note on the Newton-Raphson method of approximation. Am. Math. Monthly 18 2 (1911) 19-33
3. Ypma T.J. Historical development of the Newton-Raphson method. SIAM Rev. 37 4 (1995) 531-551
4. Schröder E. Über unendlich viele Algorithmen zur Auflösung der Gleichungen. Math. Annal. 2 (1870) 317-365 English translation by G.W. Stewart, On infinitely many algorithms for solving equations, Technical Report TR-92-121, Department of Computer Science, University of Maryland, College Park, MD, USA, 1992
5. Ortega J.M., and Rheinboldt W.C. Iterative Solution of Nonlinear Equations in Several Variables. Monograph Textbooks Comput. Sci. Appl. Math. (1970), Academic Press, New York
6. Traub J.F. Iterative Methods for the Solution of Equations (1982), Chelsea Publishing Company, New York
7. Yamamoto T. Historical developments in convergence analysis for Newton's and Newton-like methods. J. Comput. Appl. Math. 124 (2000) 1-23
8. Abbasbandy S. Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method. Appl. Math. Comput. 145 (2003) 887-893
9. Adomian G. Solving Frontier Problems of Physics: The Decomposition Method (1994), Kluwer Academic Publishers, Dordrecht
10. He J.-H. Comparison of homotopy perturbation method and homotopy analysis method. Appl. Math. Comput. 156 (2004) 527-539
11. Liao S.-J. Comparison between the homotopy analysis method and homotopy perturbation method. Appl. Math. Comput. 169 (2005) 1186-1194
12. Wu T.-M. A study of convergence on the Newton-homotopy continuation method. Appl. Math. Comput. 168 (2005) 1169-1174
13. Petković M.S., and Herceg D. On rediscovered iteration methods for solving equations. J. Comput. Appl. Math. 107 (1999) 275-284
14. Petković L.D., and Petković M.S. A note on some recent methods for solving nonlinear equations. Appl. Math. Comput. 185 (2007) 368-374
15. P. Sebah, X. Gourdon, Newton's method and high order iterations, Technical Report, 2001 (unpublished); Available at: .
16. Pakdemirli M., and Boyaci{dotless} H. Generation of root finding algorithms via perturbation theory and some formulas. Appl. Math. Comput. 184 (2007) 783-788
17. Kellison S.G. Fundamentals of Numerical Analysis (1975), R.D. Irwin, Inc., Homewood, Illinois
18. Hubbard J.H., Schleicher D., and Sutherland S. How to find all roots of complex polynomials by Newton's method. Invent. Math. 146 1 (2001) 1-33
19. Amat S., Busquier S., and Plaza S. Review of some iterative root-finding methods from a dynamical point of view. Sci. Ser. A: Math. Sci. 10 (2004) 3-35
20. Varona J.L. Graphic and numerical comparison between iterative methods. Math. Intell. 24 1 (2002) 37-46
21. Jacobsen J., Lewis O., and Tennis B. Approximations of continuous Newton's method: an extension of Cayley's problem. Electron. J. Diff. Equat. 15 (2007) 163-173
22. Peitgen H.O., and Richter P.H. The Beauty of Fractals (1986), Springer-Verlag, New York
23. Szyszkowicz M. Computer art from numerical methods. Comput. Graph. Forum 10 3 (1991) 255-259
24. Pickover C.A. Overrelaxation and chaos. Phys. Lett. A 130 3 (1988) 125-128
25. Pickover C.A. Computers, Pattern, Chaos and Beauty (1990), St. Martin's Press, New York
26. Ott E. Basin of attraction. Scholarpedia 1 8 (2006) 1701
27. Reeves R. A note on Halley's method. Comput. Graph. 15 1 (1991) 89-90
28. Reeves R. Further insights into Halley's method. Comput. Graph. 16 (1992) 235-236
29. Petković M.S. Comments on the Basto-Semiao-Calheiros root finding method. Appl. Math. Comput. 184 (2007) 143-148
30. Kalantari B. Polynomiography and applications in art, education and science. Comput. Graph. 28 (2004) 417-430
31. Jin Y., and Kalantari B. On general convergence in extracting radicals via a fundamental family of iteration functions. J. Comput. Appl. Math. 206 (2007) 832-842
32. B. Kalantari, On homogeneous linear recurrence relations and approximation of zeros of complex polynomials, in: M.B. Nathanson (Ed.), Unusual Applications of Number Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 64, 2000, pp. 125-144.
33. Gerlach J. Accelerated convergence in Newton's method. SIAM Rev. 36 (1994) 272-276