#13925: Tune rational echelon form code
----------------------------------+-----------------------------------------
Reporter: nbruin | Owner: jason, was
Type: defect | Status: new
Priority: major | Milestone: sage-5.6
Component: linear algebra | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by nbruin):
Note that lines 3841 and 3859 in `sage/matrix/matrix_integer_dense.pyx`
read:
{{{
p = previous_prime(rstate.c_random() % (MAX_MODULUS-15000)
+ 10000)
}}}
which is much more expensive than `p=previous_prime(p)`. Do we want to
incur such a high cost for getting "true" pseudo-randomness? These are big
primes. The probability that a real-world matrix leads to bad behaviour
for, say, 5 consecutive primes is really astronomically small.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13925#comment:2>
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.
