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

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

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

Master sites:

SHA1: 2ae980a8d44c161ce4a09c6e2d1c79243ecbabb2
RMD160: 6fb90ce7190190998ff4c579934b76de270db271
Filesize: 4009.577 KB

Version history: (Expand)