Fixed Point Iteration

Computational math
No derivatives
Fixed points
Linear convergence
Slow convergence
Authors

Dhruv Azad

Apurva Nakade

Published

June 25, 2026

Fixed point iteration is a way to solve an equation after rewriting it in the form

\[ x=g(x). \]

Starting with an initial guess \(x_0\), the method repeatedly applies \(g\):

\[ x_{n+1}=g(x_n). \]

If the sequence settles down to a value \(\alpha\), then that value satisfies

\[ \alpha=g(\alpha). \]

So \(\alpha\) is called a fixed point of \(g\).