#18242: Added algorithm computing special resultants
-------------------------------------+-------------------------------------
Reporter: pernici | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.7
Component: number fields | Resolution:
Keywords: qqbar resultant | Merged in:
exactify minpoly | Reviewers:
Authors: | Work issues:
Report Upstream: N/A | Commit:
Branch: | e0626dcabde6434cedd0c8736df198065b7a01d6
u/pernici/ticket/18242 | Stopgaps:
Dependencies: #17886 |
-------------------------------------+-------------------------------------
Comment (by pernici):
Hello Vincent,
I opened #18356 implementing `composed_sum` and `composed_product` in
`polynomial_element.pyx`,
taking into account most of your comments.
"hadamard_exp" appears as a method raising an exception if the polynomial
is not on rationals.
I suspect that `newton_sum` method is not efficient, and it might be
somewhere else in
Sage. As long as it is called by `composed_sum`, the time spent in
`newton_sum` is negligible.
There is a small benchmark test, confirming the fact that the "BFSS"
algorithm is asymptotically faster.
I do not plan to look at the "BFSS" algorithm in any characteristics.
I do not think I will open another ticket before #18356 is merged, because
I do not know how to
manage tickets depending on other tickets, or how to add the dependence on
both #17886 and #18356.
--
Ticket URL: <http://trac.sagemath.org/ticket/18242#comment:13>
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.
