Scribd
Upload
32 views15 pages

Numerical Analysis: Prof. Dr. Süheyla ÇEHRELİ

The document discusses numerical methods for finding the roots or zeroes of equations, specifically bracketing methods like bisection and the false position method. Bisection involves repeatedly bisecting the interval containing the root, while false position uses linear interpolation between points to estimate the root. Examples are given of using each method to find the root of equations, including solving for the depth of liquid in a spherical tank given its volume and radius.

Uploaded by

Ezgi Geyik
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
32 views15 pages

Numerical Analysis: Prof. Dr. Süheyla ÇEHRELİ

The document discusses numerical methods for finding the roots or zeroes of equations, specifically bracketing methods like bisection and the false position method. Bisection involves repeatedly bisecting the interval containing the root, while false position uses linear interpolation between points to estimate the root. Examples are given of using each method to find the root of equations, including solving for the depth of liquid in a spherical tank given its volume and radius.

Uploaded by

Ezgi Geyik
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/ 15

NUMERICAL ANALYSIS

Prof. Dr. Süheyla ÇEHRELİ

2
ROOTS OF EQUATIONS

 We will be interested in methods for solving


𝑋0 \ 𝑓(𝑥0 ) = 0
We can define the root of an equation as the value of x
that makes f(x)=0.
 easy;

 not easy;

 ??
ROOTS OF EQUATIONS
 Two Fundamental Approaches

 Bracketing Methods
 Bisection Method

 False-Position Method (Regula Falsi)

 Open Methods
 Fixed-point Iteration

 Newton-Raphson Method

 Secant Method
BRACKETING METHODS

 These techniques are called bracketing methods


because two initial guesses for the root are
required.

 The particular methods described herein employ


different strategies to systematically reduce the
width of the bracket and hence, home in on the
correct answer
BISECTION METHOD
The bisection method is one of type of
incremental search method in which the interval
always divided in half. If a function changes sign
over an interval, the function value at the midpoint
is evaluated. The location of the root is then
determined as lying at the midpoint of the
subinterval within which the sign change occurs.
The process is repeated to obtained refined
estimates.
BISECTION METHOD
BISECTION METHOD - PROCEDURE
Step 1: Choose lower Xl and upper Xu guesses
Step 2: Check the Xl and Xu value
f(Xl).f(Xu)<0
Step3: An estimate of the root Xr is determined by
𝑋𝑙 + 𝑋𝑢
𝑋𝑟 =
2
Step 4: Make the following evaluations to determine in which
subinterval the root lies;
a) if f(Xl).f(Xr) < 0 → the root lies in the lower subinterval → Xu=Xr
b) if f(Xl).f(Xr) > 0 → the root lies in the upper subinterval → Xl=Xr
c) if f(Xl).f(Xr) = 0 → the root equal Xr

termination criteria |ɛa| < εs


BISECTION METHOD

 advantages;
 easy
 always finds a root

 number of iterations required to attain an absolute error can

be computed a priori.

 disadvantages;
 slow
 need to find initial guesses for xl and xu
THE FALSE-POSİTİON METHOD (REGULA-FALSİ)

An alternative method that exploits this graphical


insight is to join f(xu) and f(xl) by a straight line. The
intersection of this line with the x axis represents an improved
estimate of the root.
We can approximate the solution by doing a linear
interpolation between f(xu) and f(xl)
Find xr such that l(xr)=0, where l(x) is the linear
approximation of f(x) between xl and xu
Derive xr using similar triangles
THE FALSE-POSİTİON METHOD (REGULA-FALSİ)

𝑓(𝑥𝑙 ) 𝑓(𝑥𝑢 )
=
𝑥𝑟 − 𝑥𝑙 𝑥𝑟 − 𝑥𝑢

𝑓(𝑥𝑢 )(𝑥𝑙 − 𝑥𝑢 )
𝑥𝑟 = 𝑥𝑢 −
𝑓 𝑥𝑙 − 𝑓(𝑥𝑢 )
THE FALSE-POSİTİON METHOD - PROCEDURE
 Step 1: Choose lower Xl and upper Xu guesses

 Step 2: Check the Xl and Xu value


 f(Xl).f(Xu)<0
 Step3: An estimate of the root Xr is determined by

calculate f(xr)
 Step 4: Make the following evaluations to determine in which
subinterval the root lies;

a) if f(Xl) <0 f(Xu) > 0 f(Xr) < 0 → Xl=Xr


b) if f(Xl) <0 f(Xu) > 0 f(Xr) > 0 → Xu=Xr
 termination criteria |ɛa| < εs
 The volume V of liquid is a spherical tank of radius
r is related to the depth h of liquid by
πℎ2 (3𝑟−ℎ)
𝑉=
3
Determine h by Bisection method given r=1m and V=0.5m3

0.1< h <0.9 and |ɛa| < 4


 EXP 2-1: f(x) = x4-3x3+1

Use the Bisection method to determine the root of


equation with initial guesses of 1 , 3 and |Ɛa|<3.
 EXP 2-2: f(x) = x4-3x3+1

Use the False Position (Regula Falsi) method to determine


the root of equation with initial guesses of 1 , 3 and |Ɛa|<3.

You might also like