Division-free computation of subresultants using Bezout matrices
From MaRDI portal
Publication:5850765
DOI10.1080/00207160802460595zbMath1207.12006OpenAlexW2004547522MaRDI QIDQ5850765
Publication date: 15 January 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160802460595
Related Items
On the complexity of the Lickteig-Roy subresultant algorithm, An algebraic approach to continuous collision detection for ellipsoids, Subresultant chains using Bézout matrices
Cites Work
- Unnamed Item
- On computing the determinant in small parallel time using a small number of processors
- Matrix multiplication via arithmetic progressions
- Subresultants revisited.
- New structure theorem for subresultants
- Fast computation of the Bézout and Dixon resultant matrices
- Various new expressions for subresultants and their applications
- Optimizations of the subresultant algorithm
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- Fast parallel matrix and GCD computations
- A Method of Determining Explicitly the Coefficients of the Characteristic Equation
- Algorithms in real algebraic geometry
