Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
From MaRDI portal
Publication:4652743
DOI10.1080/00207160412331284178zbMath1063.65020OpenAlexW1993897458MaRDI QIDQ4652743
Laureano Gonzalez-Vega, Jounaïdi Abdeljaoued, Gema Maria Diaz Toca
Publication date: 28 February 2005
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160412331284178
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Bezout matrices, subresultant polynomials and parameters ⋮ Parameterization of the discriminant set of a polynomial ⋮ Automatic computation of the complete root classification for a parametric polynomial ⋮ A new approach for constructing subresultants ⋮ Computing self-intersection curves of rational ruled surfaces ⋮ Changing views on curves and surfaces ⋮ Computing singular points of plane rational curves ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ Various new expressions for subresultants and their applications ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ Division-free computation of subresultants using Bezout matrices ⋮ Subresultant chains using Bézout matrices
Cites Work
- On computing the determinant in small parallel time using a small number of processors
- New structure theorem for subresultants
- Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
- 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
This page was built for publication: Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
