Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications

Journal of Computational and Applied Mathematics

Volumn 126, Issue 1-2, 2000, Pages 287-318

  Kalantari, Bahman ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ITERATIVE METHODS; THEOREM PROVING;

DETERMINANTAL INTERPOLATION; FIXED-POINT ITERATION; HALLEY'S METHOD; NEWTON'S METHOD; PADE APPROXIMANTS; TAYLOR'S THEOREM;

INTERPOLATION;

EID: 0034497216     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(99)00360-X     Document Type: Article

References (47)

1. G. Alefeld, On the convergence of Halley's method, Amer. Math. Monthly 88 (1981) 530-536.
2. L. Ahlfors, Complex Analysis, 2nd Edition, McGraw-Hill, New York, 1966.
3. K.E. Atkinson, An Introduction to Numerical Analysis, 2nd Edition, Wiley, New York, 1989.
4. D.F. Bailey, Historical survey of solution by functional iteration, Math. Mag. 62 (1989) 155-166.
5. G.A. Baker Jr., P.R. Graves-Morris, Padé Approximants, 2nd Edition, Encyclopedia of Mathematics and its Applications, Vol. 59, Cambridge University Press, Cambridge, 1996.
6. H. Bateman, Halley's method for solving equations, Amer. Math. Monthly 45 (1938) 11-17.
7. P. Beckmann, History of π, St. Martin's Press, New York, 1971.
8. L. Berggren, J. Borwein, P. Borwein, Pi: A Source Book, Springer, New York, 1997.
9. D. Bini, V.Y. Pan, Polynomials and Matrix Computations, Fundamental Algorithms, Vol. 1, Birkhäuser, Boston, Cambridge, MA, 1994.
10. R.P. Brent, Fast multiple-precision evaluation of elementary functions, JACM 23 (1976) 242-251.
11. C. Brezinski, History of Continued Fractions and Padé Approximants, Springer, Berlin, 1990.
12. R.H. Chan, M.K. Ng, Conjugate gradient methods for Toeplitz systems, SIAM Rev. 38 (1996) 427-482.
13. G. Dahlquist, Å. Björck, Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1974.
14. W.F. Ford, J.A. Pennline, Accelerated convergence in Newton's method, SIAM Rev. 38 (1996) 658-659.
15. J. Gerlach, Accelerated convergence in Newt7on's method, SIAM Rev. 36 (1994) 272-276.
16. G. Golub, C. Van Loan, Matrix Computations, 3rd Edition, The John Hopkins University Press, Baltimore, MD, 1996.
17. E. Halley, A new, exact, and easy method of finding roots of any equations generally, and that without any previous reduction (Latin, 1694), Philos. Trans. Roy. Soc. London 18 (1694) 136-145.
18. P. Henrici, Applied and Computational Complex Analysis, Vol. I, Wiley, New York, 1974.
19. F.B. Hildebrand, Introduction to Numerical Analysis, 2nd Edition, McGraw-Hill, New York, 1974.
20. A.S. Householder, The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York, 1970.
21. M.J. Jamieson, Rapidly converging iterative formulae for finding square roots and their computational efficiencies, Comput. J. 32 (1989) 93-94.
22. W.B. Jones, W.J. Thron, Continued Fractions, Encyclopedia of Mathematics and its Applications, Vol. 11, Addison-Wesley, Reading, MA, 1980.
23. B. Kalantari, Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas, Technical Report DCS-TR 328, Department of Computer Science, Rutgers University, New Brunswick, New Jersey, 1997.
24. 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, New Jersey, 1998.
25. B. Kalantari, Halley's method is the first member of an infinite family of cubic order rootfinding methods, Technical Report DCS-TR 370, Department of Computer Science, Rutgers University, New Brunswick, New Jersey, 1998.
26. B. Kalantari, On the order of convergence of a determinantal family of root-finding methods, BIT 39 (1999) 96-109.
27. B. Kalantari, New formula for approximation of pi and other transcendental numbers, Technical Report DCS-TR 389, Department of Computer Science, Rutgers University, New Brunswick, New Jersey, 1999. To be published in Numerical Algorithms.
28. B. Kalantari, An infinite family of iteration functions of order m for every m, Department of Computer Science, Rutgers University, New Brunswick, New Jersey, forthcoming.
29. B. Kalantari, J. Gerlach, Newton's method and generation of a determinantal family of iteration functions, J. Comput. Appl. Math. 116 (2000) 195-200.
30. B. Kalantari, I. Kalantari, High order iterative methods for approximating square roots, BIT 36 (1996) 395-399.
31. B. Kalantari, I. Kalantari, R. Zaare-Nahandi, A basic family of iteration functions for polynomial root finding and its characterizations, J. Comput. Appl. Math. 80 (1997) 209-226.
32. B. Kalantari, S. Park, A computational comparison of the first nine members of determinantal family of rootfinding methods, J. Comput. Appl. Math. 130 (2001), to be published.
33. H.T. Kung, A new upper bound on the complexity of derivative evaluation, Inform. Process. Lett. 2 (1974) 146-147.
34. J.M. McNamee, A bibliography on root of polynomials, J. Comput. Appl. Math. 47 (1993) 391-394.
35. E.P. Miles, Generalized Fibonacci numbers and associated matrices, Amer. Math. Monthly 67 (1960) 745-757.
36. Z. Nehari, Introduction to Complex Analysis, Allyn and Bacon, Boston, 1961.
37. A.M. Ostrowski, Solution of Equations and System of Equations, 2nd Edition, Academic Press, New York, 1966.
38. V.Y. Pan, New techniques for approximating complex polynomial zeros, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 260-270.
39. V.Y. Pan, Solving a polynomial equation: some history and recent progress, SIAM Rev. 39 (1997) 187-220.
40. E. Salamin, Computation of Pi using Arithmetic-geometric mean, Math. Comput. 30 (1976) 565-570.
41. T.R. Scavo, J.B. Thoo, On the geometry of Halley's method, Amer. Math. Monthly 102 (1995) 417-426.
42. M. Shub, S. Smale, On the geometry of polynomials and a theory of cost: Part I, Ann. Sci. Ecole Norm. Sup. 18 (1985) 107-142.
43. S. Smale, Newton's method estimates from data at one point, in: R.E. Ewing, K.I. Gross, C.F. Martin (Eds.), The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, 1986, pp. 185-196.
44. J.F. Traub, Iterative Methods for the Solution of Equations, Prentice-Hall, Englewood Cliffs, NJ, 1964.
45. J.F. Traub, A class of globally convergent iteration functions for the solution of polynomial equations, Math. Comput. 20 (1966) 113-138.
46. A.K. Yeyios, On two sequences of algorithms for approximating square roots, J. Comput. Appl. Math. 40 (1992) 63-72.
47. T.J. Ypma, Historical development of Newton-Raphson method, SIAM Rev. 37 (1995) 531-551.