Using monodromy to decompose solution sets of polynomial systems into irreducible components (Q2754425)
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: Using monodromy to decompose solution sets of polynomial systems into irreducible components |
scientific article; zbMATH DE number 1671065
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using monodromy to decompose solution sets of polynomial systems into irreducible components |
scientific article; zbMATH DE number 1671065 |
Statements
23 August 2002
0 references
numerical examples
0 references
components of solutions
0 references
embedding
0 references
generic points
0 references
homotopy continuation
0 references
irreducible components
0 references
monodromy group
0 references
numerical algebraic geometry
0 references
polynomial system
0 references
primary decomposition
0 references
numerical conditioning
0 references
multivariate interpolation
0 references
Using monodromy to decompose solution sets of polynomial systems into irreducible components (English)
0 references
