Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ISSAC
1997
Springer

favoriteEmaildiscussreport

125views Mathematics» more ISSAC 1997»

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

13 years 9 months ago

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

Download www.mmrc.iss.ac.cn

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 coeﬃcients. The experimental results illustrate that the present algorithm is markedly superior to the Euclidean algorithm and the subresultant algorithm for Ore polynomials.

Ziming Li, István Nemes

Real-time Traffic

Algorithm | ISSAC 1997 | Mathematics | Ore Polynomials | Univariate Ore Polynomials |

claim paper

Related Content

» A Subresultant Theory for Ore Polynomials with Applications

» Algorithms for trigonometric polynomials

» A sparse modular GCD algorithm for polynomials over algebraic function fields

» Approximate GCDs of polynomials and sparse SOS relaxations

» Structured Low Rank Approximation of a Bezout Matrix

» Univariate Algebraic Kernel and Application to Arrangements

» A Solution to the Extended GCD Problem

» The approximate GCD of inexact polynomials

» Algorithms for the nonmonic case of the sparse modular GCD algorithm

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	ISSAC
Authors	Ziming Li, István Nemes

Comments (0)