Haskell seems setup for iterative numerics; i.e. a standard example is Newton's method where lazy evaluation ...

separates control from computation. It seems as if Haskell would be better for iterative matrix methods rather than direct calculation. -- -- Regards, KC

Hello KC,
you should check out the Repa library then and see how it works for you.
Cheers
-Carter
On Wed, Sep 5, 2012 at 12:46 PM, KC
separates control from computation.
It seems as if Haskell would be better for iterative matrix methods rather than direct calculation.
-- -- Regards, KC
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

The REPA package/library doesn't have LU factorization, eigenvalues, etc.
On Wed, Sep 5, 2012 at 12:59 PM, Carter Schonwald
Hello KC, you should check out the Repa library then and see how it works for you. Cheers -Carter
On Wed, Sep 5, 2012 at 12:46 PM, KC
wrote: separates control from computation.
It seems as if Haskell would be better for iterative matrix methods rather than direct calculation.
-- -- Regards, KC
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
-- -- Regards, KC

in the mean time I suggest using Hmatrix then :)
On Wed, Sep 5, 2012 at 4:10 PM, KC
The REPA package/library doesn't have LU factorization, eigenvalues, etc.
On Wed, Sep 5, 2012 at 12:59 PM, Carter Schonwald
wrote: Hello KC, you should check out the Repa library then and see how it works for you. Cheers -Carter
On Wed, Sep 5, 2012 at 12:46 PM, KC
wrote: separates control from computation.
It seems as if Haskell would be better for iterative matrix methods rather than direct calculation.
-- -- Regards, KC
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
-- -- Regards, KC
participants (2)
-
Carter Schonwald
-
KC