On the geometry of Graeffe iteration (Q5949383)

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.