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

Authors

Massimo Caboara, Università di PisaFollow
John Edward Perry III, University of Southern MississippiFollow

Document Type

Article

Publication Date

4-2014

Department

Mathematics

School

Mathematics and Natural Sciences

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.

Comments

Published by Applicable Algebra in Engineering, Communication and Computing. DOI: 10.1007/s00200-014-0216-5

Publication Title

Applicable Algebra in Engineering, Communication and Computing

Volume

25

Issue

1-2

First Page

99

Last Page

117

Recommended Citation

Caboara, M., 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