[Haskell-cafe] matrix computations based on the GSL
frederik at a5.repetae.net
Thu Mar 16 12:13:45 EST 2006
I'm sorry if this has been discussed before...
I'm reading your paper, at one point it says (re. the PCA example):
"Octave achieves the same result, slightly faster. (In this experiment
we have not used optimized BLAS libraries which can improve efficiency
of the GSL)"
That seems to imply that there is a way to use optimized BLAS
libraries? How can I do that?
Also, in my experiments (with matrix inversion) it seems,
subjectively, that Octave is about 5 or so times faster for operations
on large matrices. Presumably you've tested this as well, do you have
any comparison results?
More information about the Haskell-Cafe