A New Look at Classical Algorithms for Polynomials Resultant and G.C.D. Calculation
Stephen Mark Barnett · SIAM Review · 1974
A neglected' classical scheme for finding the resultant or greatest common divisor of two polynomials is reexamined using matrix representations, and thereby developed into a potentially useful algorithm. For comparison purposes, some details of Euclidean algorithms are also given, but unlike these, the algorithm discussed does not produce a sequence of polynomial remainders. Furthermore, when the polynomials are taken over a unique factorization domain, the subsequent coefficient growth can be expected to be smaller. The methods are also discussed in relation to zero location theorems.