Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
type: Item
instance of: scholarly article
title: Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
zbMATH Open document ID: 1026.13010
author: Gema Maria Diaz Toca
author: Laureano Gonzalez-Vega
published in: Journal of Symbolic Computation
publication date: 2003-03-23T00:00:00Z
review text: The authors gives a new approach of Barnett's theorem on the computation of the degree of the gcd of several univariate polynomials over an integral domain. Definition. If \(P(x)\) and \(Q(x)\) are polynomials such that \(d= \max\{\deg(P), \deg(Q)\}\) then the Bezout matrix associated to \(P(x)\) and \(Q(x)\) is: \[ \text{Bez}(P,Q)= \begin{pmatrix} c_{0,0} &\cdots &c_{0,d-1}\\ \vdots &&\vdots\\ c_{d-1,0} &\cdots &c_{d-1,d-1} \end{pmatrix} \] where \(c_{i,j}\) are defined by the formula: \[ \frac {P(x)Q(y)- P(y)Q(x)} {x-y}= \sum_{i,j=0}^{d-1} c_{i,j} x^i y^j. \] In the authors' main result the degree of the polynomials \(P\), \(Q_1, \dots, Q_t\) is given by \(n-\text{rank} {\mathcal B}_P(Q_1, \dots,Q_t)\), where \[ {\mathcal B}_P= \begin{pmatrix} \text{Bez}(P,Q_1) \\ \vdots \\ \text{Bez}(P,Q_t)\end{pmatrix} . \] The authors deduce an algorithm for computing the coefficients of the greatest common divisor of \(P\), \(Q_1\), \dots, \(Q_t\). There are also obtained other approaches of Barnett's theorem through Hankel, respectively hybrid Bézout matrices. A final section includes a complexity analysis for the computation of the gcd of several univariate polynomials.
Mathematics Subject Classification ID: 13P05
Mathematics Subject Classification ID: 13F20
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1886742
zbMATH Keywords: Bezout matrices
zbMATH Keywords: computation of the greatest common divisor
reviewed by: Doru Ştefănescu
MaRDI profile type: MaRDI publication profile
full work available at URL: jsco.2002.0542
OpenAlex ID: W2071771712
cites work: Q5579582
cites work: Q5629775
cites work: Q3309525
cites work: Q4314299
cites work: Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions
cites work: An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
cites work: Simultaneous elimination by using several tools from real algebraic geometry
cites work: Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator
cites work: Algebraic methods for Toeplitz-like matrices and operators
cites work: Bézoutians
cites work: The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
cites work: Q4002529
cites work: Subresultants with the Bézout matrix
DOI: 10.1006/JSCO.2002.0542
Recommended article: Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
Recommended article: An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
Recommended article: Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
Recommended article: A proof of the main theorem on Bezoutians
Recommended article: Q4226974
description: scientific article; zbMATH DE number 1886742