id summary reporter owner description type status priority milestone component resolution keywords cc merged author reviewer upstream work_issues branch commit dependencies stopgaps
16749 Speedup resultant of multivariate polynomials mmarco "Up to now we rely on singular to compute resultants of multivariate polynomials. There are faster ways.
Even computing the determinant of the sylvester matrix is usually (much) faster.
First i have implemented a trick for bivariate polynomials over the rationals (it could in principle work over any field with enough elements, but it is not clear that it is faster there). The trick consists on specialicing for several values of the surviving variable, compute the (univariate) resultant for them, and then reconstruct by lagrange interpolation.
It would also be worth to perform some benchmarks, and deduce a heuristic for the cases where the current method is beaten by the sylvester matrix determinant." enhancement needs_info major sage-6.4 algebra resultant, discriminant, polynomial, multivariate saraedum Miguel Marco N/A u/mmarco/ticket/16749 2ec35c2f20fb54ff648e253c79ac78a6cb76c05d