fftw-2.1.5p4
C routines for computing the Discrete Fourier Transform
Back to search · Project homepage
Description
FFTW is a free collection of fast C routines for computing the
Discrete Fourier Transform in one or more dimensions. It includes
complex, real, and parallel transforms, and can handle arbitrary
array sizes efficiently. FFTW is typically faster than other
publicly-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).
Package information
- Ports path
- math/fftw
- Package architecture
- amd64
- Maintainer
- The OpenBSD ports mailing-list <ports@openbsd.org>
- Categories
- math
- Available flavors
- None listed
These are ports metadata. Binary availability depends on the release, architecture and mirror. Build and test dependencies are not an installation checklist.
Direct dependencies
None listed in sqlports.
Used by (2 dependency relationships)
Includes library, runtime, build and test relationships. Results load 100 at a time.