On extraneous fixed-points of the basic family of iteration functions

BIT Numerical Mathematics

Volumn 43, Issue 2, 2003, Pages 453-458

  Kalantar, B ^a   Jin, Y ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Fixed point; Iteration function; Newton's method; Orbits; Root finding

Indexed keywords

EID: 2542432981     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026095904985     Document Type: Article

References (22)

1. H. Bateman, Halley's method for solving equations, Amer. Math. Monthly, 45 (1938), pp. 11-17.
2. W. F. Ford, and J. A. Pennline, Accelerated convergence in Newton's method, SIAM Review, 38 (1996), pp. 658-659.
3. J. Gerlach, Accelerated convergence in Newton's method, SIAM Review, 36 (1994), pp. 272-276.
4. E. Halley, A new, exact, and easy method of finding roots of any equations generally, and that without any previous reduction, Philos. Trans. Roy. Soc. London, 18 (1694), pp. 136-145.
5. P. Henrici, Applied and Computational Complex Analysis, Vol. I, Wiley, New York, 1974.
6. A. S. Householder, The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York, 1970.
7. B. Kalantari, and I. Kalantari, High order iterative methods for approximating square roots, BIT, 36 (1996), pp. 395-399.
8. B. Kalantari, I. Kalantari, and R. Zaare-Nahandi, A basic family of iteration functions for polynomial root finding and its characterizations, J. Comput. Appl. Math., 80 (1997), pp. 209-226.
9. B. Kalantari, On the order of convergence of a determinantal family of root-finding methods, BIT, 39 (1999), pp. 96-109.
10. B. Kalantari, Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications, J. Comput. Appl. Math., 126 (2000), pp. 287-318.
11. B. Kalantari, Approximation of polynomial root using a single input and the corresponding derivative values, Technical Report DCS-TR 369, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1998.
12. B. Kalantari, Halley's method is the first member of an infinite family of cubic order root-finding methods, Technical Report DCS-TR 370, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1998.
13. B. Kalantari and J. Gerlach, Newton's method and generation of a determinantal family of iteration functions, J. Comput. Appl. Math., 116 (2000), pp. 195-200.
14. B. Kalantari, On homogeneous linear recurrence relations and approximation of zeros of complex polynomials, Technical Report DCS-TR 412, Department of Computer Science, Rutgers University, New Brunswick, NJ, 2000, to appear in DIMACS Proceedings on Unusual Applications in Number Theory.
15. B. Kalantari and S. Park, A computational comparison of the first nine members of a determinantal family of root-finding methods, J. Comput. Appl. Math., 130 (2001), pp. 197-204.
16. B. Kalantari, Polynomiography: A new intersection between mathematics and art, Technical Report DCS-TR 506, Department of Computer Science, Rutgers University, New Brunswick, NJ, 2002.
17. T. R. Scavo, and J. B. Thoo, On the geometry of Halley's method, Amer. Math. Monthly, 102 (1995), pp. 417-426.
18. E. Schröder, On infinitely many algorithms for solving equations (in German), Math. Ann. 2 (1870), pp. 317-365. English translation by G. W. Stewart, TR-92-121, Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 1992.
19. M. Shub, and S. Smale, Computational complexity: On the geometry of polynomials and a theory of cost, Part I, Ann. Sci. Ecole Norm. Sup., 18 (1985), pp. 107-142.
20. J. F. Traub, Iterative Methods for the Solution of Equations, Prentice Hall, Englewood Cliffs, NJ, 1964.
21. E. R. Vrscay and W. J. Gilbert, Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König iteration functions, Numer. Math., 52, (1988), pp. 1-16.
22. T. J. Ypma, Historical development of Newton-Raphson method, SIAM Review, 37 (1995), pp. 531-551.