A basic family of iteration functions for polynomial root finding and its characterizations

Journal of Computational and Applied Mathematics

Volumn 80, Issue 2, 1997, Pages 209-226

  Kalantari, Bahman ^a   Kalantari, Iraj ^b   Zaare Nahandi, Rahim ^c  

^a RUTGERS UNIVERSITY   (United States)

^b WESTERN ILLINOIS UNIVERSITY   (United States)

^c UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Iteration functions; Newton's method; Roots

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATRIX ALGEBRA; NUMBER THEORY; RECURSIVE FUNCTIONS;

ITERATION FUNCTION; NEWTON METHOD;

POLYNOMIALS;

EID: 0031554218     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(97)00014-9     Document Type: Article

References (28)

1. G. Alefeld, On the convergence of Halley's Method, Am. Math. Monthly 88 (1981) 530-536.
2. K.E. Atkinson, An Introduction to Numerical Analysis, 2nd edn. (Wiley, New York, 1989).
3. H. Bateman, Halley's method for solving equations, Am. Math. Monthly 45 (1938) 11-17.
4. E. Bodewig, On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation, Quart. App. Math. 7 (1949) 325-333.
5. G.H. Brown, On Halley's variation of Newton's method, Am. Math. Monthly 84 (1977) 726-728.
6. M. Davies and B. Dawson, On the global convergence of Halley's iteration formula, Numer. Math. 24 (1975) 133-135.
7. J.S. Frame, A variation of Newton's method, Am. Math. Monthly 51 (1944) 36-38.
8. J.S. Frame, Remarks on a variation of Newton's method, Am. Math. Monthly 52 (1945) 212-214.
9. J.S. Frame, The solution of equations by continued fraction, Am. Math. Monthly 60 (1953) 293-305.
10. W. Gander, On Halley's iteration method, Am. Math. Monthly 92 (1985) 131-134.
11. J. Gerlach, Accelerated convergence in Newton's method, SIAM Rev. 36 (1994) 272-276.
12. E. Halley, A new, exact, and easy method of finding roots of any equations generally, and that without any previous reduction (Latin), Philos. Trans. Roy. Soc. London 18 (1694) 136-148. [English translation: Philos. Trans. Roy. Soc. London (abridged) 3 (1809) 640-649 (1809).]
13. E. Halley, A new, exact, and easy method of finding roots of any equations generally, and that without any previous reduction (Latin), Philos. Trans. Roy. Soc. London 18 (1694) 136-148. [English translation: Philos. Trans. Roy. Soc. London (abridged) 3 (1809) 640-649 (1809).]
14. H.J. Hamilton, A type of variation of Newton's method, Am. Math. Monthly 57 (1950) 517-522.
15. E. Hansen and M. Patrick, A family of root finding methods, Numer. Math. 27 (1977) 257-269.
16. B. Kalantari and I. Kalantari, High order iterative methods for approximating square and cube roots, Tech. Report LCSR-TR-213, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1993.
17. B. Kalantari and I. Kalantari, High order iterative methods for approximating roots of polynomials, Tech. Report LCSR-TR-214, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1993.
18. B. Kalantari and I. Kalantari, High order iterative methods for approximating square roots, BIT 36 (1996) 395-399.
19. D.B. Popovski, A family of one-point iteration formulae for finding roots, Internat. J. Comput. Math. 8 (1980) 85-88.
20. T.R. Scavo and J.B. Thoo, On the geometry of Halley's method, Am. Math. Monthly 102 (1995) 417-426.
21. M. Shub and S. Smale, On the geometry of polynomials and a theory of cost: Part I, Ann. Scient. Ec. Norm. Sup. 18 (1985) 107-142.
22. S. Smale, Private communications with the first author (1994).
23. R.W. Snyder, One more correction formula, Am. Math. Monthly 62 (1955) 722-725.
24. J.K. Stewart, Another variation of Newton's method, Am. Math. Monthly 58 (1951) 331-334.
25. J.F. Traub, Iterative Methods for the Solution of Equations (Prentice-Hall, Englewood Cliffs, NJ, 1964).
26. B.L. van der Waerden, Algebra, Vol. 1 (F. Ungar Publishing Co., New York, 1970).
27. H.S. Wall, A modification of Newton's method, Am. Math. Monthly 55 (1984) 90-94.
28. A.K. Yeyios, On two sequences of algorithms for approximating square roots, J. Comput. Appl. Math. 40 (1992) 63-72.