Professional Documents
Culture Documents
Lecture 1 - Roots of Nonlinear
Lecture 1 - Roots of Nonlinear
ROOTS OF
NONLINEAR
EQUATIONS
NUMERICAL METHODS
MATH 134
- eigen problems
5 Secant Method
7 Polynomial Reduction
Engr. CHRISTOPHER S. PALADIO ASCOT
1 Estimate the initial interval 𝑥𝑖 , 𝑥𝑖+1
where 𝑥𝑖+1 = 𝑥𝑖 + ∆𝑥𝑖
T ≥ 𝑓(𝑥𝑖+1 ) , is reached
The function
BISECTION
2 Compute a new approximation for the root called the
midpoint 𝑥𝑟 such that
𝑥𝑟 =
𝑥𝑖 +𝑥𝑖+1
2 METHOD
Compute 𝑓(𝑥𝑖 ), 𝑓(𝑥𝑖+1 ) and 𝑓(𝑥𝑟 ) check if the latter
3 satisfied the specified tolerance values wherein 𝑇 ≥
𝑓(𝑥𝑟 ) if it does, end iteration, if not do another
iterations.
• EXAMPLE:
𝑥 = 0.578613
Engr. CHRISTOPHER S. PALADIO ASCOT
BISECTION METHOD
𝑥 = 3.401855
Engr. CHRISTOPHER S. PALADIO ASCOT
BISECTION
METHOD • PROBLEM:
(REGULA FALSI 𝑥𝑟 =
𝑥𝑖+1 ∗ 𝑓 𝑥𝑖 − 𝑥𝑖 ∗ 𝑓(𝑥𝑖+1 )
𝑓 𝑥𝑖 − 𝑓(𝑥𝑖+1 )
METHOD) Establish a tolerance limit for the function
3
𝑇 ≥ 𝑓(𝑥𝑟 ) . If the criterion is met, then
terminate the computation, otherwise,
continue.
ASCOT
Engr. CHRISTOPHER S. PALADIO
FALSE POSITION METHOD
• EXAMPLE:
𝑥 = 3.14615
𝑥 = 0.15860
• Use the three (3) methods to find the smallest positive root of the following
equations. In each case first determine a suitable interval, then compute
the root with relative accuracy of 0.5%
a) tan 𝑥 − 𝑥 − 1 = 0
b) 2𝑒 −𝑥 − sin 𝑥 = 0
c) 𝑥 3 − 𝑥 2 − 2𝑥 + 1 = 0
d) 3𝑥 3 + 4𝑥 2 − 8𝑥 − 1 = 0