From ScientificComputing
Jump to: navigation, search


Development, Library


FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, symmetric, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks).

Available versions (Euler, old software stack)

Legacy versions Supported versions New versions
2.1.5, 2.1.5_both, 2.1.5_sp, 2.1.5_sp_both 3.3.3 3.3.4

Environment modules (Euler, old software stack)

The fftw module is a smart module, which checks for a loaded compiler module and then loads the corresponding FFTW version. For the module load command example, we use the standard compiler gcc/4.8.2.
Version Module load command Additional modules loaded automatically
2.1.5 module load legacy gcc/4.8.2 fftw/2.1.5
2.1.5_both module load legacy gcc/4.8.2 fftw/2.1.5_both
2.1.5_sp module load legacy gcc/4.8.2 fftw/2.1.5_sp
2.1.5_sp_both module load legacy gcc/4.8.2 fftw/2.1.5_sp_both
3.3.3 module load gcc/4.8.2 fftw/3.3.3
3.3.4 module load new gcc/4.8.2 fftw/3.3.4

License information

GPLv2 or later