Performance of Buchberger's Improved Algorithm using Prime Based Ordering

Details Performance of Buchberger's Improved Algorithm using Prime Based Ordering Performance of Buchberger's Improved Algorithm using Prime Based Ordering

2009-01-28

arxiv.org/abs/0901.4404v1

Computer Science

Software Engineering

10 pages, 2 tables, 4 refs

Scientific paper

Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved algorithm for obtaining Groebner Bases have been developed: two total degree versions, representing power products as strings and the other two as integers based on prime-based ordering. The versions are further distinguished by implementing coefficients as 64-bit integers and as multiple-precision integers. By using primebased power product coding, iterative or recursive operations on power products are replaced with integer operations. It is found that on a series of example polynomial sets, significant reductions in computation time of 30% or more are almost always obtained.

Affiliated with

Also associated with

No associations

Rating

Performance of Buchberger's Improved Algorithm using Prime Based Ordering 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 Performance of Buchberger's Improved Algorithm using Prime Based Ordering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance of Buchberger's Improved Algorithm using Prime Based Ordering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-344470