Content
Summary
The Newton-Raphson method is an iterative algorithm that locates roots of nonlinear equations by linearizing the function via Taylor expansion, yielding the update rule . It exhibits quadratic convergence near simple roots but fails if the derivative is zero or if the initial guess is outside the basin of attraction.
Intuition
Imagine you are trying to find where a curve touches the x-axis, but the equation is too complex to solve algebraically. The Newton-Raphson method approximates the curve locally as a straight line (the tangent) at your current position. It calculates where this tangent line crosses the axis and moves there. If the curve is smooth and you start close enough, each step gets you much closer to the true root than the last, effectively 'zooming in' on the solution with increasing precision.
Key equations
The core update rule for a single variable, derived by truncating the Taylor series after the linear term.
The condition for quadratic convergence, where the error at step n+1 is proportional to the square of the error at step n.
The linear system solved in multivariate cases, where A is the Jacobian matrix and b contains negative function values.
Derivation
- Assume the function is analytic and we have a current iterate .
- Perform a Taylor expansion of around :
- Assume the next iterate is a root, so .
- Truncate the series after the linear term to linearize the problem.
- Solve the resulting linear equation for the update term .
- Rearrange to obtain the update rule: .
Worked example
Solve for a quantum particle in a 1D square well with , starting with .
- Identify the function and its derivative .
- Apply the update rule starting at .
- Iteration 1 yields with error .
- Iteration 2 yields with error .
- Iteration 3 yields with error .
- Continuing this process, the error decreases rapidly, reaching by iteration 7.
- The sequence converges to the root .
Answer The root is approximately 1.472473107.
Common mistakes
- Assuming convergence is guaranteed regardless of the initial guess; poor guesses can lead to divergence or cycles.
- Ignoring the case where , which causes a division by zero error.
- Expecting quadratic convergence for roots with multiplicity greater than one, where convergence slows significantly.
- Failing to check if the derivative diverges at the root, such as in for .