Roots of Nonlinear Equations

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Objectives
Understand the need for numerical solutions of
nonlinear equations
Be able to use the bisection algorithm to find a
root of an equation
Be able to use the false position method to find a
root of an equations
Write down an algorithm to outline the method
being used
Realize the need for termination criteria
Numerical Analysis: Bracketing Methods
Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Root of Nonlinear Equations

Solve

f x 0

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Bracketing Methods

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Intermediate Value Theorem

For our specific interest
If f(x) is continuous in the interval [a,b], and
f(a).f(b)<0, then there exists c such that
a<c<b and f(c)=0.

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Example
For the parachutist problem
mg
ct / m
vt
1 e
c

Find c such that v10 40 m / s

2
g

9
.
8
m
/
s
, m 68 .1kg
Where,

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Example (contd)

68.1* 9.8
10c / 68.1
You get 40
1 e
c
667.38
1 e 0.147c 40
OR: f c
c
Giving,

f 12 6.067 & f 16 2.269

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Example (contd)
Graphically

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

The Bisection Method

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Algorithm
1. Search for a & b such that
f(a).f(b)<0
2. Calculate c where c=0.5(a+b)
3. If f(c)=0; end
4. If f(a).f(c)>0 then let a=c; goto step 2
5. If f(b).f(c)>0 then let b=c; goto step 2

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Algorithm (contd)

That algorithm will go on forever!

We need to define a termination
criterion
Examples of termination criteria:
1. |f(c)|<es
2. |b-a|<es
3. ea=|(cnew -cold)/cnew|<es
4. Number of iterations > N

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Algorithm: Modified

So, lets modify the algorithm

1. Search for a & b such that
f(a).f(b)<0
2. Calculate c where c=0.5(a+b)
3. If |f(c)|<es; end
4. If f(a).f(c)>0 then let a=c; goto step 2
5. If f(b).f(c)>0 then let b=c; goto step 2

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

False-Position Method

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

The False-Position Method

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Evaluating c
The slope of the line
joining the two point
maybe written as:

yc y a
yc yb
m
or m
ca
c b
yc ya yc yb

ca
c b
c b yc ya c a yc yb
Numerical Analysis: Bracketing Methods
Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Evaluating c
c b 0 ya c a 0 yb
cy b ya c ya b yb a

yb a yab
c
yb ya
f b a f a b
c
f b f a
Numerical Analysis: Bracketing Methods
Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

False Position Algorithm

1. Search for a & b such that
f(a).f(b)<0
2. Calculate c where
c=(af(b)-bf(a))/(f(b)-f(a))
3. If |f(c)|<es; end
4. If f(a).f(c)>0 then let a=c; goto step 2
5. If f(b).f(c)>0 then let b=c; goto step 2
Numerical Analysis: Bracketing Methods
Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Conclusion
The need for numerical solution of nonlinear
equations led to the invention of approximate
techniques!
The bracketing techniques ensure that you will
find a solution for a continuous function if the
solution exists
A termination criterion should be embedded into
the numerical algorithm to ensure its
termination!
Numerical Analysis: Bracketing Methods
Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com

Homework #1
Chapter 5, page 139, numbers:
5.3,5.6,5.7,5.8,5.12
You are not required to get the solution
graphically!
Homework due Next week!

Numerical Analysis: Bracketing Methods

Mohammad Tawfik

#WikiCourses
http://WikiCourses.WikiSpaces.com