Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices

DOI10.1006/jsco.2002.0542zbMath1026.13010OpenAlexW2071771712MaRDI QIDQ1864875

Laureano Gonzalez-Vega, Gema Maria Diaz Toca

Publication date: 23 March 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2002.0542

zbMATH Keywords

Bezout matricescomputation of the greatest common divisor

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials, factorization in commutative rings (13P05)

Related Items (15)

Multigraded Sylvester forms, duality and elimination matrices ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ Complex Roots of Quaternion Polynomials ⋮ Using Smith normal forms and \(\mu\)-bases to compute all the singularities of rational planar curves ⋮ Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values ⋮ Root-finding by expansion with independent constraints ⋮ Recursive polynomial remainder sequence and its subresultants ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor ⋮ Various new expressions for subresultants and their applications ⋮ Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis ⋮ Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm ⋮ Blind image deconvolution through Bezoutians ⋮ Unnamed Item ⋮ Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic methods for Toeplitz-like matrices and operators
• Simultaneous elimination by using several tools from real algebraic geometry
• Bézoutians
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• 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
• Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions

This page was built for publication: Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices