Documente Academic
Documente Profesional
Documente Cultură
http://numericalmethods.eng.usf.edu
Transforming Numerical Methods Education for STEM
Undergraduates
04/25/20 http://numericalmethods.eng.usf.edu 1
Newton-Raphson Method
http://numericalmethods.eng.usf.edu
Newton-Raphson Method
f(x )
f ( x i)
x f x f(xi )
i, i xi 1 = xi -
f (xi )
f ( x i-1 )
x i+ 2 x i+ 1 xi X
AB
f(xi) B tan(
AC
f ( xi )
f ' ( xi )
xi xi 1
C A X f ( xi )
xi+1 xi xi 1 xi
f ( xi )
5 http://numericalmethods.eng.usf.edu
Step 1
6 http://numericalmethods.eng.usf.edu
Step 2
7 http://numericalmethods.eng.usf.edu
Step 3
xi 1- xi
a = 100
xi 1
8 http://numericalmethods.eng.usf.edu
Step 4
Compare the absolute relative approximate error with
the pre-specified relative error tolerance . s
Go to Step 2 using new
Yes
estimate of the root.
Is a s ?
9 http://numericalmethods.eng.usf.edu
Example 1
You are working for ‘DOWN THE TOILET COMPANY’ that
makes floats for ABC commodes. The floating ball has a
specific gravity of 0.6 and has a radius of 5.5 cm. You
are asked to find the depth to which the ball is
submerged when floating in water.
11 http://numericalmethods.eng.usf.edu
Example 1 Cont.
Solution
To aid in the understanding
of how this method works to
find the root of an equation,
the graph of f(x) is shown to
the right,
where
f x x 3-0.165x 2+3.993 10- 4
Figure 4 Graph of the function f(x)
12 http://numericalmethods.eng.usf.edu
Example 1 Cont.
Solve for f ' x
13 http://numericalmethods.eng.usf.edu
Example 1 Cont.
Iteration 1
The estimate of the root is
f x0
x1 x0
f ' x0
0.05
0.05 0.165 0.05 3.993 10 4
3 2
1.118 10 4
0.05
9 10 3
0.05 0.01242
0.06242
14 http://numericalmethods.eng.usf.edu
Example 1 Cont.
16 http://numericalmethods.eng.usf.edu
Example 1 Cont.
Iteration 2
The estimate of the root is
f x1
x2 x1
f ' x1
0.06242
0.06242 0.165 0.06242 3.993 10 4
3 2
3.97781 10 7
0.06242
8.90973 10 3
0.06242 4.4646 10 5
0.06238
17 http://numericalmethods.eng.usf.edu
Example 1 Cont.
2 m
The maximum value of m for which a 0.5 10 is 2.844.
Hence, the number of significant digits at least correct in the
answer is 2.
19 http://numericalmethods.eng.usf.edu
Example 1 Cont.
Iteration 3
The estimate of the root is
f x2
x3 x2
f ' x2
0.06238
0.06238 0.165 0.06238 3.993 10 4
3 2
4.44 10 11
0.06238
8.91171 10 3
0.06238 4.9822 10 9
0.06238
20 http://numericalmethods.eng.usf.edu
Example 1 Cont.
22 http://numericalmethods.eng.usf.edu
Advantages and Drawbacks
of Newton Raphson Method
http://numericalmethods.eng.usf.edu
23 http://numericalmethods.eng.usf.edu
Advantages
Converges fast (quadratic convergence), if
it converges.
Requires only one guess
24 http://numericalmethods.eng.usf.edu
Drawbacks
1. Divergence at inflection points
Selection of the initial guess or an iteration value of the root that is
close to the inflection point of the function f xmay
start
diverging away from the root in ther Newton-Raphson method.
27 http://numericalmethods.eng.usf.edu
Drawbacks – Oscillations near local
maximum and minimum
3. Oscillations near local maximum and minimum
roots.
28 http://numericalmethods.eng.usf.edu
Drawbacks – Oscillations near local
maximum and minimum
Table 3 Oscillations near local maxima and 6
f(x)
mimima in Newton-Raphson method. 5
f xi a %
Iteration
Number xi 4
3
0 –1.0000 3.00 3
For example 1
f x sin x 0 0.5
x
Choose 0
x0 2.4 7.539822
-2 0 2 4 6 8 10
-0.06307 0.5499 4.461 7.539822
-0.5
-1.5
http://numericalmethods.eng.usf.edu/topics/newton_ra
phson.html
THE END
http://numericalmethods.eng.usf.edu