References

Contents Next: About this document Up: Recognizing Numerical Previous: References

References

1: M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, Dover Publications, New York, 1972.
[1]
2: K. E. Atkinson, An Introduction to Numerical Analysis, John Wiley, New York, 1989.
[1] [2]
3: D. H. Bailey, ``Multiprecision Translation and Execution of Fortran Programs,'' ACM Transactions on Mathematical Software, to appear. This software and documentation may be obtained by sending electronic mail to mp-request@nas.nasa.gov.
[1] [2]
4: D. H. Bailey, J. M. Borwein and R. Girgensohn, ``Experimental Evaluation of Euler Sums,'' Experimental Mathematics, vol. 2 (October 1994), pg. xx-yy.
[1] [2] [3] [4]
5: D. H. Bailey, P. B. Borwein and S. Plouffe, ``On the Rapid Computation of Various Polylogarithmic Constants,'' manuscript, 1995. Available from http://www.cecm.sfu/~pborwein.
[1]
6: D. H. Bailey and H. R. P. Ferguson, ``Numerical Results on Relations Between Numerical Constants Using a New Algorithm,'' Mathematics of Computation, vol. 53 (October 1989), p. 649 - 656.
[1] [2]
7: B. C. Berndt, Ramanujan's Notebook, Part I, Springer Verlag, New York, 1985.
[1]
8: D. Borwein and J. M. Borwein, ``On An Intriguing Integral and Some Series Related to ,'' to appear in Proceedings of the American Mathematical Society.
[1]
9: D. Borwein, J. M. Borwein and R. Girgensohn, ``Explicit Evaluation of Euler Sums,'' to appear in Proceedings of the Edinburgh Mathematical Society.
[1]
10: J. M. Borwein and P. B. Borwein, Pi and the AGM, John Wiley, New York, 1987.
[1]
11: B. W. Char, K. O. Geddes, G. H. Gonnet, B. L. Leong, M. B. Monagan, S. M. Watt, Maple V Language Reference Manual, Springer-Verlag, New York, 1991.
[1]
12: H. R. P. Ferguson and D. H. Bailey, ``A Polynomial Time, Numerically Stable Integer Relation Algorithm,'' RNR Technical Report RNR-91-032, NASA Ames Research Center, MS T045-1, Moffett Field, CA 94035-1000.
[1] [2]
13: H. R. P. Ferguson, D. H. Bailey and S. Arno, ``Analysis of PSLQ, An Integer Relation Finding Algorithm,'' manuscript, 1995.
[1]
14: H. R. P. Ferguson and R. W. Forcade, ``Generalization of the Euclidean Algorithm for Real Numbers to All Dimensions Higher Than Two,'' Bulletin of the American Mathematical Society, 1 (1979), p. 912 - 914.
[1]
15: J. Hastad, B. Just, J. C. Lagarias and C. P. Schnorr, ``Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers,'' SIAM Journal on Computing, vol. 18 (1988), p. 859 - 881.
[1]
16: A. K. Lenstra, H. W. Lenstra and L. Lovasz, ``Factoring Polynomials with Rational Coefficients'', Math. Annalen, vol. 261 (1982), p. 515 - 534.
[1]
17: S. Wolfram, Mathematica: A System for Doing Mathematics by Computer, Addison Wesley, Menlo Park, 1988.
[1]