New formulas for approximation of π and other transcendental numbers

Numerical Algorithms

Volumn 24, Issue 1-2, 2000, Pages 59-81

  Kalantari, Bahman ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Algorithms; Digits; Iteration functions; Order of convergence;

Indexed keywords

EID: 0034416248     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1019184908442     Document Type: Article

References (24)

1. G.A. Baker Jr. and P.R. Graves-Morris, Padé Approximants, 2nd ed., Encyclopedia of Mathematics and its Applications, Vol. 59 (Cambridge Univ. Press, Cambridge, 1996).
2. D.H. Bailey, The computation of Pi to 29,360,000 decimal digits using Borwein's quadratically convergent algorithm, Math. Comp. (1988) 283-296.
3. D.H. Bailey, J.M. Borwein, P.B. Borwein and S. Plouffe, The quest for π, Math. Intelligencer 19 (1997) 50-57.
4. P. Beckmann, History of π (St. Martin's Press, New York, 1971).
5. L. Berggren, J. Borwein and P. Borwein, Pi: A Source Book (Springer, New York, 1997).
6. D. Bini and V.Y. Pan, Polynomials and Matrix Computations, Vol. 1: Fundamental Algorithms (Birkhäuser, Boston/Cambridge, MA, 1994).
7. J.M. Borwein, P.B. Borwein and H. Bailey, Ramanujan, modular equations, and approximation to π, or how to compute one billion digits of π, Amer. Math. Monthly (1989) 201-219.
8. R.P. Brent, Fast multiple-precision evaluation of elementary functions, J. Assoc. Comput. Mach. 23 (1976) 242-251.
9. D.V. Chudnovsky and G.V. Chudnovsky, Approximations and Complex Multiplication According to Ramanujan. Ramanujan revisited (Urbana-Champaign, IL, 1987) (Academic Press, Boston, MA, 1988) 375-472.
10. C.M. Fiduccia, An efficient formula for linear recurrences, SIAM J. Comput. 14 (1985) 106-112.
11. 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) 136-145.
12. B. Kalantari and I. Kalantari, High order iterative methods for approximating square roots, BIT 36 (1996) 395-399.
13. 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) 209-226.
14. B. Kalantari, On the order of a determinantal family of root-finding methods, BIT 39 (1999) 96-109.
15. 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, NJ (1997), to appear in J. Comput. Appl. Math.
16. B. Kalantar, A lower bound on determinants from linear programming, Technical Report DCS-TR 330, Department of Computer Science, Rutgers University, New Brunswick, NJ (1997).
17. 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).
18. B. Kalantari, Halley's method as 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, NJ (1998).
19. B. Kalantari and J. Gerlach, Newton's method and generation of a determinantal family of iteration functions, Technical Report DCS-TR 371, Department of Computer Science, Rutgers University, New Brunswick, NJ (1998), to appear in J. Comput. Appl. Math.
20. B. Kalantari and S. Park, A computational comparison of the first nine members of a determinantal family of rootfinding methods, Technical Report DCS-TR 375, Department of Computer Science, Rutgers University, New Brunswick, NJ (1998), to appear in J. Comput. Appl. Math.
21. M. Marcus and H. Mine, A Survey of Matrix Theory and Matrix Inequalities (Allyn and Bacon, Boston, MA, 1964).
22. E. Salamin, Computation of Pi using Arithmetic-geometric mean, Math. Comp. 30 (1976) 565-570.
23. T.R. Scavo and J.B. Thoo, On the geometry of Halley's method, Amer. Math. Monthly 102 (1995) 417-426.
24. D. Takahashi and Y. Kanada, Calculation of π to 51.5 billion decimal digits on distributed memory parallel processors (in Japanese) Trans. Inform. Process. Soc. Japan 39 (1998) 2074-2083.