Improving DISPGB Algorithm Using the Discriminant Ideal

Details Improving DISPGB Algorithm Using the Discriminant Ideal Improving DISPGB Algorithm Using the Discriminant Ideal

2006-01-31

arxiv.org/abs/math/0601763v1

Journal of Symbolic Computation 41 (2006) 1245-1263

Mathematics

Commutative Algebra

21 pages, see also http://www-ma2.upc.edu/~montes/

Scientific paper

10.1016/j.jsc.2005.09.013

In 1992, V. Weispfenning proved the existence of Comprehensive Groebner Bases (CGB) and gave an algorithm to compute one. That algorithm was not very efficient and not canonical. Using his suggestions, A. Montes obtained in 2002 a more efficient algorithm (DISPGB) for Discussing Parametric Groebner Bases. Inspired in its philosophy, V. Weispfenning defined, in 2002, how to obtain a Canonical Comprehensive Groebner Basis (CCGB) for parametric polynomial ideals, and provided a constructive method. In this paper we use Weispfenning's CCGB ideas to make substantial improvements on Montes DISPGB algorithm. It now includes rewriting of the discussion tree using the Discriminant Ideal and provides a compact and effective discussion. We also describe the new algorithms in the DPGB library containing the improved DISPGB as well as new routines to check whether a given basis is a CGB or not, and to obtain a CGB. Examples and tests are also provided.

Affiliated with

Also associated with

No associations

Rating

Improving DISPGB Algorithm Using the Discriminant Ideal 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 Improving DISPGB Algorithm Using the Discriminant Ideal, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving DISPGB Algorithm Using the Discriminant Ideal will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353872