#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 mraum):
I made this work; Only very few points had been overseen when squashing.
I changed the cutoff back to 100. Since William and I both think one
should do it properly or not at all, I thought it would be best to keep
the old cutoff. This had been 100. The biggest advantage from my
perspective is that the release manager will have to deal with one change
only (32 -> 64bit) and not with two, when investigating potential speed
regressions. Not that I found any, but there are more exotic architectures
than mine.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/4968#comment:32>
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.
