PFFT: An extension of FFTW to massively parallel architectures
M Pippig - SIAM Journal on Scientific Computing, 2013 - SIAM
We present an MPI based software library for computing fast Fourier transforms (FFTs) on
massively parallel, distributed memory architectures based on the Message Passing …
massively parallel, distributed memory architectures based on the Message Passing …
Parallel three-dimensional nonequispaced fast Fourier transforms and their application to particle simulation
Starting from an approved serial algorithm, we develop a new parallel algorithm for
calculating nonequispaced fast Fourier transforms on massively parallel distributed memory …
calculating nonequispaced fast Fourier transforms on massively parallel distributed memory …
Fast fourier transforms
As shown in Chap. 3, any application of Fourier methods leads to the evaluation of a
discrete Fourier transform of length N (DFT (N)). Thus the efficient computation of DFT (N) is …
discrete Fourier transform of length N (DFT (N)). Thus the efficient computation of DFT (N) is …
[PDF][PDF] PFFT User Manual
M Pippig - 2018 - www-user.tu-chemnitz.de
A popular software library for computing FFTs is FFTW [11, 10]. This library also includes a
parallel FFT implementation (FFTW-MPI) based on the Message Passing Interface (MPI) …
parallel FFT implementation (FFTW-MPI) based on the Message Passing Interface (MPI) …