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

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

Branch: pkgsrc-2014Q1, Version: 3.3.2nb2, Package name: fftwf-3.3.2nb2, 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:

Required to build:

Master sites: (Expand)

SHA1: 11a8c31186ff5a7d686a79a3f21b2530888e0dc2
RMD160: dbf87fcb7812024b80744335d433ade53bad8a4f
Filesize: 3816.679 KB

Version history: (Expand)