An efficient free-division algorithm for computing polynomial subresultants using non-homogeneous Bezout matrix
From MaRDI portal
Publication:6669112
Morou Amidou, Maimouna Salou, Moussa Tessa
Publication date: 22 January 2025
Published in: International Journal of Advances in Applied Mathematics and Mechanics (Search for Journal in Brave)
Projective and free modules and ideals in commutative rings (13C10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Other constructive mathematics (03F65) Stability for projective modules (19A13)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New structure theorem for subresultants
- Various new expressions for subresultants and their applications
- Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
- The GPGCD algorithm with the Bézout matrix
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- Algorithms in real algebraic geometry
This page was built for publication: An efficient free-division algorithm for computing polynomial subresultants using non-homogeneous Bezout matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6669112)
