A New Look at Classical Algorithms for Polynomials Resultant and G.C.D. Calculation
- 1 April 1974
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 16 (2) , 193-206
- https://doi.org/10.1137/1016027
Abstract
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.Keywords
This publication has 20 references indexed in Scilit:
- New reductions of Hurwitz determinantsInternational Journal of Control, 1973
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- A New Formulation of the Theorems of Hurwitz, Routh and SturmIMA Journal of Applied Mathematics, 1971
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- A new formulation of the Liénard–Chipart stability criterionMathematical Proceedings of the Cambridge Philosophical Society, 1971
- Greatest common divisor of several polynomialsMathematical Proceedings of the Cambridge Philosophical Society, 1971
- Greatest common divisor of two polynomialsLinear Algebra and its Applications, 1970
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967
- Polynomial Remainder Sequences and DeterminantsThe American Mathematical Monthly, 1966
- A New Version of the Euclidean AlgorithThe American Mathematical Monthly, 1963