Exploiting chordal structure in polynomial ideals: a Gröbner bases approach (Q2818203)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exploiting chordal structure in polynomial ideals: a Gröbner bases approach |
scientific article; zbMATH DE number 6624158
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting chordal structure in polynomial ideals: a Gröbner bases approach |
scientific article; zbMATH DE number 6624158 |
Statements
6 September 2016
0 references
chordal graph
0 references
elimination theory
0 references
Gröbner bases
0 references
structured polynomials
0 references
treewidth
0 references
0 references
0 references
0 references
0 references
0 references
0.9335167
0 references
0.8969286
0 references
0.89681125
0 references
0 references
0.8949076
0 references
0.89482033
0 references
Exploiting chordal structure in polynomial ideals: a Gröbner bases approach (English)
0 references
The paper contains a new elimination method for polynomial systems. The method is well suitable for systems with many equations and many variables, but there are only few variables in each equation. The idea is to use classical elimination (by Gröbner bases) for carefully chosen subsets of equations and variables in an iterative way. Algorithm 2 computes upper and lower bounds for elimination ideals. Theorem 3 gives sufficient conditions for these bounds being exact; hence in these cases, Algorithm 2 computes the precision ideals. Algorithm 3 computes a description of the ideal which has properties sumilar to a lexicographical Gröbner basis. In case of zero dimension, it is easy to compute all solutions when such a description is known.
0 references
