Scribd
Upload
0 views7 pages

23 Newtons Method

Newton's Method is an iterative technique used to approximate the roots of complicated functions, especially when exact solutions are not possible. The method involves taking an initial guess, computing the tangent at that point, and using the x-intercept of the tangent as the next approximation, repeating this process to refine the estimate. However, the method does not always converge to the root, as shown in certain examples where the approximations can diverge from the actual root.

Uploaded by

hanannaji41
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 views7 pages

23 Newtons Method

Newton's Method is an iterative technique used to approximate the roots of complicated functions, especially when exact solutions are not possible. The method involves taking an initial guess, computing the tangent at that point, and using the x-intercept of the tangent as the next approximation, repeating this process to refine the estimate. However, the method does not always converge to the root, as shown in certain examples where the approximations can diverge from the actual root.

Uploaded by

hanannaji41
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Newton’s Method

r
0 x

Assume we want to find a root of a complicated function like:


f (x) = x 7 − x + cos x
Often it is impossible to solve such equations! E.g. there are no
formulas for solutions of polynomials of degree of ≥ 5.

Can we at least find the root approximately?


Newton’s Method

r
0 x
x2 x1

Idea of Newton’s Method


I Take an approximation x1 of the root (a rough guess).
I Compute the tangent L1 at (x1 , f (x1 )).
I The tangent L1 is close to the curve. . . so x-intercept of L1
will be close the the x-intercept of the function.
We can repeat this procedure to get improve the approximation.
Newton’s Method

r
0 x
x3 x2 x1

We want to find an approximation of the root r of f (x).


I Take an approximation x1 of the root (a rough guess).
I Compute the tangent L1 at (x1 , f (x1 )).
I Find the x-intercept x2 of the tangent L1 .
I Compute the tangent L2 at (x2 , f (x2 )).
I Find the x-intercept x3 of the tangent L2 .
I . . . continue until approximation is good enough
Newton’s Method

r
0 x
x2 x1

How can we compute x2 ? The tangent at (x1 , f (x1 )) is


y = f (x1 ) + f 0 (x1 )(x − x1 )
For the x-intercept x2 of the tangent, we have:
f (x1 )
0 = f (x1 ) + f 0 (x1 )(x2 − x1 ) =⇒ x2 = x1 −
f 0 (x1 )
We can repeat this process to get x3 , x4 , x5 . . .
Newton’s Method
Newton’s Method
Let f (x) be a function, and x1 and approximation of a root r .
We compute a sequence x2 , x3 , x4 , . . . of approximations by
f (xn )
xn+1 = xn −
f 0 (xn )
The hope is that x2 , x3 , . . . get closer and closer to the root r .

Let x1 = 2. Find the 3rd approximation to the root of x 2 − 1.


f 0 (x) = 2x
f (x1 ) f (2) 3 5
x2 = x1 − 0
=2− 0 = 2 − = = 1.25
f (x1 ) f (2) 4 4
5 5 2

f (x2 ) 5 f( ) 5 −1 41
x3 = x2 − 0 = − 0 45 = − 4 10 = = 1.025
f (x2 ) 4 f (4) 4 4
40
The sequence x1 , x2 , x3 , . . . gets closer and closer to the root 1.
Newton’s Method
Newton’s Method
Let f (x) be a function, and x1 and approximation of a root r .
We compute a sequence x2 , x3 , x4 , . . . of approximations by
f (xn )
xn+1 = xn −
f 0 (xn )
The hope is that x2 , x3 , . . . get closer and closer to the root r .
However, this does not always work.
√
3
Let x1 = 1. Find the 2nd approximation to the root of x.
y
1
f 0 (x) = √ 3
3 x2 x2
r
f (1) 1 0 x
x1
x2 = 1 − 0 = 1 − 1  = −2
f (1) 3

Note that x2 = −2 is further away from the root 0 than x1 = 1.


Newton’s Method
Newton’s Method
Let f (x) be a function, and x1 and approximation of a root r .
We compute a sequence x2 , x3 , x4 , . . . of approximations by
f (xn )
xn+1 = xn −
f 0 (xn )
The hope is that x2 , x3 , . . . get closer and closer to the root r .
However, this does not always work.

For more complicated examples see


I Chapter 4.8, Examples 1,2 and 3

You might also like