On Computing the Resultant of Generic Bivariate Polynomials - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

On Computing the Resultant of Generic Bivariate Polynomials

Gilles Villard

Abstract

An algorithm is presented for computing the resultant of two generic bivariate polynomials over a field K. For such p and q in K[x, y] both of degree d in x and n in y, the algorithm computes the resultant with respect to y using (n^(2−1/ω) d)^(1+o(1)) arithmetic operations in K, where two n × n matrices are multiplied using O (n^ω) operations. Previous algorithms required time (n^2 d)^(1+o(1)). The resultant is the determinant of the Sylvester matrix S (x) of p and q, which is an n × n Toeplitz-like polynomial matrix of degree d. We use a blocking technique and exploit the structure of S (x) for reducing the determinant computation to the computation of a matrix fraction description R(x)Q (x)^(−1) of an m ×m submatrix of the inverse S (x)^(−1) , where m ≪ n. We rely on fast algorithms for handling dense polynomial matrices: the fraction description is obtained from an x-adic expansion via matrix fraction reconstruction, and the resultant as the determinant of the denominator matrix. We also describe some extensions of the approach to the computation of generic Gröbner bases and of characteristic polynomials of generic structured matrices and in univariate quotient algebras.
Fichier principal
Vignette du fichier
hal.pdf (692.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01921369 , version 1 (13-11-2018)

Identifiers

  • HAL Id : hal-01921369 , version 1

Cite

Gilles Villard. On Computing the Resultant of Generic Bivariate Polynomials. ISSAC 2018, 43rd International Symposium on Symbolic and Algebraic Computation, New York, USA, July 16-19, 2018, Jul 2018, New York, United States. ⟨hal-01921369⟩
131 View
741 Download

Share

Gmail Facebook X LinkedIn More