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

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

Branch: pkgsrc-2016Q1, Version: 3.3.4nb2, Package name: fftw-3.3.4nb2, 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: fd508bac8ac13b3a46152c54b7ac885b69734262
RMD160: 463b5120d42ec2a3bc1385689176c5e0296d0d4a
Filesize: 3848.073 KB

Version history: (Expand)