#8096: Speed up parent creation for multiplication of square matrices
---------------------------------------+------------------------------------
Reporter: boothby | Owner: boothby
Type: enhancement | Status: needs_info
Priority: minor | Milestone:
Component: linear algebra | Keywords:
Work_issues: various doc test errors | Upstream: N/A
Reviewer: | Author: boothby, robertwb
Merged: | Dependencies:
---------------------------------------+------------------------------------
Comment(by SimonKing):
Replying to [comment:21 jason]:
> Flint 2.20 (which is not in Sage yet, IIRC) apparently handles Z mod n
matrices. See section 19 of the manual:
http://www.flintlib.org/flint-2.2.pdf.
Yep, I was just reading the documentation.
They have matrices over Z/nZ, but I don't see finite fields mentioned.
Except prime fields, of course. They go up to `n=2^64-1`, which Meataxe
can't manage, even in the big implementation (the field size must be less
than `2^16`).
Concerning comparison of matrix operations, one must not forget higher
level operations. To compute the echelon form of a 5000x5000 matrix over
GF(5), the default implementation in Sage needs 12.65 s and 1.2 GB on my
machine. _echelonize_linbox needs the same.
Meataxe needs much less memory, but 45 seconds. Admittedly I did not care
about echelonization in meataxe, since I don't need it for my application.
Hm. That could be a show stopper.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8096#comment:22>
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.
