Title

Reducing the Size and Number of Linear Programs in a Dynamic Gröbner Basis Algorithm

Document Type

Article

Publication Date

4-2014

Department

Mathematics

Abstract

The goal of the Dynamic Buchberger Algorithm is to compute a Gröbner basis quickly by adjusting the term ordering as the computation proceeds. A known problem concerns the size and number of linear progams to be solved when refining the ordering. This paper describes two methods for reducing both their size and number.

Publication Title

Applicable Algebra in Engineering, Communication and Computing

Volume

25

Issue

1-2

First Page

99

Last Page

117