A general purpose subroutine for fast fourier transform on a distributed memory parallel machine
- 1 December 1994
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 20 (12) , 1697-1710
- https://doi.org/10.1016/0167-8191(94)90126-0
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Cooley-Tukey FFT on the Connection MachineParallel Computing, 1992
- Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputersThe Journal of Supercomputing, 1992
- Bluestein's FFT for arbitrary N on the hypercubeParallel Computing, 1991
- Ordered fast fourier transforms on a massively parallel hypercube multiprocessorJournal of Parallel and Distributed Computing, 1991
- A parallel FFT on an MIMD machineParallel Computing, 1990
- Gray codes, Fast Fourier Transforms and hypercubesParallel Computing, 1988
- Multiprocessor FFTsParallel Computing, 1987
- A high-performance fast Fourier transform algorithm for the Cray-2The Journal of Supercomputing, 1987
- FFT algorithms for SIMD parallel processing systemsJournal of Parallel and Distributed Computing, 1986
- Basic Linear Algebra Subprograms for Fortran UsageACM Transactions on Mathematical Software, 1979