#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: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
------------------------------+---------------------------------------------
Comment(by SimonKing):
Replying to [comment:2 boothby]:
> ... As a reference, ` sage: A = GF(3).random_element() sage: B =
GF(3).random_element() sage: timeit("C = A*B") 625 loops, best of 3: ``142
ns`` per loop ` and with this patch, I'm getting: {{{ sage: d = 1 sage: A
= random_matrix(GF(3), d) sage: B = random_matrix(GF(3), d) sage:
timeit("C = A*B") 625 loops, best of 3: 32.5 µs per loop
But 32.5 µs (with the patch) is much ''slower ''than `142 ns (without the
patch)!`
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8096#comment:3>
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.
