- Infos im HLRS Wiki sind nicht rechtsverbindlich und ohne Gewähr -
- Information contained in the HLRS Wiki is not legally binding and HLRS is not responsible for any damages that might result from its use -
FFTW: Difference between revisions
From HLRS Platforms
Jump to navigationJump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
{{Infobox software | {{Infobox software | ||
| description = 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. | | description = '''FFTW''' (Fastest Fourier Transform in the West) 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. | ||
| developer = | | developer = | ||
| available on = [[NEC Nehalem Cluster]] | | available on = [[NEC Nehalem Cluster]] | ||
Revision as of 09:57, 15 October 2010
| FFTW (Fastest Fourier Transform in the West) 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. |
| ||||||||||||