Bezout matrices, subresultant polynomials and parameters

DOI10.1016/j.amc.2009.04.032zbMath1209.12009OpenAlexW1971668114MaRDI QIDQ833155

Laureano Gonzalez-Vega, Gema Maria Diaz Toca, Jounaïdi Abdeljaoued

Publication date: 12 August 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.04.032

zbMATH Keywords

determinantssubresultant polynomialsBezout matricesSamuelson-Berkowitz algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)

Related Items

An algebraic framework for computing the topology of offsets to rational curves ⋮ Computational schemes for subresultant chains ⋮ Solving the implicitization, inversion and reparametrization problems for rational curves through subresultants ⋮ A new method to compute the singularities of offsets to rational plane curves ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ Subresultant chains using Bézout matrices

Cites Work

• A new approach for constructing subresultants
• An effective algorithm of computing symbolic determinants with multivariate polynomial entries
• Inertia characteristics of self-adjoint matrix polynomials
• Multipolynomial resultant algorithms
• Subresultants revisited.
• New structure theorem for subresultants
• Various new expressions for subresultants and their applications
• Improved algorithms for computing determinants and resultants
• Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
• Algorithms in real algebraic geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bezout matrices, subresultant polynomials and parameters