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

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

Branch: pkgsrc-2011Q2, Version: 3.2.1nb1, Package name: fftwf-3.2.1nb1, 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).

This package provides the single precision library.


Required to run:
[devel/libf2c]

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

Master sites: (Expand)

SHA1: 690a7cb4fb947a555eaf166cd098a43b61796723
RMD160: b8537c9a245638ea01bbac7ca56862844be674be
Filesize: 3394.574 KB

Version history: (Expand)