High probability analysis of the condition number of sparse polynomial systems (Q598221): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2146491975 / rank
 
Normal rank

Revision as of 21:49, 19 March 2024

scientific article
Language Label Description Also known as
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references