On Oct 17, 2012, at 3:35 AM, Justin Paston-Cooper paston.coo...@gmail.com
wrote:
Thanks for all the informative replies. SBV seems the simplest solution right
now, and speed isn't too much of an issue here. Anything under 20 seconds per
solution should be bearable.
I'm happy to announce the
Thanks for all the informative replies. SBV seems the simplest solution
right now, and speed isn't too much of an issue here. Anything under 20
seconds per solution should be bearable.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
For Linear integer equations, I think you want
http://hackage.haskell.org/packages/archive/agum/2.4/doc/html/Algebra-AbelianGroup-IntLinEq.html
The algorithm used to find solutions is described in Vol. 2 of The Art
of Computer Programming / Seminumerical Alorithms, 2nd Ed., 1981, by
Donald E.
Hello,
Can anyone suggest a library written in Haskell which can solve equations
of the form xM(transpose(x)) = y, where x should be an integer vector, M is
an integer matrix and y is an integer? I'm aware that Mathematica can do
this, but I would like something written in Haskell. I haven't been
Can anyone suggest a library written in Haskell which can solve equations of
the form xM(transpose(x)) = y, where x should be an integer vector, M is an
integer matrix and y is an integer? I'm aware that Mathematica can do this,
but I would like something written in Haskell. I haven't been
Justin Paston-Cooper paston.cooper at gmail.com writes:
Can anyone suggest a library written in Haskell which can solve equations
of the form xM(transpose(x)) = y, where x should be an integer vector,
M is an integer matrix and y is an integer?
when in doubt, use brute force:
write this
On Mon, Oct 15, 2012 at 9:00 AM, Johannes Waldmann
waldm...@imn.htwk-leipzig.de wrote:
Justin Paston-Cooper paston.cooper at gmail.com writes:
Can anyone suggest a library written in Haskell which can solve equations
of the form xM(transpose(x)) = y, where x should be an integer vector,
M is
