Evaluating numerical algorithm
The Newton-Raphson Method is a second-order root-finding algorithm that uses the tangent slope derivative at the current point to slide down the curve directly toward the zero crossing with quadratic speed!
Find the root of starting with initial guess .
Find derivative and formulate iteration formula:
Plug initial guess into function and derivative:
Evaluate at :
| Iteration (k) | Current Guess (x_n) | f(x_n) | f'(x_n) | Next Guess (x_n+1) | Error (|x_n+1 - x_n|) |
|---|---|---|---|---|---|
| 1 | 2.000000 | -1.000000 | 4.000000 | 2.250000 | 0.250000 |
| 2 | 2.250000 | +0.062500 | 4.500000 | 2.236111 | 0.013889 |
| 3 | 2.236111 | +0.000193 | 4.472222 | 2.236068 | 0.000043 |
| 4 | 2.236068 | 0.000000 | 4.472136 | 2.236068 | 0.000000 |
Newton-Raphson exhibits quadratic convergence, effectively doubling the number of correct digits on every single iteration!