Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

order of convergence

How fast a sequence of approximations closes in on its limit -- whether each new error is a fixed fraction of the last, or shrinks much faster than that.

A sequence of approximations p_n \to p converges with order \alpha if there is a constant \lambda with \dfrac{|p_{n+1}-p|}{|p_n-p|^\alpha} \to \lambda as n\to\infty; \alpha=1 (with \lambda<1) is called linear convergence, \alpha=2 quadratic.

Examples

  • Bisection converges with order \alpha=1; Newton's method, near a simple root, converges with order \alpha=2.

Read the full section →
Graph settings

Calculator