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

Carter Schonwald carter.schonwald at gmail.com
Wed Sep 5 22:18:20 CEST 2012


in the mean time I suggest using Hmatrix then :)

On Wed, Sep 5, 2012 at 4:10 PM, KC <kc1956 at gmail.com> wrote:

> The REPA package/library doesn't have LU factorization, eigenvalues, etc.
>
>
> On Wed, Sep 5, 2012 at 12:59 PM, Carter Schonwald
> <carter.schonwald at gmail.com> 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 <kc1956 at gmail.com> 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 at haskell.org
> >> http://www.haskell.org/mailman/listinfo/haskell-cafe
> >
> >
>
>
>
> --
> --
> Regards,
> KC
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20120905/f8434fa5/attachment.htm>


More information about the Haskell-Cafe mailing list