#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 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.
Therefore the resultant algorithm will be taken away.
For large polynomials the implementation in
`polynomial_rational_flint.pyx`
is currently slow; the reason is that there is no `hadamard_product` for
polynomials in Flint,
and my implementation is very slow. I have to study something of Flint to
do better.
Once I fix this I expect that the two implementations of BFSS will be
equally fast for large polynomials.
--
Ticket URL: <http://trac.sagemath.org/ticket/18356#comment:25>
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.