High probability analysis of the condition number of sparse polynomial systems (Q598221)
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: High probability analysis of the condition number of sparse polynomial systems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High probability analysis of the condition number of sparse polynomial systems |
scientific article |
Statements
High probability analysis of the condition number of sparse polynomial systems (English)
0 references
6 August 2004
0 references
The numerical conditioning of a sparse random polynomial system is analyzed. The obtained bound becomes in particular simple when the Newton polytopes and underlying variances are identical. For real polynomials, the expected number of real roots is expressed using Kähler geometry.
0 references
mixed volume
0 references
condition number
0 references
random polynomial system
0 references
Newton polytopes
0 references
real roots
0 references
Kähler geometry
0 references
0.94685566
0 references
0.89755696
0 references
0.87970257
0 references
0.8714264
0 references
0.86704093
0 references
0.8631666
0 references
0.8617305
0 references
0.8594533
0 references
