#19751: Implement a generic multiplication method for dense matrices
-------------------------------------+-------------------------------------
Reporter: mmezzarobba | Owner:
Type: defect | Status: needs_review
Priority: minor | Milestone: sage-7.0
Component: linear algebra | Resolution:
Keywords: | Merged in:
Authors: Marc Mezzarobba | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/mmezzarobba/genmatmult | 3d9d8ff7fb8c4533ab0b60a00d5b079349e5720b
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by mmezzarobba):
Replying to [comment:19 vdelecroix]:
> Replying to [comment:14 jdemeyer]:
> > `x._mul_(y)` is faster '''if Cython knows''' that `x` and `y` are of
type `RingElement`. Otherwise, `x * y` is faster.
>
> Then why not `(<RingElement> x)._mul_(<RingElement> y)`? The the
overhead might be negligible.
Well, I guess that's the other option Jeroen had in mind when he said he
would just use `+`/`*`, and I honestly don't care much. That's just a
fallback method that will essentially never be called.
--
Ticket URL: <http://trac.sagemath.org/ticket/19751#comment:20>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
