Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator

DOI10.1109/TC.1978.1674974zbMath0398.68012OpenAlexW2078956857MaRDI QIDQ4181955

Martin L. Griss

Publication date: 1978

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1978.1674974

zbMATH Keywords

Sparse MatricesEfficient Sparse Minor Expansion AlgorithmGreatest Common DenominatorPolynomial SubresultantsSparse Polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (4)

Simplification of a multidimensional digital filter stability test ⋮ Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor ⋮ Various new expressions for subresultants and their applications ⋮ Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices

This page was built for publication: Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator