Newton Method Visualizer

Newton iteration is powerful because it uses local slope information, so a good starting point often doubles the number of correct digits at each step. The same mechanism can fail near flat derivatives or at basin boundaries: tiny changes in x0 may land on a different root, cycle, or diverge.

To find where a curve crosses zero, Newton's method replaces the curve with its tangent line at your current guess and jumps to where that straight line hits the x-axis. Because a smooth curve looks almost straight when you zoom in, that crossing usually lands much closer to the true root. Repeat, and you close in fast. The formula: x_{n+1} = x_n − f(x_n)/f'(x_n).

Modern CPUs often compute a/b by first finding 1/b, and Newton's method does this using no division at all. Applied to f(x) = 1/x − a it gives the iteration x_{n+1} = x_n(2 − a·x_n), built from only multiplication and subtraction — operations hardware does cheaply. The same trick underlies fast reciprocal-square-root routines, including the famous one in Quake III.