Hi John,
Thanks for your answer.
On 04/04/2017 16:22, John Cremona wrote:
On 4 April 2017 at 15:02, Vincent Delecroix <20100.delecr...@gmail.com> wrote:
Dear all,
I am currently solving huge sparse linear systems over rationals (up to
millions of equations and variables). The equation are actually integral,
but the solutions are rationals.
Sage is doing pretty good up to dimension 1000 with the generic solve_right
method. Where should I look for libraries implementing somethig less naive?
The linear algebra in eclib has to deal with this sort of situation:
large sparse integer matrices (of Hecke operators) for which we need
the exact kernel, repeating until 1-dimensional and then lifting to a
unique (up to sign) primitive integer vector. The dimensions there
are not so large (up to 50,000 or so, so far). The linear algebra is
done modulo a prime a little less than 2^31, and the final vector
obtained may be checked exactly.
My situation is a bit different since my kernel is one dimensional by
construction (even if the system is overdetermined).
I do as much as possible preserving sparsity and eventually convert to
FLINT and use that.
>
>
There is no interface to this from within Sage.
Is there a plan to make one at some point? Or in PARI or anything else?
Vincent
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
