scientific article; zbMATH DE number 1253996

zbMath0927.16043MaRDI QIDQ4226976

István Nemes, Ziming Li

Publication date: 2 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Ore polynomialssubresultantsgreatest common right divisorsEuclidean algorithmmodular algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Ordinary and skew polynomial rings and semigroup rings (16S36) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of associative rings (general theory) (16Z05) Divisibility, noncommutative UFDs (16U30)

Related Items (5)

Fraction-free row reduction of matrices of Ore polynomials. ⋮ Ore polynomial rings in one variable in computer algebra. ⋮ Output-sensitive modular algorithms for polynomial matrix normal forms ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ On Computing the Hermite Form of a Matrix of Differential Polynomials

Uses Software

• gfun

This page was built for publication: