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

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

Branch: pkgsrc-2019Q4, Version: 3.3.8nb2, Package name: fftw-3.3.8nb2, 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:

SHA1: 59831bd4b2705381ee395e54aa6e0069b10c3626
RMD160: ce2d1c266a13c96af85d51d75252417458947dc6
Filesize: 4013.806 KB

Version history: (Expand)