#4968: implement fast linear algebra modulo n < 2^31
----------------------------------+-----------------------------------------
Reporter: malb | Owner: was
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-wishlist
Component: linear algebra | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: #10281 | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by malb):
Replying to [comment:20 mraum]:
> I don't think this code is about performance. The new code will only be
used in cases that were not available previously (see the cases treated in
matrix_int_dense). This is why I would like to separate this patch and the
optimization.
Sage can compute with larger primes it's just terribly slow, this patch
fixes that.
> Also, please keep in mind, that not only William is desperate for having
Sage use larger moduli (me certainly, John and his student recently posted
on sage-devel, and most likely many more).
Fair enough. I am not asking anyone to spend days and days improving the
performance, but I am asking those who care about this patch to spend 10
minutes to test various cutoff parameters so that we have a reasonable
default. If there are that many people who care about this, this should be
easy.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/4968#comment:21>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
