#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 robertwb):
SimonKing: I'm impressed and depressed. Is MeatAxe's runtime a function of
the characteristic? At least one can do
{{{
sage: A = random_matrix(GF(3), 2000)
sage: B = random_matrix(GF(3), 2000)
sage: %timeit A._multiply_linbox(B)
5 loops, best of 3: 1.9 s per loop
}}}
but I agree the current state of matrices are in quite a bit of a mess.
Granted, most of this code was written *way* back before Sage had the
quality control it has now, just to get something up and running, and
hasn't been touched since. (They're pretty good over Z and Q, which is
what I use...)
Tom: Your patch looks good, positive review to that. I've posted another
patch which provides another 2x speedup. There's still a lot of cruft it
goes through, and matrix_space could really stand to be cythonized (there
are 3 mandatory Python calls on it every time a matrix is created), but I
don't have time to dig through it now.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8096#comment:8>
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.
