[Haskell-cafe] Benchmark of DFT libraries in Haskell

[Ertugrul Söylemez]

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
computation.

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.


Greets,
Ertugrul

-- 
Key-ID: E5DD8D11 "Ertugrul Soeylemez <es at ertes.de>"
FPrint: BD28 3E3F BE63 BADD 4157  9134 D56A 37FA E5DD 8D11
Keysrv: hkp://subkeys.pgp.net/
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 836 bytes
Desc: not available
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20120806/2aad1884/attachment.pgp>