Matrix computation of subresultant polynomial remainder sequences in integral domains

We present an improved variant of the matrix-triangularization subresultant prs method 1] for the computation of a greatest common divisor of two polynomialsA andB (of degreesm andn, respectively) along with their polynomial remainder sequence. It is improved in the sense that we obtain complete theoretical results, independent of Van Vleck’s theorem 13] (which is not always true 2, 6]), and, instead of transforming a matrix of order 2·max(m, n) 1], we are now transforming a matrix of orderm+n. An example is also included to clarify the concepts.