Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
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.
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- A proof of the main theorem on Bezoutians
- scientific article; zbMATH DE number 1253994
- Algebraic methods for Toeplitz-like matrices and operators
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- Bézoutians
- scientific article; zbMATH DE number 3839766 (Why is no real title available?)
- scientific article; zbMATH DE number 52177 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 3296355 (Why is no real title available?)
- scientific article; zbMATH DE number 3355217 (Why is no real title available?)
- Simultaneous elimination by using several tools from real algebraic geometry
- Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions
- Subresultants with the Bézout matrix
- The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
- Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator
- Structured matrix methods computing the greatest common divisor of polynomials
- Various new expressions for subresultants and their applications
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- Multigraded Sylvester forms, duality and elimination matrices
- Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
- A proof of the main theorem on Bezoutians
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
- Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
- scientific article; zbMATH DE number 1253994 (Why is no real title available?)
- Using Smith normal forms and -bases to compute all the singularities of rational planar curves
- Complex roots of quaternion polynomials
- scientific article; zbMATH DE number 7047824 (Why is no real title available?)
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions
- Two Variants of Bézout Subresultants for Several Univariate Polynomials
- Root-finding by expansion with independent constraints
- Subresultants of several univariate polynomials in Newton basis
- An efficient free-division algorithm for computing polynomial subresultants using non-homogeneous Bezout matrix
- Computing the greatest common divisor of several parametric univariate polynomials via generalized subresultants
- Blind image deconvolution through Bezoutians
- Recursive polynomial remainder sequence and its subresultants
This page was built for publication: Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864875)
