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

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

Branch: pkgsrc-2011Q1, Version: 3.2.2nb1, Package name: fftw-3.2.2nb1, 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: d43b799eedfb9408f62f9f056f5e8a645618467b
RMD160: 27af9b97072fa3a41b91b9430d093f671a1cd359
Filesize: 3413.2 KB

Version history: (Expand)