What is it?
How fast the error shrinks: linear (, a fixed number of digits per step), quadratic (, digits double each step). Bisection is linear; Newton is quadratic.
Formulas
- convergence of order
Where it shows up in computing
The order of a method decides how many iterations (and how much compute) an accurate answer costs.
Where it shows up in AI
On strongly convex problems GD converges linearly, at a rate set by the condition number .
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.