Mathematics and Natural Sciences
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.
Applicable Algebra in Engineering, Communication and Computing
Perry, J. E.
(2014). Reducing the Size and Number of Linear Programs in a Dynamic Gröbner Basis Algorithm. Applicable Algebra in Engineering, Communication and Computing, 25(1-2), 99-117.
Available at: https://aquila.usm.edu/fac_pubs/8049