The Newton-Raphson Method is an iterative algorithm designed to find the roots of a real-valued function . A root is defined as any value such that the function evaluates to zero, representing the point where the graph crosses the x-axis.
Unlike simple sign-change methods, this approach uses calculus to speed up convergence. It requires the function to be differentiable, as the method relies on the gradient of the function at specific points.
The process begins with an initial approximation , which is then refined through a recurrence relation to produce a sequence of values that ideally converge toward the true root .
The method is based on the geometric idea that a tangent line to a curve at a point near the root will intersect the x-axis at a point even closer to that root. By repeating this process, the x-intercepts of successive tangents 'walk' toward the solution.
Mathematically, the equation of the tangent at is given by . To find where this tangent hits the x-axis, we set and solve for , which becomes our next estimate .
This derivation leads to the standard Newton-Raphson formula: where is the derivative of the function evaluated at the current estimate.
Step 1: Rearrangement: Ensure the equation is in the form . If you are solving , you must first rewrite it as before proceeding.
Step 2: Differentiation: Calculate the first derivative using standard differentiation rules. This derivative is essential as it determines the slope of the tangent line used in the iteration.
Step 3: Iteration: Choose a starting value and substitute it into the formula to find . Use to find , and continue this process until the values stabilize to the required degree of accuracy.
Step 4: Verification: Once the sequence converges to a specific value (e.g., the same digits repeat), verify the root using a sign-change test on the boundaries of the rounded value to ensure the solution is correct.
| Feature | Newton-Raphson Method | Fixed-Point Iteration () |
|---|---|---|
| Requirement | Requires the derivative . | Requires rearranging into . |
| Convergence | Generally converges very quickly (quadratically). | Convergence depends on $ |
| Geometric Basis | Uses x-intercepts of tangent lines. | Uses intersection of and . |
| Complexity | Can be algebraically difficult to differentiate. | Easier to set up but may diverge easily. |
Calculator Efficiency: Always use the 'ANS' button on your calculator to perform iterations. Store your value, then type the formula using the 'ANS' key to quickly generate by repeatedly pressing the equals sign.
Show Your Working: Even when using a calculator, examiners require you to write down the specific formula with your and substituted in, as well as the values of the first few iterations (usually and ).
Accuracy Checks: If a question asks for a root to 3 decimal places, continue iterating until the 4th or 5th decimal place remains constant. Always perform a final check by substituting the bounds (e.g., ) into to confirm a sign change.