#8096: Speed up parent creation for multiplication of square matrices
---------------------------------+------------------------------------------
Reporter: boothby | Owner: boothby
Type: defect | Status: needs_review
Priority: minor | Milestone:
Component: linear algebra | Keywords:
Author: boothby, robertwb | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
---------------------------------+------------------------------------------
Changes (by newvalueoldvalue):
* author: => boothby, robertwb
Comment:
With the patch, I get:
{{{
sage: F = GF(3)
sage: A = random_matrix(F,3)
sage: B = random_matrix(F,3)
sage: %timeit C = A*B
625 loops, best of 3: 14.9 µs per loop # was: 99.6 µs
sage: A = random_matrix(F,2000)
sage: B = random_matrix(F,2000)
sage: %timeit C = A*B
5 loops, best of 3: 12.4 s per loop # was: 12.6 s
}}}
So, there is only a small improvement. But it ''is'' an improvement.
I currently do sage -testall. If it passes, I'll give it a positive
review, and suggest to open two new tickets, one concerning the overhead
in multiplying matrices, the other concerning the problem that
loads(dumps()) fails on big matrices.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8096#comment:10>
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.
