A Variant of Gerdt's Algorithm for Computing Involutive Bases

Details A Variant of Gerdt's Algorithm for Computing Involutive Bases A Variant of Gerdt's Algorithm for Computing Involutive Bases

2011-08-16

arxiv.org/abs/1108.3261v1

Mathematics

Rings and Algebras

13 pages

Scientific paper

Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove correctness and termination of the modified algorithm and also correctness of the used criteria. The proposed algorithm has been implemented in Maple. We present experimental comparison, via some examples, of performance of the modified algorithm with its original form which has been implemented in Maple too. In doing so, we have taken care to provide uniform implementation details for the both algorithms.

Affiliated with

Also associated with

No associations

Rating

A Variant of Gerdt's Algorithm for Computing Involutive Bases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Variant of Gerdt's Algorithm for Computing Involutive Bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Variant of Gerdt's Algorithm for Computing Involutive Bases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-196213