Some lower bounds for the complexity of continuation methods (Q1279910)

From MaRDI portal
Revision as of 17:25, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Some lower bounds for the complexity of continuation methods
scientific article

    Statements

    Some lower bounds for the complexity of continuation methods (English)
    0 references
    0 references
    0 references
    17 August 1999
    0 references
    The authors consider the zero-finding problem for a homogeneous polynomial system. The main results are two lower bounds for the complexity of a Newton continuation method sequence.
    0 references
    homogeneous polynomial system
    0 references
    Newton continuation methods
    0 references
    complexity bounds
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references