./math/fftw, Collection of fast C routines to compute DFTs

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: pkgsrc-2013Q4, Version: 3.3.3nb2, Package name: fftw-3.3.3nb2, Maintainer: pkgsrc-users

FFTW is a free collection of fast C routines for computing the
Discrete Fourier Transform in one or more dimensions. It includes
complex, real, symmetric, and parallel transforms, and can handle
arbitrary array sizes efficiently. FFTW is typically faster than
other publically-available FFT implementations, and is even
competitive with vendor-tuned libraries. (See our web page for
extensive benchmarks.) To achieve this performance, FFTW uses novel
code-generation and runtime self-optimization techniques (along with
many other tricks).

Master sites: (Expand)

SHA1: 11487180928d05746d431ebe7a176b52fe205cf9
RMD160: f45e97f06ffaf59b5022ea5e33ef240cb5e84e74
Filesize: 3828.771 KB

Version history: (Expand)