Академический Документы
Профессиональный Документы
Культура Документы
ROOTS OF EQUATIONS
Bisection method
Bracketing Methods
False Position Method
Roots of
Equations
Newton Raphson
Open Methods
System of Nonlinear
Equations
Secant
Modified Newton Raphson
Roots of polynomials
Muller Method
ROOTS OF EQUATIONS
Root of an equation: is the value of the equation variable which
make the equations = 0.0
2
b
4ac
2
ax bx c 0 x
2a
But
ax 5 bx 4 cx 3 dx 2 ex f 0 x ?
sin x x 0 x ?
ROOTS OF EQUATIONS
Non-computer methods:
- Closed form solution (not always available)
- Graphical solution (inaccurate)
Numerical
computers
systematic
methods
suitable
for
Graphical Solution
Plot the function f(x)
f(x)
roots
x
f(x)=0
f(x)=0
t
mg
(1 e m )
The parachutist velocity is v
c
t
mg
f (c)
(1 e m ) v
c
667.38
f (c)
(1 e 0.146843c ) 40
c
f(x)
No roots or even
number of roots
f(xl)=+ve
f(xl)=+ve
roots
roots
f(xu)=+ve
x
xl
xu
x
xl
xu
f(xu)=-ve
Special
Cases
Bracketing Methods
1. Bisection Method
Generally, if f(x) is real and continuous in the interval xl to xu
Then the interval is divided in half with the root lies in the
midpoint of the subinterval. This process is repeated to
f(x)
xr = ( xl + xu )/2
f(xu)
f(xl).f(xu)<0
Step 2: The root estimate is:
xr = ( xl + xu )/2
Step 3: Subdivide the interval according to:
If (f(xl).f(xr)<0) the root lies in the
lower subinterval; xu = xr and go to
step 2.
xr1
xl
xu
f(xu)
f(xr1)
f(x)
(f(xl).f(xr)<0): xu = xr
xr = ( xl + xu )/2
f(xu)
f(xr2)
xl
xu
xr2
x
f(xu)
et
X true X approximate
X true
100%
X rn X rn 1
ea
100%
n
Xr
Xu X l
ea
100% (Bisection)
Xu X l
mg
v
(1 e
c
c
t
m
mg
f (c )
(1 e ) v
c
667.38
f (c )
(1 e 0.146843c ) 40
c
c
1.
f(x)
6.067
5.
f(x)
14
16
x
-2.269
(f(12).f(14)>0): xl = 14
6.
and so on...
1.569
15
14
-0.425
x
16
-2.269
1
2
3
4
5
6
Xl
Xu
12
16
14
16
14
15
14.5 15
14.75 15
14.74 14.875
Xr
14
15
14.5
14.75
14.875
14.813
ea%
e t%
5.279
6.667
3.448
1.695
0.84
0.422
-1.487
1.896
1.204
0.641
0.291
Bisection method
False
f(xl). f(xu)<0
i=0
ea=1.1es
while
ea> es &
i <maxi
False
Print: xr , f(xr ) ,ea , i
xu x r
2
i i 1
xr
Stop
xu+xl =0
True
ea
xu x l
100%
xu x l
Test=f(xl). f(xr)
Test=0
True
ea=0.0
True
Test<0
xu=xr
False
xl=xr
Bracketing Methods
2. False-position Method
The bisection method divides the interval xl to xu in
half not accounting for the magnitudes of f(xl) and
f(xu). For example if f(xl) is closer to zero than f(xu),
then it is more likely that the root will be closer to
f(xl).
False position method is an alternative approach
where f(xl) and f(xu) are joined by a straight line; the
intersection of which with the x-axis represents and
improved estimate of the root.
2. False-position Method
False position method is an
alternative approach where
f(xl) and f(xu) are joined by
a straight line; the
intersection of which with
the x-axis represents and
improved estimate of the
root.
f(xu)
xl
f(xl)
xr
xu
f(xr)
f ( xl )
f ( xu )
xr xl
xr xu
f ( xu )( xl xu )
xr xu
f ( xl ) f ( xu )
c
t
m
mg
f (c)
(1 e ) v
c
667.38
f (c)
(1 e 0.146843c ) 40
c
c
f(x)
2.
14.91
12
16
-2.269
3.
4.
5.
6.
False
f(xl). f(xu)<0
i=0
ea=1.1es
while
ea> es &
i <maxi
False
Print: xr , f(xr ) ,ea , i
x r xu
i i 1
f (x u )(x l x u )
f (x l ) f (x u )
Stop
i=1
or
xr=0
True
ea
x r x r0
100%
xr
Test=f(xl). f(xr)
Test=0
True
ea=0.0
True
Test<0
xu=xr
xr0=xr
False
xl=xr
xr0=xr