#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:28 malb]:
> ... and Magma for comparison:
>
> GF(2^2^):
> ...
> Time: 2.130
That beats Meataxe by a factor of 12 :-(
> GF(2^6^):
> ...
> Time: 273.310
> It seems your MeatAxe fork is faster than Magma for GF(2^6^)?
Amazing! The Meataxe approach is very simple: Row-first storage of data,
as many field elements stored in one Byte as possible (hence, over
`GF(2^6)` we have two marks per byte), and multiplication tables that
allow to multiply a field element with a whole byte in one go.
The rest is school book or Strassen-Winograd multiplication.
Anyway. M4RIE seems to be a lot faster, and I am looking forward to use
it!
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8096#comment:30>
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.
