@article{oai:miyazaki-u.repo.nii.ac.jp:00002642,
 author = {吉原, 郁夫 and Yoshihara, Ikuo and 本田, 詩織 and Honda, Shiori and 坂本, 亜衣 and Sakamoto, Ai and 山森, 一人 and Yamamori, Kunihito and 棟朝, 雅晴 and Munetomo, Masaharu and 本田, 詩織 and Honda, Shiori and 坂本, 亜衣 and Sakamoto, Ai and 棟朝, 雅晴 and Munetomo, Masaharu},
 journal = {宮崎大学工学部紀要, Memoirs of Faculty of Engineering, University of Miyazaki},
 month = {Jul},
 note = {It is necessary to employ “multiple precision arithmetic" for computing long digit numbers, because numerical representation of computers is usually limited. This paper aims at making prototype software to compute more than one million digit numbers. A long digit number is divided into 2^n short digit numbers, each of which can be calculated by ordinal double precision arithmetic units. The key technique of “multiple precision arithmetic" is based on fast Fourier transform and convolution theorem. The prototype program is verified from the viewpoint of correctness of calculation up to 4 X 10^6 digits and speed up ratio vs theoretical value. The program is applied to calculation of a 10^7 or more digit π.},
 pages = {337--341},
 title = {多倍長計算ソフトウェアの開発},
 volume = {41},
 year = {2012},
 yomi = {ヨシハラ, イクオ and ホンダ, シオリ and サカモト, アイ and ヤマモリ, クニヒト and ムネトモ, マサハル and ホンダ, シオリ and サカモト, アイ and ムネトモ, マサハル}
}