A new algorithm for computing comprehensive Gröbner systems
From MaRDI portal
Recommendations
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- An efficient method for computing comprehensive Gröbner bases
- Comprehensive Gröbner bases
- A speed-up of the algorithm for computing comprehensive Gröbner systems
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
Cites work
- Differential algebra for derivations with nontrivial commutation rules
- Differential invariants of a Lie group action: syzygies on a generating set
- Differential invariants of conformal and projective surfaces
- Generating differential invariants
- Higher order contact of submanifolds of homogeneous spaces
- scientific article; zbMATH DE number 3762913 (Why is no real title available?)
- scientific article; zbMATH DE number 45257 (Why is no real title available?)
- scientific article; zbMATH DE number 3490133 (Why is no real title available?)
- scientific article; zbMATH DE number 2038305 (Why is no real title available?)
- scientific article; zbMATH DE number 2142844 (Why is no real title available?)
- scientific article; zbMATH DE number 3015982 (Why is no real title available?)
- scientific article; zbMATH DE number 802623 (Why is no real title available?)
- Invariants différentiels d'un pseudogroupe de Lie. I
- Invariants différentiels d'un pseudogroupe de Lie. II
- Moving coframes. II: Regularization and theoretical foundations
- Projective-type differential invariants and geometric curve evolutions of KdV-type in flat homogeneous manifolds
- Rational invariants of a group action. Construction and rewriting
- Smooth and algebraic invariants of a group action: Local and global constructions
Cited in
(43)- Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules
- Computing comprehensive Gröbner systems: a comparison of two methods
- Deterministic genericity for polynomial ideals
- Solving the perspective-three-point problem using comprehensive Gröbner systems
- Automated reducible geometric theorem proving and discovery by Gröbner basis method
- Characteristic decomposition: from regular sets to normal sets
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- A parametric approach to 3D dynamic geometry
- Generalizing the Steiner-Lehmus theorem using the Gröbner cover
- On multivariate Hermitian quadratic forms
- Solving parametric ideal membership problems and computing integral numbers in a ring of convergent power series via comprehensive Gröbner systems
- An implementation of the Lê-Teissier method for computing local Euler obstructions
- Applying Gröbner basis method to multiparametric polynomial nonlinear programming
- Generic regular decompositions for generic zero-dimensional systems
- Gröbner systems conversion
- Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
- Multistationarity in structured reaction networks
- Analyzing Boolean functions via solving parametric polynomial systems
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Computing the canonical representation of constructible sets
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Automatic deduction in (dynamic) geometry: Loci computation
- ICIAM/GAMM 95 Numerical Analysis, Scientific computing Computer ScienceICIAM/GAMM 95 Numerical Analysis, Scientific computing Computer Science
- Decomposition of polynomial sets into characteristic pairs
- Parametric FGLM algorithm
- Algebraic local cohomology with parameters and parametric standard bases for zero-dimensional ideals
- A speed-up of the algorithm for computing comprehensive Gröbner systems
- Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system
- Distance to the loss of structural properties for linear systems under parametric uncertainties
- A parametric \(\mathrm{F}_4\) algorithm
- Algebraic analysis of the structural properties of parametric linear time-invariant systems
- Improvement of an incremental signature-based comprehensive Gröbner system algorithm
- Algebraic design of physical computing system
- On the radical of a polynomial ideal with parameters
- Merging multiple algorithms for computing comprehensive Gröbner systems using parallel processing
- Comprehensive characteristic decomposition of parametric polynomial systems
- An algorithm for minimal generating set of parametric homogeneous polynomial ideals
- Efficient algorithm for computing inverse of parametric matrices
- A new iterative algorithm for comprehensive Gröbner systems
- Completing parametric unimodular rows to unimodular matrices
- On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems
This page was built for publication: A new algorithm for computing comprehensive Gröbner systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946517)
