0% found this document useful (0 votes)
11 views18 pages

Roots: Graphical

The document discusses various methods for finding roots of equations, including graphical, bisection, and false position methods. It explains the concept of roots, particularly for quadratic equations, and provides examples and steps for implementing the bisection and false position methods. Additionally, it highlights the importance of error tolerance and relative error estimation in the root-finding process.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views18 pages

Roots: Graphical

The document discusses various methods for finding roots of equations, including graphical, bisection, and false position methods. It explains the concept of roots, particularly for quadratic equations, and provides examples and steps for implementing the bisection and false position methods. Additionally, it highlights the importance of error tolerance and relative error estimation in the root-finding process.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

Roots

-
of Equations
Method
·

Graphical
· Bisection Method
· False Position
-
Method
Roots of Equations
Root of f(x): Values of x that makes f(x) = 0
Also, called Zeros of the equation

Roots of Quadratic Equation 𝒂𝒙𝟐 + 𝒃𝒙 + 𝒄 = 𝟎 are

−𝒃 ± 𝒃𝟐 − 𝟒𝒂𝒄
𝒙=
𝟐𝒂
f ( x ) = e− x − x
How about these functions?
f ( x ) = sinx + x = 0

Need Alternative Methods


Methods for solving Non-linear Equations

Bracketing Open
Methods
Graphical Fixed-point
Bisection Newton-
Raphson
False-
Position Secant
Graphical Method
Plot the function 𝒇 𝒙 and obtain values of 𝒙 for 𝒇 𝒙 = 𝟎

Example: Determine drag coefficient (c) need for a parachutist of mass m = 68.1 kg to
have a velocity of 40 m/s after free-falling for time-
t = 10 s.

𝒈𝒎 𝒄 𝟔𝟔𝟕. 𝟑𝟖 −
𝒄
𝒗= 𝟏−𝒆
− 𝒎 𝒕
𝒇 𝒄 = 𝟏−𝒆 𝟔𝟖.𝟏 𝟏𝟎 − 𝟒𝟎
𝒄 𝒄
f(c)=
&(1 e
4m +
-
) - v

Helpful in getting approximate estimates, so it can be used as guess for other methods
𝒇(𝒙) has same sign,
No roots
(xl , xu]
If 𝒇 𝒙𝒍 and 𝒇(𝒙𝒖 ) has
opposite signs at end
𝒇(𝒙) changes sign once,
One root
points, then odd number
of roots

𝒇(𝒙) changes sign twice,


Two roots If 𝒇(𝒙𝒍 ) and 𝒇(𝒙𝒖 ) has
same signs at end
points, then either no
𝒇(𝒙) changes sign thrice, roots or even number of
Three roots roots.
Bisection Method
If 𝒇 𝒙 is real and continuous in the interval from 𝑥𝑙 to 𝑥𝑢 and
𝑓(𝑥𝑙 ) and 𝑓(𝑥𝑢 ) have opposite signs,

𝑓(𝑥𝑙 ) 𝑓(𝑥𝑢 ) < 0

Then intermediate value theorem implies that there is at least


one real root between 𝑥𝑙 and 𝑥𝑢
Method
and Du Sit
Step
: 1 Choose e

f(xe) f(au) < 0


r i
Step
=
2 :
Cr [xe xu]
,

( 2r]
, , [2 2n]
,

Step : 3 If f(xe) +(dr) < 0

root will lie in first subinterval (ne Pr),


The

Set Ku =
Pr
Case I .

#f(xe) f(xr) > 0

then the root will lie in [Km Ku]


,

Set xe =
xr

III
Lase. If f(xe) f(xr) = 0

then Xr is the root.

Terminate the
process.
2 .

g .

+(c) =(1 -e-(468 1)


10)
.

40
xu xy
=

x =
12 & xy =
16 [14 ,
15]
= = 14
=
f(xe)f(xm) = f((z) f((4) = 9 51770
29
.

sub-interval xe xr
[14 16]
=

,
z
=
14 S
=
.

= 15

f(u) +(15) = 1 :

569(-0 .

425)
= -
0 .
66640

Root lies in lower subinterval.


❑ In practice, the exact value is never reached.

❑ It is crucial to define an error tolerance.

❑ The relative error is estimated using root approximations


from successive iterations.

Approximate Percent
Relative Error -

Here absolute is used because we are concerned about magnitude rather than sign
-14 825 .

[ ·
12 In ~
14 5 In .
.
16 515

have reduced the interval

11/
so now we

from (12 , 15] to (14 75 , 10 875] .

x100 = 5 667
.

%
:
.

C .

Note that the true value of the root is 14.7802


Pros
-
Easy
find the root
>
-
Always
- Number of iterations
absolute
required to
be
attain an error can

computed a
priori &

-
20NS
>
- Must know a and b that bound
root
- Multiple roots ?
-
Convergence is
relatively slow ?
False- Position
Method
Utilizes the
information of
function values
intersection
Using similar
triangles ,

be
the
estimated as
of the
straight
line with the x-axis can

f(xe)(x-xu) f) ( =

= + (xu)xe
xu +(e) -

xr(f(xe) +(u) -
=

f(x)
f(xu)xy
-

= xuf(x) -
f(xu)xu +

f(xu)

it
A

- . ↑

Nu
ar
f(xi)
Using false position method for the same example

First Iteration :

Second iteration:

which has true and approximate relative errors of 0.09 and 0.79 percent.

You might also like