Title of article
Fast computation of special resultants
Author/Authors
AlinBostan، نويسنده , , Philippe Flajolet، نويسنده , , Bruno Salvy، نويسنده , , EricSchost، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
29
From page
1
To page
29
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.
Keywords
Diamond product , Composed product , Composed sum , complexity , Tellegen’s principle
Journal title
Journal of Symbolic Computation
Serial Year
2006
Journal title
Journal of Symbolic Computation
Record number
805894
Link To Document