Changes between Version 6 and Version 16 of Ticket #18242


Ignore:
Timestamp:
01/18/16 19:58:38 (6 years ago)
Author:
vdelecroix
Comment:

To me, it would make more sense to use directly composed_op in #17886 and close this ticket as duplicate.

Legend:

Unmodified
Added
Removed
Modified

  • Ticket #18242

    • Property Milestone changed from sage-6.7 to sage-7.1
    • Property Summary changed from Added algorithm computing special resultants to Use composed_op for QQbar exactification
    • Property Commit changed from 99617e90a98946fb435481c39a9dbbf4afc1996a to e0626dcabde6434cedd0c8736df198065b7a01d6

  • Ticket #18242 – Description

    v6 v16  
    1   I implemented the algorithm for computing the composed sum and
    2   the composed product of univariate polynomials, presented in
     1In #18356, is implemented an algorithm for computing the composed sum, difference, product and division of two polynomials. That can be used to fasten exactification in QQbar.
    32
    4   A. Bostan, P. Flajolet, B. Salvy and E. Schost,
    5     "Fast Computation of special resultants",
    6     Journal of Symbolic Computation 41 (2006), 1-29
     3See also #17886.
    74
    8   The composed sum algorithm is faster than using the resultant method;
    9   using it one of the  bottleneck in computing minimal polynomials is removed.
    10 
    11   The composed product is comparable to using the resultant method; they are usually both fast.
     5---------------------------
     6From the older description
    127
    138Here is an example in which a fast algorithm for resultants makes a difference in timings: