ZERO DECOMPOSITION THEOREMS FOR COUNTING THE NUMBER OF SOLUTIONS FOR PARAMETRIC EQUATION SYSTEMS (Q4445012)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2034386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ZERO DECOMPOSITION THEOREMS FOR COUNTING THE NUMBER OF SOLUTIONS FOR PARAMETRIC EQUATION SYSTEMS |
scientific article; zbMATH DE number 2034386 |
Statements
ZERO DECOMPOSITION THEOREMS FOR COUNTING THE NUMBER OF SOLUTIONS FOR PARAMETRIC EQUATION SYSTEMS (English)
0 references
28 January 2004
0 references
Parametric equation system
0 references
number of solutions
0 references
characteristic set method
0 references
triangularization
0 references
zero decomposition theorem
0 references
0.744239091873169
0 references
0.7439438700675964
0 references
0.7319658398628235
0 references
0.7215148210525513
0 references
Reducing a set of equations in general form to triangular form is a basic idea in equation solving. In this paper, we show how to recover the information about the number of solutions for parametric equation systems by introducing two new forms of triangularization techniques: the decomposition tree and the refined cover. The decomposition tree can be used to compute the maximal number of solutions for the parametric equation system. The refined cover gives a complete classification of the number of solutions for the parametric equation system. That is, we decompose the value space for the parameters into disjoint components. On each component, the equation system has a fixed number of solutions. For the entire collection see [Zbl 1062.68006].
0 references
