library for computing Fast Fourier Transforms
The FFTW library computes Fast Fourier Transforms (FFT) in one or more
dimensions. It is extremely fast. This package contains the shared library
versions of the fftw libraries in single, double and long double precisions.
Note that on some architectures double is the same as long double in which
case there is no long double library.
To get the static library and the header files, you need to install
libfftw3-dev. For documentation, see libfftw3-doc.
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
fftw3 for DEBIAN
Some of the changes made for version 3 of FFTW necessitated changes to the API,
so you will need to make (minor) changes when moving existing programs to this
version. See the documentation (in package fftw3-doc) for details.
In fftw2 separate packages included optimizations for SIMD
instructions. In fftw3 all such optimizations (x86 and powerpc) are
* Improve performance of some copy operations of complex arrays on
* Add configure flag to disable alloca(), which is broken in mingw64.
* Planning in FFTW_ESTIMATE mode for r2r transforms became slower
between fftw-3.1.3 and 3.2. This regression has now been fixed.
* Performance improvements for some multidimensional r2c/c2r transforms;
thanks to Eu
fftw3 (3.2.2-1) unstable; urgency=low
* New upstream release
* Acknowledge non-maintainer uploa
Sun Jul 12 06:34:46 EDT 2009 firstname.lastname@example.org
* Update NEWS, version number for 3.2.2 release.
This package was debianized by James A. Treacy email@example.com on
Tue, 22 Apr 2003 12:50:10 -0500
Browse inside libfftw3-3_3.2.2-1_amd64.deb
Results 1 - 1 of 1Search over 15 billion files
© 1997-2017 FileWatcher.com