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 another project, I needed a reasonable performant FFT with a permissive license (like BSD), and after spending a couple of weeks testing out various possibilities, I gave up, and just re-purposed NTL's "small prime" FFT (aka NTT) for complex numbers. So there it is :-) I'm sure if I look harder, I can find other libraries out there that are just as good or much better, also with a permissive license... -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/9d312ac9-e539-4c35-b45c-344f6d5df4b1%40googlegroups.com.
