Parametric FGLM algorithm
From MaRDI portal
Publication:512366
DOI10.1016/j.jsc.2016.12.006zbMath1359.13030OpenAlexW2569175270MaRDI QIDQ512366
Amir Hashemi, Mahdi Dehghani Darmian
Publication date: 24 February 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2016.12.006
Gröbner basescomprehensive Gröbner systemcomprehensive Gröbner system conversionFGLM algorithmparametric FGLM algorithmparametric linear algebra
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects in algebraic geometry (14Q99)
Related Items
Gröbner systems conversion ⋮ Homogeneous surfaces in \(\mathbb{C}^4\) associated with a 5-dimensional completely nondegenerate cubic model surface of CR-type \((1,3)\) ⋮ Testing binomiality of chemical reaction networks using comprehensive Gröbner systems ⋮ PLA-PFGLM.mpl ⋮ Applying Gröbner basis method to multiparametric polynomial nonlinear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases for polynomial systems with parameters
- Hilbert functions and the Buchberger algorithm
- Erratum to ``A new algorithm for discussing Gröbner bases with parameters [J. Symbolic Comput. 33 (1-2) (2002) 183-208]
- On the construction of Gröbner bases using syzygies
- Minimal canonical comprehensive Gröbner systems
- On an installation of Buchberger's algorithm
- An algorithm for solving parametric linear systems
- Comprehensive Gröbner bases
- Standard bases, critical tropisms and flatness
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Converting bases with the Gröbner walk
- A new algorithm for discussing Gröbner bases with parameters.
- Sparse FGLM algorithms
- Canonical comprehensive Gröbner bases
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- An efficient method for computing comprehensive Gröbner bases
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Improving the DISPGB algorithm using the discriminant ideal
- The generic Gröbner walk
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- A Package for Parametric Matrix Computations
- A new algorithm for computing comprehensive Gröbner systems
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Gröbner Bases, Coding, and Cryptography
- Lifting standard bases in filtered structures
- Using Algebraic Geometry
- Solving the load flow problem using Gröbner basis
- Minimal polynomial systems for parametric matrices
- Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously
- Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
