I updated my PGFFT (Pretty Good FFT) library.
Details here: https://www.shoup.net/PGFFT/
It is now almost as fast or faster than FFTW on transforms up to 100K or so,
at least on AVX or AVX2 machines. I've posted some more timings.
If anyone is curious, the only reason I did this is that for anot
PGFFT is a "pretty good FFT" for double-precision complex numbers, written
in C++. It's main selling points are (1) it's not too slow, and (2) it's
available under a BSD license. Details here: https://www.shoup.net/PGFFT/
--
You received this message because you are subscribed to the Google G
