[Numpy-discussion] Pruned / sparse FFT 2D
Mon Apr 15 06:00:03 CDT 2013
I have a sparse cloud of points of ~10^4 points randomly scattered around a
triangular domain  from which I want to take the Fourier transform. I
have been looking for algorithms and found one library, but only appears to
be for the 1-D case (and seems there is no documentation). In  there is
C code for the FFTW, but seems it code is itself pruned (pun intended).
Does anyone have a clue about how to perform it? Speed is not a big issue,
but accuracy is quite important.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the NumPy-Discussion