[Haskell-cafe] Numerical Analysis
Alberto G. Corona
agocorona at gmail.com
Wed May 19 08:18:01 EDT 2010
SAGE is the kind of thing that I dreamed to have available online a few
years ago.
To recode everithing in haskell perhaps does not worth the pain, but
perhapts it would be nice to do something similar to SAGE in an advanced
environment such is Google Wave, with all the collaborative facilities for
free.
Perhaps this would attract some developers. The utility of the whole thing
perhaps would incentivate the integration of existing haskell math software
and to translate/integrate foreign code.
Cheers
2010/5/16 Pierre-Etienne Meunier <pierreetienne.meunier at gmail.com>
> Hello Cafe,
>
> Being a complete beginner in the field of numerical analysis, but anyway
> needing it to solve "real problems", I wrote a few functions recently to
> solve systems of polynomial equations using the "projected polyhedron"
> method by Maekawa and Patrikakalis.
> This requires solving systems of linear equations precisely, thus the
> simple Gauss method was not enough, and I had to write also an algorithm for
> the "SVD decomposition".
>
> Upon discovering the algol / fortran specifications of these :-( , heavily
> published in important journals, I thought it would be nice to provide the
> world with fast reliable implementation of these numerical methods (i.e. not
> simply bindings to lapack). Moreover, writing numerical things in haskell is
> much more pleasant than I thought at first. Here are a few random thoughts
> on this :
>
> - The haskell 98 norm does not require enough about IEEE-754 compliance,
> thus C bindings are still needed to guess for instance the machine epsilons,
> or manipulating ULPs. Moreover, taking advantage of hardware rounding is not
> easy, even if the hardware is IEEE-compliant : calling a C function from
> haskell screws up the speed advantages of hardware rounding, for instance.
> Maybe the new LLVM backend will make this possible ?
>
> - The current Array library is definitely not adapted to production code.
> It makes debugging tricky, requires a heavy use of Debug.Trace to actually
> see what happens, and does not seem as fast as one could expect. It seems
> that each algebra library on hackage redefines part of it, but a unified
> version would be nice : a discussion within the haskell community seems to
> be needed...
>
> - A numerical analysis library should really take advantage of the
> parallelism in GHC, especially with the arrival of hardware such as fermi
> (anyway, I do not know how much haskell is compilable to fermi code). The
> love for loops and side-effects among this community is hard to understand,
> but that's more of a cultural problem.
>
> Finally, as stated by William Stein, the creator of SAGE, of course it
> would take thousands of man-years to rewrite these codes in python, but if a
> language like haskell, and a compiler do 90% of the work, how many man-years
> are left ?
>
> If anyone here has got the time, the team and the will to start such a
> project, I'd love to contribute !
>
> Cheers,
> PE
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20100519/2b025836/attachment.html
More information about the Haskell-Cafe
mailing list