id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
10763,Speedup of matrix multiplication,SimonKing,jason was,"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.
",enhancement,closed,major,sage-4.7,linear algebra,fixed,matrix multiplication,,sage-4.7.alpha2,Simon King,Rob Beezer,N/A,,,,,