Description
FFTW, for "Fastest Fourier Transform in the West," is a software library for computing discrete Fourier transforms (DFTs), developed by Matteo Frigo and Steven G. Johnson at the MIT Laboratory for Computer Science.[1]
FFTW is known as the fastest free software implementation of the Fast Fourier transform (FFT) algorithm. It can compute transforms of real- and complex-valued arrays of arbitrary size and dimension in O(n log n) time.
It does this by supporting a variety of algorithms and choosing the one it estimates or measures to be preferable in the particular circumstances. It works best on arrays of sizes with small prime factors, with powers of two being the optimal size and a (large) prime size being the worst case.
Installations
MinoTauro:Versions:
3.3.8-mpi-threads
3.3.8
3.3.4
3.3
3.2.2
2.1.5
MareNostrum 4:
Versions:
3.3.8
3.3.6
2021.12-16
2.1.5
StarLife:
Versions:
3.3.8
Nord3:
Versions:
3.3.6
3.3.4
3.3.3
3.3.10
3.3
2.1.5
CTE-AMD:
Versions:
3.3.10
CTE-POWER:
Versions:
3.3.9
3.3.8
3.3.7
3.3.6
3.3.10