What is the complexity of your implementation

jakevdp / nfft

Lightweight non-uniform Fast Fourier Transform in Python

MIT License

201 stars 29 forks source link

What is the complexity of your implementation #3

Closed certik closed 7 years ago

certik commented 7 years ago

Very nice package! I was wondering what the complexity is if your particular implementation. The 1D FFT is O(N*log(N)), I assume your algorithm depends on N, M and the accuracy eps. You can put this information in the README, I think it would be very useful to readers.

jakevdp commented 7 years ago

Great idea – I just added this to the README.

certik commented 7 years ago

Thanks @jakevdp for clarifying it.