Pages that link to "Item:Q1930150"
From MaRDI portal
The following pages link to An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system (Q1930150):
Displayed 16 items.
- Parametric FGLM algorithm (Q512366) (← links)
- A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving (Q1621120) (← links)
- Computing comprehensive Gröbner systems: a comparison of two methods (Q1650394) (← links)
- Resultant elimination via implicit equation interpolation (Q1691953) (← links)
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases (Q1730311) (← links)
- A new algorithm for computing logarithmic vector fields along an isolated singularity and Bruce-Roberts Milnor ideals (Q2029011) (← links)
- Testing zero-dimensionality of varieties at a point (Q2035627) (← links)
- An algorithm for computing torsion differential forms associated with an isolated hypersurface singularity (Q2035629) (← links)
- An improvement of the rational representation for high-dimensional systems (Q2121180) (← links)
- Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294) (← links)
- Applying Gröbner basis method to multiparametric polynomial nonlinear programming (Q2332342) (← links)
- Gröbner systems conversion (Q2364906) (← links)
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form (Q2674009) (← links)
- The Generalized Rabinowitsch Trick (Q4610007) (← links)
- Generalized Integral Dependence Relations (Q5014662) (← links)
- Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system (Q6139279) (← links)