Secant Method: Civil Engineering Majors Authors: Autar Kaw, Jai Paul
Secant Method: Civil Engineering Majors Authors: Autar Kaw, Jai Paul
http://numericalmethods.eng.usf.edu
Transforming Numerical Methods Education for STEM
Undergraduates
07/28/10 http://numericalmethods.eng.usf.edu 1
Secant Method
http://numericalmethods.eng.usf.edu
Secant Method – Derivation
f(x) Newton’s Method
f(xi )
xi +1 = xi - (1)
f ′(xi )
f(xi)
[x f( x )]
i, i
E D A
On rearranging, the secant
X
xi+1 xi-1 xi method is given as
f ( xi )( xi − xi −1 )
Figure 2 Geometrical representation of xi +1 = xi −
the Secant method. f ( xi ) − f ( xi −1 )
4 http://numericalmethods.eng.usf.edu
Algorithm for Secant Method
5 http://numericalmethods.eng.usf.edu
Step 1
Calculate the next estimate of the root from two initial guesses
f ( xi )( xi − xi −1 )
xi +1 = xi −
f ( xi ) − f ( xi −1 )
Find the absolute relative approximate error
xi +1- xi
∈a = × 100
xi +1
6 http://numericalmethods.eng.usf.edu
Step 2
Find if the absolute relative approximate error is greater
than the prespecified relative error tolerance.
7 http://numericalmethods.eng.usf.edu
Example 1
You are making a bookshelf to carry books that range from 8 ½ ” to 11”
in height and would take 29”of space along length. The material is wood
having Young’s Modulus 3.667 Msi, thickness 3/8 ” and width 12”. You
want to find the maximum vertical deflection of the bookshelf. The
vertical deflection of the shelf is given by
8 http://numericalmethods.eng.usf.edu
Example 1 Cont.
The equation that gives the position x where the deflection is maximum is
given by
f( x) = − 0.67665 x 10-8 x 4 − 0.26689 x 10-5 x 3 + 0.12748 x 10-3 x 2 − 0.018507 = 0
Books
Bookshelf
0.01
0
f ( x) 0
0.01
− 0.01851 0.02
0 5 10 15 20 25 30
0 x 29
f(x)
= 8.2591× 10 − 4
f ( x−1 ) = − 0.67665 × 10 −8 x−41 − 2.6689 × 10 −5 x−31 + 0.12748 × 10 −3 x−21 − 0.018507
= − 0.67665 × 10 −8 (10) − 2.6689 × 10 − 5 (10) + 0.12748 × 10 − 3 (10) − 0.018507
4 3 2
= − 8.4956 × 10 − 3
11 http://numericalmethods.eng.usf.edu
Example 1 Cont.
(8.2591×10 )(15 − 10)
0.03
−4 0.027
x1 = 15 −
(8.2591×10 ) − ( − 8.4956 ×10 )
−4 −3 0.02
= 14.557 f ( x) 0.01
f ( x)
0
f ( x) 0
secant ( x)
f ( x)
0.01
0.02
− 0.027 0.03
0 5 10 15 20 25 30
0 x, x 0 , x 1' , x, x 1 29
f(x)
x'1, (first guess)
x0, (previous guess)
Secant line
x1, (new guess)
x1 − x0
∈a = × 100
x1
14.557 − 15
= × 100
14.557
= 3.0433 %
The number of significant digits at least correct is 1, because the absolute
relative approximate error is less than 5%.
13 http://numericalmethods.eng.usf.edu
Example 1 Cont.
Iteration 2
The estimate of the root is
f ( x1 )( x1 − x0 )
x2 = x1 −
f ( x1 ) − f ( x0 )
f ( x1 ) = − 0.67665 × 10 −8 x14 − 2.6689 × 10 −5 x13 + 0.12748 × 10 −3 x12 − 0.018507
= − 0.67665 × 10 −8 (14.557 ) − 2.6689 × 10 − 5 (14.557 ) + 0.12748 × 10 − 3 (14.557 ) − 0.018507
4 3 2
= − 2.9870 × 10 − 5
x2 = 15 −
( − 2.9870 ×10 )(14.557 − 15)
−5
= 14.572
14 http://numericalmethods.eng.usf.edu
Example 1 Cont.
0.03
0.028
0.02
f ( x) 0.01
f ( x)
0
f ( x) 0
secant ( x)
f ( x)
0.01
0.02
− 0.028 0.03
0 5 10 15 20 25 30
0 x, x 1 , x 0 , x, x 2 29
f(x)
x1 (guess)
x0 (previous guess)
Secant line
x2 (new guess)
x2 − x1
∈a = × 100
x2
14.572 − 14.557
= × 100
14.572
= 0.10611 %
16 http://numericalmethods.eng.usf.edu
Example 1 Cont.
Iteration 3
The estimate of the root is
f ( x2 )( x2 − x1 )
x3 = x2 −
f ( x2 ) − f ( x1 )
f ( x2 ) = − 0.67665 × 10 −8 x24 − 2.6689 × 10 −5 x23 + 0.12748 × 10 −3 x22 − 0.018507
= − 0.67665 × 10 −8 (14.572 ) − 2.6689 × 10 − 5 (14.572 ) + 0.12748 × 10 − 3 (14.572 ) − 0.018507
4 3 2
= − 6.0676 × 10 − 9
x2 = 14.572 −
( − 6.0676 × 10 )(14.572 − 14.557 )
−9
= 14.572
17 http://numericalmethods.eng.usf.edu
Example 1 Cont.
Entered function along given interval with current and next root and the
tangent line of the curve at the current root
0.03
0.028
0.02
f ( x)
0.01
f ( x)
0
f ( x) 0
secant ( x)
f ( x) 0.01
0.02
− 0.028 0.03
0 5.8 11.6 17.4 23.2 29
0 x, x 2 , x 1 , x, x 3 29
f(x)
x2 (guess)
x1 (previous guess)
Secant line
Figure 6 Graph of the estimate root after Iteration 3.
x3 (new guess)
18 http://numericalmethods.eng.usf.edu
Example 1 Cont.
The absolute relative approximate error ∈a at the end of Iteration 3 is
x2 − x1
∈a = × 100
x2
14.572 − 14.572
= × 100
14.572
= 2.1559 × 10 − 5%
19 http://numericalmethods.eng.usf.edu
Advantages
20 http://numericalmethods.eng.usf.edu
Drawbacks
2
2
f ( x)
0
f ( x) 0
f ( x)
−2 2
10 5 0 5 10
− 10 x, x guess1 , x guess2 10
f(x)
f ( x ) = Sin( x ) = 0
prev. guess
new guess
Division by zero
21 http://numericalmethods.eng.usf.edu
Drawbacks (continued)
2
2
f ( x)
f ( x)
0
f ( x) 0
secant ( x)
f ( x)
−2 2
10 5 0 5 10
− 10 x, x 0 , x 1' , x, x 1 10
f(x)
x'1, (first guess) f ( x ) = Sinx = 0
x0, (previous guess)
Secant line
x1, (new guess)
Root Jumping
22 http://numericalmethods.eng.usf.edu
Additional Resources
For all resources on this topic such as digital audiovisual
lectures, primers, textbook chapters, multiple-choice
tests, worksheets in MATLAB, MATHEMATICA, MathCad
and MAPLE, blogs, related physical problems, please
visit
http://numericalmethods.eng.usf.edu/topics/secant_method
THE END
http://numericalmethods.eng.usf.edu