Various new expressions for subresultants and their applications
From MaRDI portal
Publication:1762553
DOI10.1007/s00200-004-0158-4zbMath1073.15007OpenAlexW2009011215MaRDI QIDQ1762553
Laureano Gonzalez-Vega, Gema Maria Diaz Toca
Publication date: 9 February 2005
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-004-0158-4
Related Items (11)
Bezout matrices, subresultant polynomials and parameters ⋮ Parameterization of the discriminant set of a polynomial ⋮ Multivariate subresultants in roots ⋮ Number of common roots and resultant of two tropical univariate polynomials ⋮ Birational properties of the gap subresultant varieties ⋮ Computing the intersection of two ruled surfaces by using a new algebraic approach ⋮ An elementary proof of Sylvester's double sums for subresultants ⋮ Closed formula for univariate subresultants in multiple roots ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subresultants under composition
- Double Sylvester sums for subresultants and multi-Schur functions.
- An elementary approach to subresultants theory.
- Subresultants revisited.
- New structure theorem for subresultants
- Inversion of confluent Vandermonde matrices
- Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- Spécialisation de la suite de Sturm et sous-résultants (I)
- Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Theory of Subresultants
This page was built for publication: Various new expressions for subresultants and their applications