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
On 17/05/2010, at 05:17, Gregory Crosswhite wrote:
As an aside, while there are advantages to writing numerical analysis
routines in Haskell, it might be better strategy to instead link in something
like LAPACK and provide nice wrappers to it in Haskell, since this way you
can harness
On 17/05/2010, at 02:52, Pierre-Etienne Meunier wrote:
You are quite right that vector only supports nested arrays but not
multidimensional ones. This is by design, however - the library's only goal
is to provide efficient one-dimensional, Int-indexed arrays. I'm thinking
about how to
there are advantages to writing numerical analysis
routines in Haskell, it might be better strategy to instead link in
something like LAPACK and provide nice wrappers to it in Haskell, since this
way you can harness the work of the experts who have spent a lot of time
perfecting their code rather than re
On 16/05/2010, at 10:17, Pierre-Etienne Meunier wrote:
I've also just noticed a lack in the vector library : multidimensional arrays
seem to require indirections like in caml, whereas in C or in Data.Ix, there
is a way to avoid this. This is especially important for avoiding cache
misses
You are quite right that vector only supports nested arrays but not
multidimensional ones. This is by design, however - the library's only goal
is to provide efficient one-dimensional, Int-indexed arrays. I'm thinking
about how to implement multidimensional arrays on top of vector but it's
there are advantages to writing numerical analysis routines
in Haskell, it might be better strategy to instead link in something like
LAPACK and provide nice wrappers to it in Haskell, since this way you can
harness the work of the experts who have spent a lot of time perfecting their
code rather than
Pierre-Etienne Meunier wrote:
I was also wondering about how to do linear algebra : an infinite
number of types would be needed to express all the constraints on
matrix multiplication : we need types such as array of size m * n.
Is there a way to generate these automatically
This is already
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
pierreetienne.meunier:
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
Perhaps you can look at the new array packages of the last few years:
* vector
An efficient implementation of Int-indexed arrays (both mutable and
immutable), with a powerful loop fusion optimization framework .
http://hackage.haskell.org/package/vector
*
pierreetienne.meunier:
Perhaps you can look at the new array packages of the last few years:
* vector
An efficient implementation of Int-indexed arrays (both mutable and
immutable), with a powerful loop fusion optimization framework .
I've also just noticed a lack in the vector library : multidimensional arrays
seem to require indirections like in caml, whereas in C or in Data.Ix, there is
a way to avoid this. This is especially important for avoiding cache misses
with many dimensions, as well as for providing a clean
Pierre-Etienne Meunier pierreetienne.meun...@gmail.com writes:
Indeed... Looks cool ! I suppose I'll have to rewrite a few things.
Do you know why they aren't (yet ?) integrated into the hierarchicals?
What do you mean by this? If you're asking why they're not the default,
it's because they're
On Fri, 13 Aug 1999, Rene Grognard wrote:
My question is therefore: is Haskell at all suitable for complex numerical
applications ?
_In my opinion_, Haskell is suitable for numerical programming if you
don't need performance close to C (because your problems are small say and
you're
15 matches
Mail list logo
