On 12/1/12 11:58 PM, Kim-Ee Yeoh wrote:
On Sun, Dec 2, 2012 at 10:52 AM, wren ng thornton w...@freegeek.org wrote:
My goal for all this is in setting up the type system, not performance.
I figure there are other folks who know and care a lot more about the
numerical tricks of giving the actual
Thanks to all for the feedback. As I investigate the structures for
organizing a library of sparse matrix representations a bit more and look
into the repa 3 library, I cant help but wonder if these spare matrix types
could just be additional instances of Source and Target in repa. Does anyone
Hi Mark
To continue with library I just wrote a quick recursive matrix
multiplication. Since you mentioned about Strassen's algorithm so I went to
wikipedia ( http://en.wikipedia.org/wiki/Strassen_algorithm ) and wrote the
recursive algorithm using 4 multiplication but it's not very hard to modify
Hello,
I started a FEM library, funfem [1], but I stopped it for the moment; Haskell
is my hobby and I work on FEM all day long, I prefer to focus on orthogonal
problems for home projects. It is a very naive implementation. Far from a
version 0.0.1 too, i.e. unusable at the moment.
I did not
Woops, forgot I switched to darcs after some time. The latest version can be
found here:
http://www.funfem.org/browser/Numeric/Funfem/Algebra
Adrien
On Sunday 02 December 2012 00:00:32 Adrien Haxaire wrote:
Hello,
I started a FEM library, funfem [1], but I stopped it for the moment;
On 11/30/12 4:58 PM, Mark Flamer wrote:
Thanks for all the replies,
It sounds like there is enough interest and even some potential
collaborators out there. I have created a few data structures to represent
sparse vectors and matrices. The vector was a simple binary tree and the
matrix a quad
On Sun, Dec 2, 2012 at 10:52 AM, wren ng thornton w...@freegeek.org wrote:
My goal for all this is in setting up the type system, not performance.
I figure there are other folks who know and care a lot more about the
numerical tricks of giving the actual implementations.
You've got my support
Hi Mark,
For my bachelor thesis I am doing something somewhat in that direction. I
am developing a Echo State Neural Networks (ESNs) (
http://minds.jacobs-university.de/esn_research) library in Haskell. I
haven't worked on it for a while, since I was reading related literature in
the last months.
Hi Mark
I can work on couple of algorithms if you have anything specific in mind.
May be first start with how to represent the matrix and then continue with
algorithms.
Mukesh Tiwari
On Fri, Nov 30, 2012 at 3:33 AM, Mark Flamer m...@flamerassoc.com wrote:
I am looking to continue to learn
Thanks for all the replies,
It sounds like there is enough interest and even some potential
collaborators out there. I have created a few data structures to represent
sparse vectors and matrices. The vector was a simple binary tree and the
matrix a quad tree. As I suspected a standard IntMap was
I look forward to see what comes of this!
On Fri, Nov 30, 2012 at 4:58 PM, Mark Flamer m...@flamerassoc.com wrote:
Thanks for all the replies,
It sounds like there is enough interest and even some potential
collaborators out there. I have created a few data structures to represent
sparse
I am looking to continue to learn Haskell while working on something that
might eventually be useful to others and get posted on Hackage. I have
written quite a bit of Haskell code now, some useful and a lot just throw
away for learning. In the past others have expressed interest in having a
Hi Mark,
I might become your user. Currently, for Agda I have rolled my own
sparse matrix implementation, see
http://hackage.haskell.org/packages/archive/Agda/latest/doc/html/src/Agda-Termination-SparseMatrix.html
Cheers,
Andreas
On 29.11.12 5:03 PM, Mark Flamer wrote:
I am looking to
13 matches
Mail list logo
