#18356: special resultants ``composed_sum`` and ``composed_product``
-------------------------------------+-------------------------------------
Reporter: pernici | Owner:
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-6.7
Component: algebra | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/pernici/ticket/18356 | 1fe9b052c8f1e49f9b0480f40dfa1937ef9f8dcf
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Replying to [comment:25 pernici]:
> I will try to implement `composed_op` in
`polynomial_rational_flint.pyx`; for the moment I have an
> implementation of `composed_mul`; for small polynomials (degree 2) it is
a few times faster than the resultant algorithm, 20x faster than the
previous implementation of the BFSS algorithm.
Did you have a look at #18420 that I already mentioned in [comment:23
comment:23]?! There is no need to implement your methods in
`polynomial_rational_flint.pyx`. Just use `_mul_trunc_` that is
implemented in #18420.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/18356#comment:26>
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/d/optout.
