Numerical Methods Module 1-1
Numerical Methods Module 1-1
_____________________________________________________________________________________
Mission
_____________________________________________________________________________
Core Values
_____________________________________________________________________________________
Learning Guide In
_____________________________________________________________________________________
Foreword
_____________________________________________________________________________________
Co-Author
______________________________________________________________________________
Table of Contents
______________________________________________________________________________
Vision i
Mission i
Title Page ii
Foreword iii
Table of Contents v
List of Tables vi
List of Figures vi
Overview: 1
References 16
vi
List of Tables
_______________________________________________________________________
List of Figures
_______________________________________________________________________
This pre-activity will set as a review for your previous skills and
methods finding the roots of a function. Solve each function finding the
roots by using the instructed method.
1. 𝑥 2 + 𝑥 + 1 = 0 (Quadratic Formula) use extra short bond paper if necessary
____________________________________________________________
____________________________________________________________
____________________________________________________________
____________________________________________________________
2. 𝑥 2 − 9𝑥 + 18 = 0 (Factoring Method) use extra short bond paper if necessary
____________________________________________________________
____________________________________________________________
____________________________________________________________
____________________________________________________________
3. 𝑥 2 − 3𝑥 + 4 = 0 (Completing the Square) use extra short bond paper if necessary
____________________________________________________________
____________________________________________________________
____________________________________________________________
____________________________________________________________
____________________________________________________________
4. 𝑥 2 − 9 = 0 (Extracting the Square Root) use extra short bond paper if necessary
____________________________________________________________
____________________________________________________________
____________________________________________________________
____________________________________________________________
Self-assessment (How far do you know?) 3
In the chart's left-hand column, read each of the questions and put a
check on each question in the relevant reverse box to display the answer.
5-Advanced 4-Proficient 3-Approaching Proficiency 2-developing 1-beginning
CAN I? 5 4 3 2 1
Example: 𝑥 2 + 𝑥 + 1 = 0, 𝑥 2 + 9 = 0 …etc.
Note: (1) Transcendental equation may have no root, a finite or infinite number of reαl
or complex roots.
(2) Polynomỉαl Equαtỉon of degree n hαs exαctly n reαl or complex rootş.
F𝑓(𝑧) = 𝑓 1 (𝑧) = 𝑓 2 (𝑧) = 𝑓 3 (𝑧) = 𝑓 3 (𝑧)………𝑓 (𝑚−1) (𝑧) = 0 but 𝑓 𝑚 (𝑧) ≠ 0 if m=1
then number z is called as simple as root.
Example: if 𝑓(𝑥) = 1 − cos (𝑥) then 0 is root of this equation to check multiplicity;
we check;
𝑓(𝑥) = 1 − cos(𝑥) , 𝑓(0) = 0
𝑓 ′ (𝑥) = sin(𝑥) , 𝑓 ′ (0) = 0
𝑓 ′′ (𝑥) = cos(𝑥) , 𝑓 ′′ (0) = 1 ≠ 0
Since in the latter stage of derivation is not equal to 0, therefore 0 is root of 𝑓(𝑥) with
multiplicity of 2.
There are generally two method of solving 𝑓(𝑥) = 0, the direct method and the iterative
method.
5
Direct Method, in this method we are finding the root of equation by direct process
in finite number of steps. This method finds all the roots of equation at a time.
Example: factorization method, using quadratic formula, extracting the square roots, synthetic
division. Etc.
Iteratỉve Method, thỉs method ỉs based on ỉdeα of successive approximation. In
this method we are starting with one or more initial approximations and obtain a sequence of
approximations of roots. In this method we can find only one root at a time.
Example: Bỉsectỉon Method, Secant Method, Resula Falsỉ Method, Newton Rαphson Method.
Etc.
Solution:
If x = 0, then 𝑓(0) = 2(0)3 + 5(0) − 8, 𝑓(0) = −8 coordinate (0, -8)
If x=1, then 𝑓(1) = 2(1)3 + 5(1) − 8, 𝑓(1) = −1 coordinate (1, -1)
If x=2, then 𝑓(2) = 2(2)3 + 5(2) − 8, 𝑓(2) = 18 coordinate (2,18)
Let’s put the coordinates into the cartesian plane so that, we can picture out the function which
line must be bracketed to.
6
Figure 1
18 (2, 18)
main focus
function
(1, -1)
(0, -8)
To solve the approximate value of the “𝑥 ” so that the function 𝑓(𝑥) = 0 we use this
table. Note: Assuming a=1 and b=2.
Table 1
𝑎 𝑏 𝑓(𝑎) 𝑓(𝑏) c=(a+b)/2 𝑓(𝑐) 𝑏−𝑎
1 2 -1 18 1.5 6.25 1
Note: if the Note: if the
vαlue of f(c) value of f(c)
ỉs lesser is greater
thαn 0, then than 0, then
the vαlue of the of your
your “a” on “b” on the
the next next row
row must be must be
change in change in
terms of terms of
value “𝐶” value “𝐶”
7
Since the b-a is lesser than 0.01 we can conclude we already reach the approximate root
of the function. The most appropriate answer is the value of your b which is 1.09375.
If we put 1.09375 to the function
𝑓(𝑥) = 2𝑥 3 + 5𝑥 − 8
𝑓(𝑥) = 2(1.09375)3 + 5(1.09375) − 8
𝑓(𝑥) = 0.0078125
we can obtain nearest zero value.
8
Figure 2
Example: Fỉnd a root of αn equαtỉon 𝑓(𝑥) = 2𝑥3 − 2𝑥 − 5 using False Position method
(regula falsi method)
Solution:
Here 2𝑥 3 − 2𝑥 − 5 = 0
Let 𝑓(𝑥) = 2𝑥 3 − 2𝑥 − 5
9
Here:
𝑥 0 1 2
𝑓(𝑥) −5 −5 7
1st iteration:
∴ Now, Root lies between 𝑎 = 1 and 𝑏 = 2
𝑓(𝑎)(𝑏−𝑎)
𝑥𝑟𝑓𝑝 =𝑎 −
𝑓(𝑏)−𝑓(𝑎)
(−5)(2−1)
𝑥𝑟𝑓𝑝 = 1 −
7−(−5)
𝑥𝑟𝑓𝑝 =1.41667
2nd iteration:
Since the sign of 𝑓(𝑥𝑟𝑓𝑝 ) of the 1st iteration = sign of 𝑓(𝑎). Then set 𝑎 = 𝑓(𝑥𝑟𝑓𝑝 )
(−2.14699)(2−1.41667)
𝑥𝑟𝑓𝑝 = 1.41667 −
7−(−2.14699)
𝑥𝑟𝑓𝑝 =1.55359
3rd iteration:
Since the sign of 𝑓(𝑥𝑟𝑓𝑝 ) of the 2nd iteration = sign of 𝑓(𝑎). Then set 𝑎 = 𝑓(𝑥𝑟𝑓𝑝 )
(−0.60759)(2−1.55359 )
𝑥𝑟𝑓𝑝 = 1.55359 −
7−(−0.60759)
𝑥𝑟𝑓𝑝 =1.58924
4th iteration:
Since the sign of 𝑓(𝑥𝑟𝑓𝑝 ) of the 3rd iteration = sign of 𝑓(𝑎). Then set 𝑎 = 𝑓(𝑥𝑟𝑓𝑝 )
(−0.15063)(2−1.58924 )
𝑥𝑟𝑓𝑝 = 1.58924 −
7−(−0.15063)
𝑥𝑟𝑓𝑝 =1.59789
5th iteration:
Since the sign of 𝑓(𝑥𝑟𝑓𝑝 ) of the 4th iteration = sign of 𝑓(𝑎). Then set 𝑎 = 𝑓(𝑥𝑟𝑓𝑝 )
(−0.0361)(2−1.59789 )
𝑥𝑟𝑓𝑝 = 1.59789 −
7−(−0.0361)
𝑥𝑟𝑓𝑝 = 1.59996
6th iteration:
Since the sign of 𝑓(𝑥𝑟𝑓𝑝 ) of the 5th iteration = sign of 𝑓(𝑎). Then set 𝑎 = 𝑓(𝑥𝑟𝑓𝑝 )
𝑓(𝑎)(𝑏−𝑎)
𝑥𝑟𝑓𝑝 =𝑎 −
𝑓(𝑏)−𝑓(𝑎)
(−0.00858)(2−1.59996 )
𝑥𝑟𝑓𝑝 = 1.59996 −
7−(−0.00858)
𝑥𝑟𝑓𝑝 = 1.60045
7th iteration:
Since the sign of 𝑓(𝑥𝑟𝑓𝑝 ) of the 5th iteration = sign of 𝑓(𝑎). Then set 𝑎 = 𝑓(𝑥𝑟𝑓𝑝 )
(−0.00858)(2−1.59996 )
𝑥𝑟𝑓𝑝 = 1.60045 −
7−(−0.00858)
𝑥𝑟𝑓𝑝 = 1.60056
Table 2
#
iterations
𝑎 𝑓(𝑎) 𝑏 𝑓(𝑏) 𝑥𝑟𝑓𝑝 𝐹(𝑥𝑟𝑓𝑝 ) update
Instruction: Solve the following function using excel; for this solving activity
send the excel file to our google classroom.
_____________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
___________________________________________________________________________________________
_________________________________________
16
References
R. L. Burden, J. D. Faires, A. M. Burden. Numerical Analysis. 2016.
J. H. Matthews, K. D. Fink. Numerical methods using MATLAB. Pearson,
2004.
W. Gautschi. Numerical Analysis. Birkhäuser Boston, 2012 (ebook available
from the Library)