Explore modules

Fixed Point Iteration

Visualize fixed-point iteration and cobweb plots for finding roots of functions.

Free theory article

Visualize fixed-point iteration and cobweb plots for finding roots of functions.

Concept & interpretation

Fixed point iteration is a numerical method for finding roots of functions. Rather than solving f(x) = 0 directly, we rewrite the equation in the form x = g(x). A value x that satisfies this equation is called a fixed point of the function g, because applying g leaves the point unchanged. Starting from an initial guess x0, we repeatedly apply the function to generate a sequence: x1 = g(x0), x2 = g(x1), and so on. Under the right conditions, this sequence converges to a fixed point.

Read the full free theory article