On the rapid computation of various polylogarithmic constants

Mathematics of Computation

Volumn 66, Issue 218, 1997, Pages 903-913

  Bailey, David ^a   Borwein, Peter ^b   Plouffe, Simon ^b  

^a NASA AMES RESEARCH CENTER   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Algorithm; Computation; Digits; Log; Polylogarithms; SC;

Indexed keywords

EID: 0031492439     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0025-5718-97-00856-9     Document Type: Article

References (38)

1. M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions, Dover, New York, NY, 1966. MR 34:8606
2. M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions, Dover, New York, NY, 1966. MR 34:8606
3. V. Adamchik and S. Wagon, Pi: A 2000-year search changes direction (preprint).
4. A. V. Aho, J.E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1975. MR 54:1706
5. A. V. Aho, J.E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1975. MR 54:1706
6. D. H. Bailey, J. Borwein and R. Girgensohn, Experimental evaluation of Euler sums, Experimental Mathematics 3 (1994), 17-30. MR 96e:11168
7. D. H. Bailey, J. Borwein and R. Girgensohn, Experimental evaluation of Euler sums, Experimental Mathematics 3 (1994), 17-30. MR 96e:11168
8. J. Borwein, and P Borwein, Pi and the AGM - A Study in Analytic Number Theory and Computational Complexity, Wiley, New York, NY, 1987. MR 89a:11134
9. J. Borwein, and P Borwein, Pi and the AGM - A Study in Analytic Number Theory and Computational Complexity, Wiley, New York, NY, 1987. MR 89a:11134
10. J. Borwein and P. Borwein, On the complexity of familiar functions and numbers, SIAM Review 30 (1988), 589-601. MR 89k:68061
11. J. Borwein and P. Borwein, On the complexity of familiar functions and numbers, SIAM Review 30 (1988), 589-601. MR 89k:68061
12. J. Borwein, P. Borwein and D. H. Bailey, Ramanujan, modular equations and approximations to pi, Amer. Math. Monthly 96 (1989), 201-219. MR 90d:11143
13. J. Borwein, P. Borwein and D. H. Bailey, Ramanujan, modular equations and approximations to pi, Amer. Math. Monthly 96 (1989), 201-219. MR 90d:11143
14. R. Brent, The parallel evaluation of general arithmetic expressions, J. Assoc. Comput. Mach. 21 (1974), 201-206. MR 58:31996
15. R. Brent, The parallel evaluation of general arithmetic expressions, J. Assoc. Comput. Mach. 21 (1974), 201-206. MR 58:31996
16. S. Cook, A taxonomy of problems with fast parallel algorithms, Information and Control 64 (1985), 2-22. MR 87k:68043
17. S. Cook, A taxonomy of problems with fast parallel algorithms, Information and Control 64 (1985), 2-22. MR 87k:68043
18. R. Crandall, K. Dilcher, and C. Pomerance, A search for Wieferich and Wilson primes, Math. Comp. 66 (1997), 433-449. CMP 96:07
19. R. Crandall, K. Dilcher, and C. Pomerance, A search for Wieferich and Wilson primes, Math. Comp. 66 (1997), 433-449. CMP 96:07
20. R. Crandall and J. Buhler, On the evaluation of Euler sums, Experimental Mathematics 3, (1995), 275-285. MR 96e:11113
21. R. Crandall and J. Buhler, On the evaluation of Euler sums, Experimental Mathematics 3, (1995), 275-285. MR 96e:11113
22. H. R. P. Ferguson and D. H. Bailey, Analysis of PSLQ, on integer relation algorithm (preprint).
23. E. R. Hansen, A Table of Series and Products, Prentice-Hall, Englewood Cliffs, NJ, 1975.
24. D. E. Knuth, The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1981. MR 83i:68003
25. D. E. Knuth, The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1981. MR 83i:68003
26. L. Lewin, Polylogarithms and Associated Functions, North Holland, New York, 1981. MR 83b:33019
27. L. Lewin, Polylogarithms and Associated Functions, North Holland, New York, 1981. MR 83b:33019
28. L. Lewin, Structural Properties of Polylogarithms, Amer. Math. Soc., RI., 1991. MR 93b:11158
29. L. Lewin, Structural Properties of Polylogarithms, Amer. Math. Soc., RI., 1991. MR 93b:11158
30. N. Nielsen, Der Eulersche Dilogarithmus, Halle, Leipzig, 1909.
31. S. D. Rabinowitz and S. Wagon, A spigot algorithm for the digits of pi, Amer. Math. Monthly 102 (1995), 195-203. MR 96a:11152
32. S. D. Rabinowitz and S. Wagon, A spigot algorithm for the digits of pi, Amer. Math. Monthly 102 (1995), 195-203. MR 96a:11152
33. A. Schönhage, Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coefficients, in: EUROCAM (1982) Marseille, Springer Lecture Notes in Computer Science, vol. 144, 1982, pp. 3-15. MR 83m:68064
34. A. Schönhage, Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coefficients, in: EUROCAM (1982) Marseille, Springer Lecture Notes in Computer Science, vol. 144, 1982, pp. 3-15. MR 83m:68064
35. J. Todd, A problem on arc tangent relations, Amer. Math. Monthly 56 (1949), 517-528. MR 11:159d
36. J. Todd, A problem on arc tangent relations, Amer. Math. Monthly 56 (1949), 517-528. MR 11:159d
37. H. S. Wilf, Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, 1986. MR 88j:68073
38. H. S. Wilf, Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, 1986. MR 88j:68073