[Numpy-discussion] Fast sizes for FFT

Sturla Molden sturla.molden at gmail.com
Wed Dec 24 07:52:09 EST 2014

On 24/12/14 13:23, Julian Taylor wrote:

> hm this is a brute force search, probably fast enough but slower than
> scipy's code (if it also were cython)

That was what I tought as well when I wrote it. But it turned out that 
regular numbers are so close and abundant that was damn fast, even in 
Python :)

> I also ported it to C a while back, so that could be used for numpy if
> speed is an issue. Code attached.

Very nice :)


More information about the NumPy-Discussion mailing list