Order of convergence

Level UniversityDifficulty ★★★★★Concept⌖ Open in the map

What is it?

How fast the error ek=∣xk−x∗∣e_k = |x_k - x^\ast| shrinks: linear (ek+1≈c eke_{k+1} \approx c\,e_k, a fixed number of digits per step), quadratic (ek+1≈c ek2e_{k+1} \approx c\,e_k^2, digits double each step). Bisection is linear; Newton is quadratic.

Formulas

lim⁡k→∞ek+1ek p=C∈(0,∞)\lim_{k\to\infty}\frac{e_{k+1}}{e_k^{\,p}} = C \in (0, \infty)
convergence of order pp

Where it shows up in computing

  • Scientific computing★★★★★fundamentalScientific computing and algorithms

    The order of a method decides how many iterations (and how much compute) an accurate answer costs.

Where it shows up in AI

  • Gradient descent★★★★★frequentAI and machine learning

    On strongly convex problems GD converges linearly, at a rate set by the condition number L/μL/\mu.

Where is it used?

Computing topics reachable from here, through the chain of ideas that leads to them:

This page has the essentials. A fuller treatment (intuition, formal definition, worked example) is on the way.

↑ ↓ to navigate · ↵ · Esc