# Difference between revisions of "FFTW"

Jump to navigation
Jump to search

(→2.1.5) |
Moskalenko (talk | contribs) |
||

(19 intermediate revisions by 8 users not shown) | |||

Line 1: | Line 1: | ||

− | + | [[Category:Software]][[Category:Numerical]] | |

− | + | {|<!--CONFIGURATION: REQUIRED--> | |

− | < | + | |{{#vardefine:app|FFTW}} |

− | + | |{{#vardefine:url|http://http://www.fftw.org}} | |

− | + | <!--CONFIGURATION: OPTIONAL (1=ON)--> | |

+ | |{{#vardefine:exe|}} <!--RUNNING --> | ||

+ | |{{#vardefine:conf|1}} <!--CONFIGS--> | ||

+ | |{{#vardefine:pbs|}} <!--PBS SCRIPTS--> | ||

+ | |{{#vardefine:policy|}} <!--POLICY--> | ||

+ | |{{#vardefine:testing|}} <!--TESTING/PROFILING--> | ||

+ | |{{#vardefine:faq|1}} <!--FAQ--> | ||

+ | |{{#vardefine:citation|1}} <!--CITATION--> | ||

+ | |{{#vardefine:installation|}} <!--INSTALLATION--> | ||

+ | |} | ||

+ | <!--BODY--> | ||

+ | <!--Description--> | ||

+ | {{#if: {{#var: url}}| | ||

+ | {{App_Description|app={{#var:app}}|url={{#var:url}}|name={{#var:app}}}}|}} | ||

+ | 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.) | ||

− | == | + | <!--Modules--> |

− | + | ==Environment Modules== | |

+ | Run <code>module spider {{#var:app}}</code> to find out what environment modules are available for this application. | ||

+ | <!--Additional--> | ||

+ | {{#if: {{#var: exe}}|==Additional Information== | ||

+ | DOUBLE_CLICK_TO_WRITE_INSTRUCTIONS_ON_RUNNING_THE_ACTUAL_BINARY | ||

+ | |}} | ||

+ | <!--Citation--> | ||

+ | {{#if: {{#var: citation}}|==Citation== | ||

+ | If you publish research that uses {{#var:app}} you may want to cite it as follows:<br/><br/> | ||

+ | "[http://www.fftw.org/pldi99.pdf 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 | ||

+ | |}} | ||

− | + | <!--Turn the Table of Contents and Edit paragraph links ON/OFF--> | |

− | + | __NOTOC____NOEDITSECTION__ | |

− |

## Latest revision as of 20:27, 2 August 2021

## 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