Sciweavers

JSC
2006
85views more  JSC 2006»
13 years 5 months ago
Fraction-free row reduction of matrices of Ore polynomials
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspa...
Bernhard Beckermann, Howard Cheng, George Labahn
ISSAC
1997
Springer
125views Mathematics» more  ISSAC 1997»
13 years 9 months ago
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 polyn...
Ziming Li, István Nemes
ISSAC
1998
Springer
111views Mathematics» more  ISSAC 1998»
13 years 9 months ago
A Subresultant Theory for Ore Polynomials with Applications
The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
Ziming Li