{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "VM1C9D8MX9"
    }
  ],
  "body": "\n## Statement\n\nLet $a \u003c b$ be real numbers and let $f \\colon [a, b] \\to \\R$ be a [[continuous function|0X3WGX95FE]] with $f(a) f(b) \u003c 0$.\nThe *regula falsi* (method of false position) sets $a_0 = a$, $b_0 = b$, and for $k \\ge 0$ lets\n$$c_k = \\frac{a_k f(b_k) - b_k f(a_k)}{f(b_k) - f(a_k)},$$\nthe zero of the chord through $(a_k, f(a_k))$ and $(b_k, f(b_k))$.\nIf $f(c_k) = 0$ it stops; if $f(a_k) f(c_k) \u003c 0$ it sets $(a_{k+1}, b_{k+1}) = (a_k, c_k)$; otherwise it sets $(a_{k+1}, b_{k+1}) = (c_k, b_k)$.\n\n1. As long as the method runs, $a_k \u003c c_k \u003c b_k$ and $f(a_k) f(b_k) \u003c 0$, so each $[a_k, b_k]$ contains a zero of $f$.\n2. Assume moreover that $f$ is [[twice continuously differentiable|0VW90BBSJ4]] on $[a, b]$ with [[second derivative|0Q4QJWEHW3]] $f'' \u003e 0$, and $f(a) \u003c 0 \u003c f(b)$. Then $f$ has exactly one zero $r$ in $(a, b)$, $b_k = b$ for all $k$, the sequence $(c_k)$ increases strictly to $r$, and\n$$\\lim_{k \\to \\infty} \\frac{r - c_{k+1}}{r - c_k} = 1 - \\frac{f'(r)(b - r)}{f(b)} \\in (0, 1).$$\n\n## Remarks\n\nClause 1: the chord has values of opposite signs at $a_k$ and $b_k$, so its zero $c_k$ lies strictly between them.\nThe update keeps a sign change, and the [[intermediate value theorem|00KAFBR32E]] gives a zero in each bracket.\nClause 2: by convexity the chord lies above the graph, so $f(c_k) \u003c 0$ and $c_k$ always replaces the left endpoint.\nThen $c_{k+1} = g(c_k)$ with $g(x) = x - f(x)(b - x)/(f(b) - f(x))$.\nThe increasing bounded sequence $(c_k)$ has a limit, which is a fixed point of $g$, hence $r$, and the error ratio tends to $g'(r)$.\nSo under the hypotheses of clause 2 the method converges only linearly, see [[rate of convergence|YWZQC5E54B]], and the bracket width $b - c_k$ does not tend to $0$.\nExample: for $f(x) = x^2 - 2$ on $[1, 2]$, $c_0 = 4/3$, $c_1 = 7/5$, $c_2 = 24/17 \\approx 1.41176$, increasing to $\\sqrt{2}$ with $b = 2$ fixed, and the limit ratio is $1 - 2\\sqrt{2}(2 - \\sqrt{2})/2 = 3 - 2\\sqrt{2} \\approx 0.17$.\nThe other cases of fixed sign of $f''$ and of $f(a)$ follow by replacing $f(x)$ by $-f(x)$ or by $f(-x)$; then the other endpoint stays fixed.\n\n## Explanations\n\n### L1 human\n\nLike bisection, regula falsi keeps an interval on which the function changes sign.\nInstead of cutting the interval in the middle, it draws the straight line between the two end values and cuts where that line crosses zero.\nThis is often a much better guess than the midpoint.\nBut when the graph bends the same way throughout, one endpoint never moves and progress can become slow.\n\n### L2 human\n\nRegula falsi is a bracketing [[root-finding algorithm|TR4CNS5PMJ]] like the bisection method, and it uses the same chord formula as the secant method.\nThe secant method uses the two most recent points instead of the two bracketing ones; it loses the guarantee of a bracket but converges superlinearly near a simple zero.\nThe fixed-endpoint problem of clause 2 led to modified versions such as the Illinois algorithm.\nIt halves the stored function value at an endpoint that stays fixed twice in a row.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "about": [
      "TR4CNS5PMJ"
    ],
    "kind": "statement",
    "msc": [
      "65H05"
    ],
    "name": "Regula falsi",
    "role": "theorem",
    "same_as": {
      "wikidata": "Q1476057",
      "wikipedia": "Regula falsi"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Regula_falsi"
      }
    ],
    "tag": "462AEY7MWF",
    "uses": [
      "TR4CNS5PMJ",
      "0X3WGX95FE",
      "00KAFBR32E",
      "0VW90BBSJ4",
      "0Q4QJWEHW3",
      "YWZQC5E54B"
    ]
  },
  "kind": "statement",
  "link": "https://tamnd.github.io/math2/node/462AEY7MWF/",
  "links": [
    {
      "field": "about",
      "target": "TR4CNS5PMJ"
    },
    {
      "field": "uses",
      "target": "TR4CNS5PMJ"
    },
    {
      "field": "uses",
      "target": "0X3WGX95FE"
    },
    {
      "field": "uses",
      "target": "00KAFBR32E"
    },
    {
      "field": "uses",
      "target": "0VW90BBSJ4"
    },
    {
      "field": "uses",
      "target": "0Q4QJWEHW3"
    },
    {
      "field": "uses",
      "target": "YWZQC5E54B"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/462AEY7MWF.md",
  "msc": [
    "65H05"
  ],
  "name": "Regula falsi",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/462/462AEY7MWF.md",
  "status": null,
  "tag": "462AEY7MWF",
  "uri": "m2://462AEY7MWF",
  "url": "https://tamnd.github.io/math2/wiki/regula-falsi/",
  "writing": {
    "tag": "462AEY7MWF",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}