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

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

Branch: pkgsrc-2012Q1, Version: 3.3.1, Package name: fftw-3.3.1, 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).


Required to run:
[devel/libf2c]

Required to build:
[lang/f2c] [devel/libtool-base] [devel/gmake]

Master sites: (Expand)

SHA1: 3fecc492f576503a6a509d2073bd82b3fe0aef13
RMD160: 86ef73f8f934d5f0e5d21f07fc05683f7b3c1d82
Filesize: 3945.301 KB

Version history: (Expand)