On Thu, Nov 14, 2013 at 5:30 PM, Max Linke <max_li...@gmx.de> wrote: > You can check everything in the notebook, it will generate all the data. > I checked the runtime for sizes in logspace(2, 7, 25). I know that the > fft will work faster for array sizes that are a power of 2 but > differences on 3 orders of magnitude is huge.
This is expected if you go from N log N to N ** 2 for large N :) You can for example compare np.fft.fft(a) for 2**16 and 2**16+1 (and 2**16-1 that while bad is not prime, so only 1 order of magnitude slower). David
_______________________________________________ NumPy-Discussion mailing list NumPy-Discussion@scipy.org http://mail.scipy.org/mailman/listinfo/numpy-discussion
