FFTW 3.1.1
Summary
Description: Fast Discrete Fourier Transform library
Source: http://www.fftw.org/
Support
This package is available for all platforms. Supporting this package is a low priority.
Description
FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. Benchmarks, performed on on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification.
It is difficult to summarize in a few words all the complexities that arise when testing many programs, and there is no "best" or "fastest" program. However, FFTW appears to be the fastest program most of the time for in-order transforms, especially in the multi-dimensional and real-complex cases (Kasparov is the best chess player in the world even though he loses some games). Hence the name, "FFTW," which stands for the somewhat whimsical title of "Fastest Fourier Transform in the West."
Changes
3.1.1 2006-03-07
Many changes since the previous 2.1.3 release. See /usr/pubsw/doc/Data/fftw/NEWS for full details.
Files
Programs: fftw-wisdom fftw-wisdom-to-conf
Libraries: libfftw.so.2 libfftw.so.2.0.5 libfftw3.a libfftw3.la
libfftw3.so libfftw3.so.3 libfftw3.so.3.1.1 librfftw.so.2
librfftw.so.2.0.5
Includes: fftw3.f/* fftw3.h
Other Files: /usr/pubsw/lib/pkgconfig/fftw3.pc
Man Pages: fftw-wisdom-to-conf(1) fftw-wisdom(1)
Info Pages: fftw3
Docs: /usr/pubsw/doc/Data/fftw
Accuracy
This information reflects the version of this package that is installed in Stanford's site-wide pubsw software tree. Newer versions of the package may be available from the package source. The contents of this page, including the source URL if applicable, are generally only reviewed when the package is upgraded and therefore may not accurately reflect the current version of the package.
