Matches in DBpedia 2014 for { <http://dbpedia.org/resource/FFTW> ?p ?o. }
Showing items 1 to 60 of
60
with 100 items per page.
- FFTW abstract "The Fastest Fourier Transform in the West (FFTW) is a software library for computing discrete Fourier transforms (DFTs) developed by Matteo Frigo and Steven G. Johnson at the Massachusetts Institute of Technology.FFTW is known as the fastest free software implementation of the Fast Fourier transform (FFT) algorithm (upheld by regular benchmarks). 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 (a particular decomposition of the transform into smaller transforms) 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 optimal and large primes being worst case (but still O(n log n)). To decompose transforms of composite sizes into smaller transforms, it chooses among several variants of the Cooley–Tukey FFT algorithm (corresponding to different factorizations and/or different memory-access patterns), while for prime sizes it uses either Rader's or Bluestein's FFT algorithm. Once the transform has been broken up into subtransforms of sufficiently small sizes, FFTW uses hard-coded unrolled FFTs for these small sizes that were produced (at compile time, not at run time) by code generation; these routines use a variety of algorithms including Cooley–Tukey variants, Rader's algorithm, and prime-factor FFT algorithms.For a sufficiently large number of repeated transforms it is advantageous to measure the performance of some or all of the supported algorithms on the given array size and platform. These measurements, which the authors refer to as "wisdom", can be stored in a file or string for later use.FFTW has a "guru interface" that intends "to expose as much as possible of the flexibility in the underlying FFTW architecture". This allows, among other things, multi-dimensional transforms and multiple transforms in a single call (e.g., where the data is interleaved in memory).FFTW has limited support for out-of-order transforms (using the MPI version). The data reordering incurs an overhead, which for in-place transforms of arbitrary size and dimension is non-trivial to avoid. It is undocumented for which transforms this overhead is significant.FFTW is licensed under the GNU General Public License. It is also licensed commercially by MIT and is used in the commercial MATLAB matrix package for calculating FFTs. FFTW is written in the C language, but Fortran and Ada interfaces exist, as well as interfaces for a few other languages. While the library itself is C, the code is actually generated from a program called 'genfft', which is written in OCaml.In 1999, FFTW won the J. H. Wilkinson Prize for Numerical Software.".
- FFTW genre Numerical_analysis.
- FFTW latestReleaseVersion "3.3.4".
- FFTW license GNU_General_Public_License.
- FFTW releaseDate "1997-03-24".
- FFTW wikiPageExternalLink www.fftw.org.
- FFTW wikiPageID "2969334".
- FFTW wikiPageRevisionID "601010031".
- FFTW developer "Matteo Frigo and Steven G. Johnson".
- FFTW genre Numerical_analysis.
- FFTW hasPhotoCollection FFTW.
- FFTW latestReleaseVersion "3.3".
- FFTW license "GPL, commercial".
- FFTW name "FFTW".
- FFTW programmingLanguage C_(programming_language).
- FFTW programmingLanguage OCaml.
- FFTW released "1997-03-24".
- FFTW wordnet_type synset-software-noun-1.
- FFTW subject Category:FFT_algorithms.
- FFTW subject Category:Free_mathematics_software.
- FFTW subject Category:Numerical_libraries.
- FFTW subject Category:OCaml_software.
- FFTW type Abstraction100002137.
- FFTW type Act100030358.
- FFTW type Activity100407535.
- FFTW type Algorithm105847438.
- FFTW type Code106355894.
- FFTW type CodingSystem106353757.
- FFTW type Communication100033020.
- FFTW type Event100029378.
- FFTW type FFTAlgorithms.
- FFTW type Procedure101023820.
- FFTW type PsychologicalFeature100023100.
- FFTW type Rule105846932.
- FFTW type Software106566077.
- FFTW type Writing106359877.
- FFTW type WrittenCommunication106349220.
- FFTW type YagoPermanentlyLocatedEntity.
- FFTW type Software.
- FFTW type Work.
- FFTW type CreativeWork.
- FFTW type InformationEntity.
- FFTW comment "The Fastest Fourier Transform in the West (FFTW) is a software library for computing discrete Fourier transforms (DFTs) developed by Matteo Frigo and Steven G. Johnson at the Massachusetts Institute of Technology.FFTW is known as the fastest free software implementation of the Fast Fourier transform (FFT) algorithm (upheld by regular benchmarks).".
- FFTW label "FFTW".
- FFTW label "FFTW".
- FFTW label "FFTW".
- FFTW label "FFTW".
- FFTW label "FFTw".
- FFTW sameAs FFTW.
- FFTW sameAs FFTw.
- FFTW sameAs FFTW.
- FFTW sameAs FFTW.
- FFTW sameAs m.08gt0_.
- FFTW sameAs Q2251820.
- FFTW sameAs Q2251820.
- FFTW sameAs FFTW.
- FFTW wasDerivedFrom FFTW?oldid=601010031.
- FFTW homepage www.fftw.org.
- FFTW isPrimaryTopicOf FFTW.
- FFTW name "FFTW".