Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm

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. © 2014 Springer-Verlag Berlin Heidelberg