{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $p(x) = a \\prod_{i=1}^n (x - x_i)$ be a polynomial of degree $n \\ge 1$ with [[complex|09FTAET5Z4]] coefficients and [[roots|019MA1VTR2]] $x_1, \\dots, x_n$.\n\n1. There is a unique polynomial $q$ with $q(x^2) = (-1)^n p(x) p(-x)$, and $q(y) = a^2 \\prod_{i=1}^n (y - x_i^2)$. So the roots of $q$ are the squares of the roots of $p$.\n2. Let $p_0 = p$, let $p_{k+1}$ be obtained from $p_k$ as in clause 1, and write $p_k(y) = \\sum_{j=0}^n b_j^{(k)} y^j$. Suppose that $\\abs{x_1} \u003e \\abs{x_2} \u003e \\cdots \u003e \\abs{x_n} \u003e 0$. Then for each $m = 1, \\dots, n$,\n$$\\abs{x_m} = \\lim_{k \\to \\infty} \\abs{\\frac{b_{n-m}^{(k)}}{b_{n-m+1}^{(k)}}}^{1/2^k}.$$\n\n## Remarks\n\nClause 1: $p(-x) = a \\prod_i (-x - x_i) = (-1)^n a \\prod_i (x + x_i)$, so $(-1)^n p(x) p(-x) = a^2 \\prod_i (x^2 - x_i^2)$.\nClause 2: the roots of $p_k$ are $y_i = x_i^{2^k}$, and their moduli separate very fast.\nBy the relations between roots and coefficients, $b_{n-m}^{(k)} / b_{n-m+1}^{(k)}$ is a ratio of elementary symmetric functions of the $y_i$, and the ratio is dominated by $-y_m$ as $k \\to \\infty$.\nFor example, $p(x) = x^2 - 3x + 2$ has roots $2$ and $1$, and one step gives $q(y) = y^2 - 5y + 4$, with roots $4$ and $1$.\nThe hypothesis of distinct moduli is needed for clause 2.\nFor $p(x) = x^3 - 1$ the three roots have modulus $1$, but every $p_k$ equals $y^3 - 1$, so $b_2^{(k)} / b_3^{(k)} = 0$ and the formula gives $0$ instead of $1$ for $m = 1$.\nThe method gives only the moduli of the roots; the signs or arguments need extra work.\n\n## Explanations\n\n### L1 human\n\nSquaring numbers that differ in size makes the gap between them much larger.\nGraeffe's method repeatedly replaces a polynomial by one whose roots are the squares of the old roots.\nAfter a few rounds one root dominates each coefficient ratio, and the sizes of the roots can be read off directly from the coefficients.\n\n### L2 human\n\nEach squaring step costs about $n^2$ operations and needs no starting guess.\nThe coefficients grow or shrink very fast, so a practical version must work with scaled numbers or logarithms.\nThe squaring step, also called the Dandelin–Graeffe step, reappears in modern root finders, for example to estimate root moduli in the splitting circle method.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "about": [
      "019MA1VTR2"
    ],
    "kind": "statement",
    "msc": [
      "65H04"
    ],
    "name": "Graeffe's method",
    "role": "theorem",
    "same_as": {
      "wikidata": "Q5592179",
      "wikipedia": "Graeffe's method"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Graeffe%27s_method"
      }
    ],
    "tag": "RHPQG175AH",
    "uses": [
      "019MA1VTR2",
      "09FTAET5Z4"
    ]
  },
  "kind": "statement",
  "link": "https://tamnd.github.io/math2/node/RHPQG175AH/",
  "links": [
    {
      "field": "about",
      "target": "019MA1VTR2"
    },
    {
      "field": "uses",
      "target": "019MA1VTR2"
    },
    {
      "field": "uses",
      "target": "09FTAET5Z4"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/RHPQG175AH.md",
  "msc": [
    "65H04"
  ],
  "name": "Graeffe's method",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/RHP/RHPQG175AH.md",
  "status": null,
  "tag": "RHPQG175AH",
  "uri": "m2://RHPQG175AH",
  "url": "https://tamnd.github.io/math2/wiki/graeffes-method/",
  "writing": {
    "tag": "RHPQG175AH",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}