# zbMATH — the first resource for mathematics

Parallel compact FFTs for real sequences. (English) Zbl 0784.65108
Parallel algorithms for the fast Fourier transform are given to use the SIMD- and MIMD-type multiprocessors with distributed memories. These algorithms are of the in-place type and used for the transformation of real and conjugate-symmetric sequences with minimal communication costs. Values of the computational complexity are less than $$5N/2P \log_ 2 N$$.

##### MSC:
 65T50 Numerical methods for discrete and fast Fourier transforms 65Y05 Parallel numerical computation 65Y20 Complexity and performance of numerical algorithms
Full Text: