Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions
Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions
Solving zero-dimensional polynomial systems using Gröbner bases is usually done by, first, computing a Gröbner basis for the degree reverse lexicographic order, and next computing the lexicographic Gröbner basis with a change of order algorithm. Currently, the change of order now takes a significant part of the whole solving time …