Gröbner bases for polynomial systems with parameters
From MaRDI portal
Publication:607062
DOI10.1016/j.jsc.2010.06.017zbMath1207.13018OpenAlexW2163740240MaRDI QIDQ607062
Michael Wibmer, Antonio Montes
Publication date: 19 November 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.06.017
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 (32)
Gröbner systems conversion ⋮ First order perturbation and local stability of parametrized systems ⋮ Computing the canonical representation of constructible sets ⋮ Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules ⋮ Computing comprehensive Gröbner systems: a comparison of two methods ⋮ Computing envelopes in dynamic geometry environments ⋮ Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm ⋮ Deterministic genericity for polynomial ideals ⋮ Automatic deduction in (dynamic) geometry: Loci computation ⋮ Tensor product of evolution algebras ⋮ The geometrically nonlinear Cosserat micropolar shear–stretch energy. Part II: Non‐classical energy‐minimizing microrotations in 3D and their computational validation*** ⋮ On the computation of the Galois group of linear difference equations ⋮ Distance to the loss of structural properties for linear systems under parametric uncertainties ⋮ Automated reducible geometric theorem proving and discovery by Gröbner basis method ⋮ Contemporary Interpretation of a Historical Locus Problem with the Use of Computer Algebra ⋮ Revealing regions of multiple steady states in heterogeneous catalytic chemical reaction networks using Gröbner basis ⋮ A proposal for the automatic computation of envelopes of families of plane curves ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases ⋮ Some issues on the automatic computation of plane envelopes in interactive environments ⋮ A parametric approach to 3D dynamic geometry ⋮ Generalizing the Steiner-Lehmus theorem using the Gröbner cover ⋮ Foreword to special issue ⋮ Minimal polynomial systems for parametric matrices ⋮ Parametric FGLM algorithm ⋮ Joint model of probabilistic-robust (probust) constraints applied to gas network optimization ⋮ Invariant algebraic sets and symmetrization of polynomial systems ⋮ When is a polynomial ideal binomial after an ambient automorphism? ⋮ Erratum to ``A new algorithm for discussing Gröbner bases with parameters [J. Symbolic Comput. 33 (1-2) (2002) 183-208] ⋮ Exclusion regions for parameter-dependent systems of equations ⋮ Presentation of the book The Gröbner cover ⋮ An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties ⋮ A Singular web service for geometric computations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete algorithm for automated discovering of a class of inequality-type theorems
- Minimal canonical comprehensive Gröbner systems
- Gröbner bases and primary decomposition of polynomial ideals
- On an installation of Buchberger's algorithm
- Comprehensive Gröbner bases
- Direct methods for primary decomposition
- On Gröbner bases under specialization
- On the intrinsic complexity of elimination theory
- On the stability of Gröbner bases under specializations
- Algebraic solution of the load-flow problem for a 4-nodes electrical network
- A new algorithm for discussing Gröbner bases with parameters.
- An alternative approach to comprehensive Gröbner bases
- Canonical comprehensive Gröbner bases
- Dynamic evaluation and algebraic closure in Axiom
- Improving the DISPGB algorithm using the discriminant ideal
- Gröbner bases for families of affine or projective schemes
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Comprehensive Triangular Decomposition
- On the Computation of Elimination Ideals of Boolean Polynomial Rings
- Solving Polynomial Systems Using a Branch and Prune Approach
- ZERO DECOMPOSITION THEOREMS FOR COUNTING THE NUMBER OF SOLUTIONS FOR PARAMETRIC EQUATION SYSTEMS
- GROEBNER BASES FOR CONSTRUCTIBLE SETS
- Gröbner bases specialization through Hilbert functions
- Properties of Gröbner bases under specializations
- Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
- Computer Algebra in Scientific Computing
- Degree reduction under specialization
This page was built for publication: Gröbner bases for polynomial systems with parameters
