FFTW FAQ - Section 5
Known bugs
This bug was fixed in FFTW 1.2. There was a bug in
rfftwnd
causing an incorrect amount of memory to be allocated. The bug showed
up in Linux with libc-5.3.12 (and nowhere else that we know of).
These bugs were corrected in FFTW 1.2.1. The MPI transforms (really,
just the transpose routines) in FFTW 1.2 had bugs that could cause
errors in some situations.
This bug was fixed in FFTW 1.3. (Older versions of FFTW did
work in single precision, but the test programs didn't--the error
tolerances in the tests were set for double precision.)
This bug was fixed in FFTW 1.3. FFTW 1.2.1 produced the right answer,
but the test program was wrong. For large n, n*n in the naive
transform that we used for comparison overflows 32 bit integer
precision, breaking the test.
We had problems with glibc-2.0.5. The code should work with
glibc-2.0.7.
This bug was fixed in FFTW 2.0.1. (There was a 32-bit integer
overflow due to a poorly-parenthesized expression.)
There was a bug in the complex transforms that could cause incorrect
results under (hopefully rare) circumstances for lengths with
intermediate-size prime factors (17-97). This bug was fixed in FFTW
2.1.1.
This bug was fixed in FFTW 2.1.2. The 2.1/2.1.1 MPI test programs
crashed when using the MPICH implementation of MPI with the
ch_p4
device (TCP/IP); the transforms themselves worked fine.
This bug was fixed in FFTW 2.1.3. The multi-threaded transforms in
previous versions didn't work with AIX's
pthreads
implementation, which idiosyncratically creates threads in detached
(non-joinable) mode by default.
This bug was fixed in FFTW 2.1.3. FFTW's complex-transform algorithm
for prime sizes (in versions 2.0 to 2.1.2) had an integer overflow
problem that caused incorrect results for many primes greater than
32768 (on 32-bit machines). (Sizes without large prime factors are
not affected.)
Back: Internals of FFTW.
Return to contents.
Matteo Frigo and Steven G. Johnson / fftw@fftw.org
- 07 November 1999
Extracted from FFTW Frequently Asked Questions with Answers,
Copyright © 1999 Massachusetts Institute of Technology.