Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor

DOI10.2307/2689124zbMath0187.30004OpenAlexW4237949527MaRDI QIDQ5579079

M. A. Laidacker

Publication date: 1969

Full work available at URL: https://doi.org/10.2307/2689124

zbMATH Keywords

linear algebra, forms

Related Items (7)

Exact symbolic-numeric computation of planar algebraic curves ⋮ Comparison of algorithms for calculation of g.c.d. of polynomials ⋮ Approximate polynomial GCD over integers ⋮ On the Relation Between Matrices and the Greatest Common Divisor of Polynomials ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ Greatest common divisors from generalized sylvester resultant matrices ⋮ A new method for computing polynomial greatest common divisors and polynomial remainder sequences

This page was built for publication: Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor