A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials

Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polynomials are used to compute the evaluation homomorphic images of the gcrd. Rational number and rational function reconstructions are used to recover coefficients. The experimental results illustrate that the present algorithm is markedly superior to the Euclidean algorithm and the subresultant algorithm for Ore polynomials.

• Type: Conference
• Year: 1997
• Where: ISSAC
• Authors: Ziming Li, István Nemes
• Keywords: Algorithm, ISSAC 1997, Mathematics, Ore Polynomials, Univariate Ore Polynomials