An efficient free-division algorithm for computing polynomial subresultants using non-homogeneous Bezout matrix

MaRDI QIDQ6669112zbMATH OpenFDO

Authors 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)

zbMATH Keywords

free-division algorithmnon-homogeneous Bezout matrixSamuelson-Berkowitz algorithmsubresultants

Mathematics Subject Classification ID

Other constructive mathematics (03F65) Projective and free modules and ideals in commutative rings (13C10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Stability for projective modules (19A13)

Recommendations

• Two Variants of Bézout Subresultants for Several Univariate Polynomials
• scientific article; zbMATH DE number 908565
• scientific article; zbMATH DE number 3893345
• Hadamard matrices on error detection and correction: useful links to BIBD

Cites work

• Algorithms in real algebraic geometry
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
• scientific article; zbMATH DE number 7653032 (Why is no real title available?)
• Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
• New structure theorem for subresultants
• On binomial transform of the generalized reverse 3-primes sequence
• The binomial transforms of the generalized \((s,t)\)-Jacobsthal matrix sequence
• The GPGCD algorithm with the Bézout matrix
• Various new expressions for subresultants and their applications

Cited in

(1)

• Two Variants of Bézout Subresultants for Several Univariate Polynomials

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)