[Haskell-cafe] Benchmark of DFT libraries in Haskell
es at ertes.de
Mon Aug 6 09:34:36 CEST 2012
Scott Michel <scooter.phd at gmail.com> wrote:
> I might be missing something in translation, but if I understand
> Takayuki's message's intent, everything needs to be calculated because
> the C-based FFTW library is called (eventually). Laziness doesn't
> really have an impact.
> The choice of underlying data structure and whether FFTW wisdom is
> used clearly has a significant impact.
If the Haskell wrapper library is a thick enough, lazy layer around
FFTW, the size of the result vector may not at all depend on any FFTW
Again, I have no experience at all with FFTW or any Haskell bindings to
it. This is just a general remark that is worth keeping in mind.
Key-ID: E5DD8D11 "Ertugrul Soeylemez <es at ertes.de>"
FPrint: BD28 3E3F BE63 BADD 4157 9134 D56A 37FA E5DD 8D11
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 836 bytes
Desc: not available
More information about the Haskell-Cafe