Contents of this Asset file:
| Field Name | Value | HTML Tag Type |
|---|---|---|
| BIDM.Asset.Abstract | FFTW is a collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. FFTW is unique in two respects. First, it is not just optimized for arrays whose sizes are powers of 2, 3, or other small numbers. Instead, FFTW comes with a code generator that produces C programs for any particular array size you may care about. Second, it doesn't use a fixed strategy for performing the transform. There are usually many ways to decompose a big problem into small problems, and the optimal way often depends on many unpredictable factors. Unlike other programs, FFTW can find the optimal decomposition at runtime for the machine it is running on. | META |
| BIDM.Asset.ContactIs.Organization | http://www.nhse.org/rib/repositories/hpc-netlib/objects/Organization/fftw_help.html | LINK |
| BIDM.Asset.DateOfInformation | Sat Oct 17 20:27:31 1998 | META |
| BIDM.Asset.Domain | Numerical Programs and Routines!Miscellaneous | META |
| BIDM.Asset.Keyword | Fourier Transform | META |
| BIDM.Asset.Name | FFTW | META |
| BIDM.Asset.RecordMaintainedBy.Organization | http://www.nhse.org/rib/repositories/hpc-netlib/objects/Organization/hpc-netlib.html | LINK |
| BIDM.Asset.TargetEnvironment | Works on any platform with a C compiler. | META |
| BIDM.Asset.TitleLine | a C subroutine library for performing the Discrete Fourier Transform (DFT) in one or more dimensions. | META |
| BIDM.Asset.Version | 2.0.1 | META |
| BIDM.Asset.Webpage | http://theory.lcs.mit.edu/~fftw/ | META |