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

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

Branch: pkgsrc-2018Q3, Version: 3.3.6pl1nb1, Package name: fftwf-3.3.6pl1nb1, 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:
[lang/g95] [math/fftw]

Master sites:

SHA1: b7730928b6b420733a6fd08c18616bf8ae4f625d
RMD160: 9ea19d97852ad2eb97eea065d3145a2a5981e89b
Filesize: 4081.843 KB

Version history: (Expand)