|
Accession number;99A0182292
|
| Title;Recursive Reduction of Series for Multiple-precision Evaluation and its Application to Pi Calculation. |
| Author;
MIGITA TSUYOSHI
(Hiroshimashidai Johokagaku)
AMANO AKIRA
(Hiroshimashidai Johokagaku)
ASADA NAOKI
(Hiroshimashidai Johokagaku)
FUJINO SEIJI
(Hiroshimashidai Johokagaku)
|
Journal Title;Joho Shori Gakkai Kenkyu Hokoku
|
Journal Code:Z0031B
|
ISSN:0919-6072
|
|
VOL.98;NO.115(HPC-74);PAGE.31-36(1998)
|
| Figure&Table&Reference;FIG.4, TBL.3, REF.4 |
| Pub. Country;Japan |
| Language;Japanese |
| Abstract;Multiple-precision mathematical constants, such as .PI. or e are known to be calculated by sum of series. On the other hand, much faster calculation method that use iteration are known for some constants such as .PI.. For the case of .PI., N digits calculation time by method of sum of series is said to be O(N2), and that of iterational method is O(N(logN)2). Thus, for large N, iterational method is far more efficient than that of sum of series. In this paper, we propose a fast algorithm of calculating sum of series in O(N(logN)3) time by recursively reducing adjacent terms of series. With this algorithm, calculation time of sum of series become comparable to that of iterational method in case of large N. Experimental results on calculating 32,000 to 530 million digits of .PI. showed that the Chudnovsky formula which uses sum of series can be calculated faster than the Gauss-Legendre method which uses iterational method. (author abst.) |
|
|
|
Related Articles;
|
