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

@inproceedings{Li1997AMA,
  title={A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials},
  author={Ziming Li and Istv{\'a}n Nemes},
  booktitle={ISSAC},
  year={1997}
}
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. 
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…