#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 malb):
Btw. the Travolta algorithm is also very simple and just avoids any
multiplications in the inner loop. It's complexity is O(n^2^*2^e^)
multiplications and O(n^3^) additions.
cf. https://bitbucket.org/malb/m4rie-
old/src/841a71d72e24/matrix.cc#cl-202
Btw. it takes 80 seconds for you to do 5,000 x 5,000 over GF(2^2^) and
GF(2^6^)? Can time MeatAxe again and post the two timings here?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8096#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.
