Problem section (rotating fluids)

ABSTMCT It is well known that the computation of lexicographic Grobner bases using Buchberger's algorithm is more difficult than the computation of Gr6bner bases with respect to totat degree orderings. The lexicographic algorithm is particularly susceptible to the problem of intermediate expression swell; that is, intermediate polynomials may be far larger than those which make up the final basis. To some extent, this is a function of "selection strategy", i.e. the order in which S-polynomials are used to extend a partial basis. We argue and provide empirical evidence thatj_or thelexicographic ordering (in direct contrast to the case of degree orderings), a simple heuristic strategy will in practice control intermediate growth more effectively than the normal strategy based on the lexicographic term ordering alone. The result is usually a much more efficient computation, even for ideals of nonzero dimension (where lexicographic basesare uniquely well suited to solving the corresponding algebraic systemsof equations).

show abstract

Problem section (rotating fluids)

Cited by 5 publications

References 3 publications

Solving zero-dimensional involutive systems

Solving zero-dimensional involutive systems

Complexity of solving parametric polynomial systems

A heuristic selection strategy for lexicographic Gröner bases?

Contact Info

Product

Resources

About