Back to Search
Start Over
Gröbner bases for polynomial systems with parameters
- Source :
- Journal of Symbolic Computation. 45(12):1391-1425
- Publication Year :
- 2010
- Publisher :
- Elsevier BV, 2010.
-
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.
- Subjects :
- Polynomial
Algebra and Number Theory
Alternating polynomial
Gröbner cover
Comprehensive
Canonical
Matrix polynomial
Algebra
Gröbner basis
Computational Mathematics
Stable polynomial
Homogeneous polynomial
ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION
Parameters
Reduced
Locally closed sets
Applied mathematics
Degree of a polynomial
Monic polynomial
Mathematics
Subjects
Details
- ISSN :
- 07477171
- Volume :
- 45
- Issue :
- 12
- Database :
- OpenAIRE
- Journal :
- Journal of Symbolic Computation
- Accession number :
- edsair.doi.dedup.....7e2d714bab2335dfbed5f3c4a309a71a
- Full Text :
- https://doi.org/10.1016/j.jsc.2010.06.017