@techreport{oai:jaxa.repo.nii.ac.jp:00043233,
 author = {花村, 光泰 and 萬, 淳一 and 増田, 典雄 and 津和, 義昭 and 渡辺, 貞 and Hanamura, Mitsuyasu and Yorozu, Jun-ichi and Masuda, Norio and Tsuwa, Yoshiaki and Watanabe, Tadashi},
 month = {Dec},
 note = {Fast Fourier Transform (FFT) has been widely applied to various fields covering science, technology and social science. It's used not only in the spectral analysis of acoustic signals, seismic waves and so on, but also in boundary value problems of PDE occuring in numerical fluid dynamics (for example, as a direct method of solving a Poisson type PDE (RES method, etc.)). Since the appearance of supercomputers, research of FFT algorithms available for supercomputers has increased rapidly. We have investigated the one-dimensional and two-dimensional FFT algorithms available for the supercomputer SX system. In this paper, we present the algorithms and calculated CPU-time of two-dimensional FFTs. We obtained a time of 9.41 mscc in calculating two-dimensional FFT (256 by 256) at single precision using the SX-2., 資料番号: NALSP0007017, レポート番号: NAL SP-7},
 title = {スーパーコンピュータSXシステムにおけるFFTプログラムの高速化},
 year = {1986}
}