Division-free computation of subresultants using Bezout matrices
From MaRDI portal
Publication:5850765
Recommendations
- Fast computation of the Bézout and Dixon resultant matrices
- Subresultant chains using Bézout matrices
- scientific article; zbMATH DE number 1263378
- Subresultants with the Bézout matrix
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
- Computation of determinants, adjoint matrices, and characteristic polynomials without division
- Bezout matrices, subresultant polynomials and parameters
- Matrix computation of subresultant polynomial remainder sequences in integral domains
- Computing the polynomial remainder sequence via Bézout matrices
- A simple division-free algorithm for computing determinants
Cites work
- A Method of Determining Explicitly the Coefficients of the Characteristic Equation
- Algorithms in real algebraic geometry
- Fast computation of the Bézout and Dixon resultant matrices
- Fast parallel matrix and GCD computations
- Matrix multiplication via arithmetic progressions
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- New structure theorem for subresultants
- On computing the determinant in small parallel time using a small number of processors
- Optimizations of the subresultant algorithm
- Subresultants revisited.
- Subresultants with the Bézout matrix
- Various new expressions for subresultants and their applications
Cited in
(6)- Subresultants with the Bézout matrix
- On the complexity of the Lickteig-Roy subresultant algorithm
- Symmetric subresultants and applications
- An algebraic approach to continuous collision detection for ellipsoids
- Bezout matrices, subresultant polynomials and parameters
- Subresultant chains using Bézout matrices
This page was built for publication: Division-free computation of subresultants using Bezout matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5850765)