Newton's Method
Iteratively finding roots of a function by following the tangent line at each guess â converges quadratically near a root.
Start at x = 1.000000, where f(x) = -1.000000.
The tangent line is the local straight-line approximation to the curve.
Where that tangent hits the x-axis becomes x = 1.50000000.
Newton's Method (also called the Newton-Raphson method) is an iterative algorithm for finding roots of a function .
Starting from an initial guess , the iteration is:
Geometric idea: At each step, draw the tangent line to at . The tangent line intersects the -axis at . Under mild conditions, successive tangent line intercepts converge to the root.
The tangent line at has equation . Setting :
is the positive root of , so .
Starting with :
| 0 | 1.0 | |
| 1 | 1.5 | |
| 2 | 1.41\overline6 | |
| 3 | 1.41421356âĶ |
Correct to 8 significant figures after just 3 iterations.
Use Newton's Method with to approximate to four decimal places. Perform three iterations.
Solution
, . Iteration: .
True value: . Three iterations from gives 5 correct decimal places.
Related concepts
Needs first
Related