On Euclid's Algorithm and the Theory of Subresultants

Abstract

This paper presents an elementary treatment of the theory of subresultants, and examines the relationship of the subresultants of a given pair of polynomials to their polynomial remainder sequence as determined by Euclid's algorithm. Two important versions of Euclid's algorithm are discussed. The results are essentially the same as those of Collins, but the presentation is briefer, simpler, and somewhat more general.

Stability of Time Discretization, Hurwitz Determinants and Order Stars

“…During the conference J. Garlo pointed out to the author that the algorithm (3-4), (3)(4)(5) and the theorem has been proved much earlier than in 15] by G. Fichera 5].…”

D-resultant and subresultants

“…For more details on subresultants theory we refer to [8,4,12,13,3,11,6], but the list is nowhere near exhaustive.…”

Zero-Equivalence in Function Fields Defined by Algebraic Differential Equations

“…If g is independent of y, or if x(g) ^ 0, then p(P) ± 0. 4. Otherwise substitute x = xo in g leaving y as an indeterminate.…”