#15104: Special case modn_dense matrix operations to improve performance
-------------------------------------+-------------------------------------
Reporter: nbruin | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.2
Component: linear algebra | Resolution:
Keywords: | Merged in:
Authors: Nils Bruin | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/tscrim/ticket/15104 | b2d2f1baecf561520bbb4458d4856609546dbfe1
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by nbruin):
OK, staring at some profile information: it seems that in the transpose,
stack, and submatrix cases, virtually all time is spent in creating the
parent. It seems the `self.new_matrix` call is a much better way of
getting a new matrix. When I change that, the methods proposed here are
again considerably faster. Since new_matrix is such a generic routine
itself, I think it should be possible to further save overhead on that --
but clearly it's better than the explicit parent creation the code here
was using before.
--
Ticket URL: <http://trac.sagemath.org/ticket/15104#comment:7>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
