#18242: Added algorithm computing special resolvents
-----------------------+---------------------------------
Reporter: pernici | Type: enhancement
Status: new | Priority: major
Milestone: sage-6.7 | Component: number fields
Resolution: | Report Upstream: N/A
-----------------------+---------------------------------
We implemented the algorithm for computing the composed sum and
the composed product of univariate polynomials, presented in
A. Bostan, P. Flajolet, B. Salvy and E. Schost,
"Fast Computation of special resultants",
Journal of Symbolic Computation 41 (2006), 1-29
The composed sum algorithm is faster than using resolvents;
using it one of the bottleneck in computing minimal polynomials
is removed.
The composed product is comparable to using resolvents; they are
usually both fast.
--
Ticket URL: <http://trac.sagemath.org/ticket/18242>
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.
