Advanced Mathematics

Root Finding Techniques

Advanced Mathematics

Newton-Raphson Method
Newton-Raphson Method
Newton’s method also known as the Newton-
Raphson Method is named after Isaac Newton
and Joseph Raphson, is a root-finding algorithm.
Newton-Raphson Method is often the most
efficient root-finding algorithm available.
=
Newton-Raphson Method
Newton-Raphson Method
In Newton Raphson Method, its convergence is
faster than the Fixed-Point Iteration Method. But
sometimes, for given equation and for given guess
we may not get solution.
Newton-Raphson Method
Newton-Raphson Method
 Newton-Raphson Method
Example:
Find the root of using Newton-Raphson Method
(absolute error ≤ 0.0001).

Solution
For
x 0 1 2 3 4

f(x) -1 -1 1 5 11
 Newton-Raphson Method
For

For
 Newton-Raphson Method
For =

n f()

1 1.5 -0.25 2 1.625 0.125

2 1.625 0.01563 2.25 1.6181 0.0069

3 1.6181 0.000148 2.2362 1.6180 -0.0001

4 1.6180 0.000076 2.236 1.6180 0

5 1.6180 0.000076 2.236 1.6180 0

 Newton-Raphson Method
Example:
Find the root of using Newton-Raphson Method
(absolute error ≤ 0.0001).

Solution
For

x 0 1 2 3 4

f(x) 1 -0.632 -1.864 -2.9502 -3.9816

 Newton-Raphson Method
For

For
 Newton-Raphson Method
For =

n f()

1 0.5 0.1065 -1.6065 0.5663 0.0663

2 0.5663 0.001322 -1.5676 0.5671 0.0008

3 0.5671 0.00006784 -1.5672 0.5671 0.0001

Advanced Mathematics

Sample Problem
 Newton-Raphson Method
Example:
Find the root of using Newton Raphson Method
(absolute error ≤ 0.0001).

Solution
For

x 0 1 2 3 4

f(x) 0 -0.15853 -1.01223 -2.01297 -3.0907

 Newton-Raphson Method
For

For
 Newton-Raphson Method
For =

n f()

1
0.5 0.149637 -0.46243 0.823591 0.32356
2 0.8236 -0.03561 -0.66078 0.769696 -0.0539
3
0.7697 -0.00067 -0.6357 0.768649 -0.0011
4 0.7687 -2.7E-07 -0.63519 0.768649 -0.0001
5 0.7687 -4.3E-14 -0.63519 0.768649 -0.0001
The End