Vectorization of Multiple-Precision Arithmetic Program and 201,326,000 Decimal Digits of π Calculation

  • Yasumasa Kanada
Chapter

Abstract

More than 200 million decimal places of π were calculated using arithmetic-geometric mean formula independently discovered by Salamin and Brent in 1976. Correctness of the calculation were verified through Borwein’s quartic convergent formula developed in 1983. The computation took CPU times of 5 hours 57 minutes for the main calculation and 7 hours 30 minutes for the verification calculation on the HITAC S-820 model 80 supercomputer with 256 Mb of main memory and 3 Gb of high speed semiconductor storage, Extended Storage, for shorten I/O time.

Keywords

Discrete Fourier Transform Main Memory Decimal Place Double Precision Longe Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bailey, D.H., “The Computation of ni to 29,360,000 Decimal Digits Using Borwein’s Quartically Convergent Algorithm,” Math. Comp., vol. 50, no. 181, pp. 66–88, Jan. 1988.Google Scholar
  2. 2.
    Borwein, J.M. and Borwein, P.B., Pi and the AGM - A study in Analytic Number Theory and Computational Complexity, A Wiley-Interscience Publication, New York, 1987.MATHGoogle Scholar
  3. 3.
    Borwein, J.M. and Borwein, P.B., “Ramanujan and Pi,” Scientific American, vol. 258, pp. 66–73, Feb. 1988.CrossRefGoogle Scholar
  4. 4.
    Brent, R.P., “Fast Multiple-Precision Evaluation of Elementary Functions,” J. ACM., vol. 23, no. 2, pp. 242–251, April 1976.MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Brent, R.P., “Multiple-Precision Zero-Finding Methods and the Complexity of Elementary Function Evaluation,” in Analytic Computational Complexity, ed. Traub, J.F., pp. 151–176, Academic Press, New York, 1976.Google Scholar
  6. 6.
    Gentleman, W.M. and Sande, G., “Fast Fourier Transforms - For Fun and Profit,” AFIPS Conf. Proc. FJCC, vol. 29, pp. 563–578, Spartan Books, San Francisco, Calif., November 1966.Google Scholar
  7. 7.
    Kanada, Y., “Statistical Analysis of it up to 200,000,000 Decimal Places,” CCUT–TR–88–02, in preparation, Computer Centre, University of Tokyo, Bunkyo–ku, Yayoi 2–11–16, Tokyo 113, Japan, Nov. 1988.Google Scholar
  8. 8.
    Tamura, Y., Yoshino, S., Ushiro, Y. and Kanada, Y., “Circular Constant - It’s High Speed Calculation Method and Statistics -,” in Proceedings Programming Symposium, in Japanese, Information Processing Society of Japan, Jan. 1984.Google Scholar
  9. 9.
    Tamura, Y. and Kanada, Y., “Calculation of n to 4,194,293 Decimals Based on the Gauss–Legendre Algorithm,” CCUT–TR–83–01, Computer Centre, University of Tokyo, Bunkyo–ku, Yayoi 2–11–16, Tokyo 113, Japan, May 1983.Google Scholar
  10. 10.
    Kaneko, T. and Liu, B., “Accumulation of Round-Off Error in Fast Fourier Transforms,” J. ACM., vol. 17, no. 4, pp. 637–654, Oct. 1970.MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Knuth, D.E., The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, Mass., 1981.Google Scholar
  12. 12.
    Laasonen, P., “On the Iterative Solution of the Matrix Equation A X’2–I = 0,” Math. Tables and Other lids to Comp., vol. 12, pp. 109–116, 1958.MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Pathria, R.K., “A Statistical Study of Randomness Among the First 10,000 Digits of n,” Math. Comp., vol. 16, pp. 188–197, 1962.MathSciNetMATHGoogle Scholar
  14. 14.
    Salamin, E., “Computation of n Using Arithmetic-Geometric Mean,” Math. Comp., vol. 30, no. 135, pp. 565–570, July 1976.MathSciNetMATHGoogle Scholar
  15. 15.
    Schönhage, A. and Strassen, V., “Schnelle Multiplikation Grosser Zahlen,” Computing, vol. 7, pp. 281–292, 1971.MATHCrossRefGoogle Scholar
  16. 16.
    Schutz, G., “Iterative Berechnung der Reziproken Matrix,” Z. Angew. Math. Mech., vol. 13, pp. 5759, 1933.Google Scholar
  17. 17.
    Shanks, D. and Wrench, Jr. W., “Calculation of n to 100,000 Decimals,” Math. Comp., vol. 16, pp. 76–79, 1962.MathSciNetMATHGoogle Scholar
  18. 18.
    Shibata, A., 1982–1983. Private communicationsGoogle Scholar
  19. 19.
    Tamura, Y., “Calculation of n to 2 Million Decimals Using Legendre-Gauss’ Relation,” Proceeding of the International Latitude Observatory of Mizusawa No.22 (in Japanese) in press, Internal Latitude Observatory of Mizusawa, Hoshigaoka-cho 2–12, Mizusawa City, 023 Iwate Prefecture, Japan, 1983.Google Scholar
  20. 20.
    Ushiro, Y., “Calculation of Multiple-Precision Numbers through Vectorizing Processor,” in Numerical Calculation Workshop, in Japanese, Information Processing Society of Japan, 26–28 May. 1983.Google Scholar
  21. 21.
    Kanada, Y., Tamura, Y., Yoshino, S. and Ushiro, Y., “Calculation of n to 10,013,395 Decimal Places Based on the Gauss–Legendre Algorithm and Gauss Arctangent Relation,” CCUT–TR–84–01, Computer Centre, University of Tokyo, Bunkyo–ku, Yayoi 2–11–16, Tokyo 113, Japan, Dec 1983.Google Scholar

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Yasumasa Kanada
    • 1
  1. 1.Computer CentreUniversity of TokyoTokyo 113Japan

Personalised recommendations