Fractal Lab

Complex dynamics

Newton fractal

Apply Newton’s root-finding iteration z ← z − f(z) / f’(z) in the complex plane. Color each starting point by which root it converges to (and optionally by how many steps it took). The result is a fractal: an intricate, self-similar partition of the plane into basins of attraction.

Newton fractal for p(z) = z³ − 1. Each color marks the basin of one of the three cube roots of unity.

At a glance

Iterationzn+1 = zn − f(zn)/f’(zn)
Classic polynomialf(z) = z3 − 1, the three cube roots of unity
Basin boundaryFractal, with Julia-set-like local structure
First studiedCayley (1879) posed the cubic case as the first open problem; Schröder (1870s) iterations

Why the boundary is fractal

Cayley noticed that for z² − 1 = 0 the basins are simple: the right half-plane converges to +1, the left to −1. But the moment you go to z³ − 1, the three basins develop an infinitely intricate boundary, every point on the boundary has all three basins arbitrarily close to it. Cayley called it “intricate.” A century later it became a poster image of deterministic chaos.

Generalizations

Real-world connection

Beyond the visuals, the Newton fractal is the canonical example for why root-finding software needs care about initial conditions: two seeds arbitrarily close together can converge to different roots, and there is no continuous map from seed to chosen root.

References

Try it

Run an interactive playground at /tools/newton.

Test Your Knowledge

Quick MCQ check on this topic (10 questions)

Start Quiz →

AI Summary

Summarize this page in your favorite LLM