Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10325482 | Journal of Symbolic Computation | 2010 | 35 Pages |
Abstract
Gröbner bases are the computational method par excellence for studying polynomial systems. In the case of parametric polynomial systems one has to determine the reduced Gröbner basis in dependence of the values of the parameters. In this article, we present the algorithm GröbnerCover which has as inputs a finite set of parametric polynomials, and outputs a finite partition of the parameter space into locally closed subsets together with polynomial data, from which the reduced Gröbner basis for a given parameter point can immediately be determined. The partition of the parameter space is intrinsic and particularly simple if the system is homogeneous.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Antonio Montes, Michael Wibmer,