An Improvement of Rosenfeld-Groebner Algorithm

摘要

In their paper Boulier et al. (2009) described the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of polynomial differential equations, ordinary or with partial derivatives. In order to enhance the efficiency of this algorithm, they proposed their analog of Buchberger's criteria to avoid useless reductions to zero. For example, they showed that if p and q are two differential polynomials which are linear, homogeneous, in one differential indeterminate, with constant coefficients and with leaders θu and φu, respectively so that θ and φ are disjoint then the delta-polynomial of p and q reduces to zero w.r.t. the set {p, q}. In this paper we generalize this result showing that it remains true if p and q are products of differential polynomials which are linear, homogeneous, in the same differential indeterminate, with constant coefficients and θ and φ are disjoint where θu and φu are leaders of p and q, respectively. We have implemented the Rosenfeld-Groebner algorithm and our refined version on the same platform in MAPLE and compare them via a set of benchmarks.