Vectorization of Multiple-Precision Arithmetic Program and 201,326,000 Decimal Digits of π Calculation
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.
KeywordsDiscrete Fourier Transform Main Memory Decimal Place Double Precision Longe Sequence
Unable to display preview. Download preview PDF.
- 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
- 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.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.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.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.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
- 11.Knuth, D.E., The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, Mass., 1981.Google Scholar
- 16.Schutz, G., “Iterative Berechnung der Reziproken Matrix,” Z. Angew. Math. Mech., vol. 13, pp. 5759, 1933.Google Scholar
- 18.Shibata, A., 1982–1983. Private communicationsGoogle Scholar
- 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.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.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