Fast Computation of Special Resultants

Abstract : We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multivariate resultants, that we compute using power sums of roots of polynomials, by means of their generating series.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00000960
Contributor : Bruno Salvy <>
Submitted on : Wednesday, April 12, 2006 - 11:53:19 AM
Last modification on : Wednesday, March 27, 2019 - 4:41:27 PM
Long-term archiving on : Monday, September 20, 2010 - 2:02:35 PM

Files

Identifiers

Collections

Citation

Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost. Fast Computation of Special Resultants. Journal of Symbolic Computation, Elsevier, 2006, Journal of Symbolic Computation, 41 (1), pp.1-29. ⟨10.1016/j.jsc.2005.07.001⟩. ⟨inria-00000960v2⟩

Share

Metrics

Record views

307

Files downloads

339