Difference between revisions of "FFTW"
Jump to navigation
Jump to search
| (3 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
| − | [[Category:Software]][[Category: | + | [[Category:Software]][[Category:Library]][[Category:Compiler]][[Category:Math]] |
{|<!--CONFIGURATION: REQUIRED--> | {|<!--CONFIGURATION: REQUIRED--> | ||
|{{#vardefine:app|FFTW}} | |{{#vardefine:app|FFTW}} | ||
| Line 20: | Line 20: | ||
<!--Modules--> | <!--Modules--> | ||
| − | == | + | ==Environment Modules== |
| − | + | Run <code>module spider {{#var:app}}</code> to find out what environment modules are available for this application. | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
<!--Additional--> | <!--Additional--> | ||
{{#if: {{#var: exe}}|==Additional Information== | {{#if: {{#var: exe}}|==Additional Information== | ||
Latest revision as of 16:41, 15 August 2022
Description
FFTW website
Fastest Fourier Transform in the West, is a C library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data. Developed at MIT, it is by far the fastest implementation of FFT algorithm (upheld by regular benchmarks.)
Environment Modules
Run module spider FFTW to find out what environment modules are available for this application.
Citation
If you publish research that uses FFTW you may want to cite it as follows:
"A Fast Fourier Transform Compiler," by Matteo Frigo, in the Proceedings of the
1999 ACM SIGPLAN Conference on Programming Language Design and Implementation
(PLDI '99), Atlanta, Georgia, May 1999