Advanced Mathematics

Root Finding Techniques

Advanced Mathematics

Secant Method
 Secant Method
Secant Method is also a recursive method for
finding the root for the polynomials by successive
approximation.

=
Secant Method
 Secant Method
In Secant Method, the speed of convergence of
secant method is faster than that of Bisection and
Regula falsi method. Sometimes, its convergence
is not guaranteed, so better put limit on
maximum number of iterations while
implementing this method.
Secant Method
 Secant Method
Example:
Find the root of using Secant Method (absolute
error ≤ 0.0001).

Solution
For
x 0 1 2 3 4

f(x) -1 -1 1 5 11
 Secant Method
Let

For
 Secant Method
For =

n f() f() f()

2 1.00000 -1.00000 2.00000 1.00000 1.50000 -0.25000

3 2.00000 1.00000 1.50000 -0.25000 1.60000 -0.04000

4 1.50000 -0.25000 1.60000 -0.04000 1.61905 0.00227

5 1.60000 -0.04000 1.61905 0.00227 1.61803 -0.00002

6
 Secant Method
Example:
Find the root of using Secant Method (absolute
error ≤ 0.0001).

Solution
For

x 0.5 1 2 3 4

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

 Secant Method
Let

For
 Secant Method
For =

n f() f() f()

2 0.5000 0.1065 1.0000 -0.6321 0.5721 -0.0078

3 1.0000 -0.6321 0.5721 -0.0078 0.5668 0.0006

4 0.5721 -0.0078 0.5668 0.0006 0.5671 -0.000001

6
Advanced Mathematics

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

Solution
For

x 0.5 1 2 3 4

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

 Secant Method
Let

For
 Secant Method
For =

n f() f() f()

2 0.5000 0.1496 1.0000 -0.1585 0.7428 0.0163

3 1.0000 -0.1585 0.7428 0.0163 0.7667 0.0012

4 0.7428 0.0163 0.7667 0.0012 0.7687 - 0.00001

6
The End