An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
From MaRDI portal
Publication:1930150
DOI10.1016/j.jsc.2011.12.015zbMath1255.13018OpenAlexW2113205422MaRDI QIDQ1930150
Yao Sun, Ding-Kang Wang, Deepak Kapur
Publication date: 10 January 2013
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.015
Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
An improvement of the rational representation for high-dimensional systems ⋮ A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving ⋮ Gröbner systems conversion ⋮ Computing comprehensive Gröbner systems: a comparison of two methods ⋮ An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ Resultant elimination via implicit equation interpolation ⋮ Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system ⋮ Algorithms for computing greatest common divisors of parametric multivariate polynomials ⋮ The Generalized Rabinowitsch Trick ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases ⋮ Parametric FGLM algorithm ⋮ A new algorithm for computing logarithmic vector fields along an isolated singularity and Bruce-Roberts Milnor ideals ⋮ Testing zero-dimensionality of varieties at a point ⋮ An algorithm for computing torsion differential forms associated with an isolated hypersurface singularity ⋮ Applying Gröbner basis method to multiparametric polynomial nonlinear programming ⋮ Generalized Integral Dependence Relations
Uses Software
