On the geometry of Graeffe iteration (Q5949383)

From MaRDI portal
Revision as of 20:26, 3 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1675702
Language Label Description Also known as
English
On the geometry of Graeffe iteration
scientific article; zbMATH DE number 1675702

    Statements

    On the geometry of Graeffe iteration (English)
    0 references
    0 references
    0 references
    29 September 2002
    0 references
    Let \(f\) be a univariate polynomial of degree \(d\). Its Graeffe iterate is defined by \[ Gf(x)=(-1)^d f(\sqrt{x}) f(-\sqrt{x}). \] Using a renormalized variant of Graeffe iteration, the authors design an algorithm which is globally convergent, with probability 1, for finding the absolute values of the roots of univariate complex polynomials.
    0 references
    polynomial root
    0 references
    univariate complex polynomial
    0 references
    renormalized Graeffe algorithm
    0 references
    global complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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