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

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

Branch: pkgsrc-2007Q4, Version: 3.1.2, Package name: fftw-3.1.2, Maintainer: root

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).

Required to run:

Master sites: (Expand)

SHA1: 3e4c64009ffb48123a0f30f46c1d89da7810dc67
RMD160: 13069b3582eeaa1fba1614cdca2dfbc2e45ab585
Filesize: 2672.227 KB

Version history: (Expand)