Polynomial root finding by means of continuation (Q1377268)

From MaRDI portal
Revision as of 09:36, 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
Polynomial root finding by means of continuation
scientific article

    Statements

    Polynomial root finding by means of continuation (English)
    0 references
    0 references
    4 February 1998
    0 references
    The author deals with the problem of locating all zeros of a given polynomial \(p(x)\) and approximating them to any degree of precision: by combining classical iterative methods with homotopy path tracking techniques, the author introduces a new algorithm for polynomial root finding, proves its convergence and estimates its computational cost.
    0 references
    polynomial zeros
    0 references
    continuation
    0 references
    complexity
    0 references
    iterative methods
    0 references
    homotopy path tracking
    0 references
    algorithm
    0 references
    polynomial root finding
    0 references
    convergence
    0 references
    0 references

    Identifiers

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