#10763: Speedup of matrix multiplication
------------------------------+---------------------------------------------
Reporter: SimonKing | Owner: jason, was
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.6.2
Component: linear algebra | Keywords: matrix multiplication
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
------------------------------+---------------------------------------------
When multiplying two matrices M and N, typically one first creates a zero
matrix of an appropriate matrix space. That means:
* Call `M.matrix_space(...)`.
* This calls `M.parent().matrix_space(...)`.
* This calls `MatrixSpace(...)`.
* This tests, whether the base ring really is a ring and whether the
matrix space is already in the cache.
This can obviously be improved:
* `M.matrix_space(...)` should avoid the overhead of calling `M.parent()`
but create the matrix space directly.
* It is already known that the base ring is a ring. So, there is no need
to test it.
* One may access the cache directly, thus, avoid the overhead of calling
`MatrixSpace`.
I guess the ticket belongs to linear algebra. Correct me if I'm wrong.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10763>
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.
