Generalized polynomial remainder sequences. (English) Zbl 0577.13001

Loos, R.

Computer algebra, symbolic and algebraic computation, Comput. Suppl. 4, 115-137 (1982).

Summary: [For the entire collection see Zbl 0491.00019.]
Given two polynomials over an integral domain, the problem is to compute their polynomial remainder sequence (p.r.s.) over the same domain. Following Habicht, we show how certain powers of leading coefficients enter systematically all following remainders. The key tool is the subresultant chain of two polynomials. We study the primitive, the reduced and the improved subresultant p.r.s. algorithm of Brown and Collins as basis for computing polynomial greatest common divisors, resultants or Sturm sequences. Habicht’s subresultant theorem allows new and simple proofs of many results and algorithms found in different ways in computer algebra.

MSC:

13-04	Software, source code, etc. for problems pertaining to commutative algebra
12-04	Software, source code, etc. for problems pertaining to field theory
13B25	Polynomials over commutative rings
13G05	Integral domains

Keywords:

polynomial greatest common divisors; resultants; Sturm sequences

Citations:

Zbl 0491.00019