Scribd
Upload
7 views12 pages

3-Numerical Methods-Roots of Equations (Bracketing Methods)

The document discusses numerical methods for finding roots of equations, focusing on bracketing methods such as the Bisection Method and the False-Position Method. It provides detailed explanations, examples, and iterations for both methods using the function f(x) = x^2 - 3. Additionally, it includes an exercise for finding roots using both methods on a different function.

Uploaded by

sraiden49
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
7 views12 pages

3-Numerical Methods-Roots of Equations (Bracketing Methods)

The document discusses numerical methods for finding roots of equations, focusing on bracketing methods such as the Bisection Method and the False-Position Method. It provides detailed explanations, examples, and iterations for both methods using the function f(x) = x^2 - 3. Additionally, it includes an exercise for finding roots using both methods on a different function.

Uploaded by

sraiden49
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/ 12

THE UNIVERSITY OF JORDAN

School of Engineering
Department of Civil Engineering
(0951301): Numerical Methods
Dr. Ramia Al-Ajarmeh

Roots of Equations
(Bracketing Methods)
Roots of Equations
Refer to the Textbook, Chapters 5 & 6
Bracketing Methods
Refer to the Textbook, Chapter 5

1- Bisection Method

Bisection method: a root finding method that applies to any


continuous functions for which one knows two values with opposite
signs.

𝑢𝑝𝑝𝑒𝑟 𝑙𝑖𝑚𝑖𝑡 𝑢
𝐼𝑛𝑡𝑒𝑟𝑣𝑎𝑙 ൜ 𝑓 𝑢 𝑓 𝑙 <0
𝑙𝑜𝑤𝑒𝑟 𝑙𝑖𝑚𝑖𝑡 𝑙

It is also called: Interval having method or binary search method or


binary chopping or Bolzano's method (one of incremental search
methods)
Bracketing Methods

1- Bisection Method

Bisecting the interval defined by these values, then selecting the


sub-interval in which the function changes of sign and therefore,
must contain a root.
Bracketing Methods

1- Bisection Method

when to terminate the method?

𝑥𝑟𝑛𝑒𝑤 − 𝑥𝑟𝑜𝑙𝑑
𝜀𝑎 = 100%
𝑥𝑟𝑛𝑒𝑤
Bracketing Methods

1- Bisection Method

Example:

Consider finding the root of 𝑓 𝑥 = 𝑥 2 − 3 using bisection method.


𝜀𝑠 = 1% & start with interval [1, 2]
Bracketing Methods

1- Bisection Method

Example Solution:
Iter # l u f(l) f(u) r= (l+u)/2 f(r) update new u-l ɛa %

1 1 2 -2 1 1.5 -0.75 l=1.5 0.5 -

2 1.5 2 -0.75 1 1.75 0.0625 u=1.75 0.25 14.286

3 1.5 1.75 -0.75 0.0625 1.625 -0.359375 l=1.625 0.125 7.69

4 1.625 1.75 -0.359375 0.0625 1.6875 -0.15234375 l=1.6875 0.0625 3.7

5 1.6875 1.75 -0.15234375 0.0625 1.71875 -0.045898438 l=1.71875 0.03125 1.82

6 1.71875 1.75 -0.045898438 0.0625 1.734375 0.008056641 u=1.734375 0.015625 0.9

7 1.71875 1.734375 -0.045898438 0.008056641 1.7265625 -0.018981934 l=1.7265625 0.0078125

So, r= 1.734375
Bracketing Methods
2- False-Position Method

• It is also called the linear interpolation method.

• An alternative method based on graphical insight to join f(xl) &


f(xu) by a straight line. The intersection of this straight line with
x-axis represents an improved estimate of the root.
Bracketing Methods

2- False-Position Method

• Using similar triangles, the intersection of the straight line with


the x-axis can be estimated as:
Bracketing Methods

2- False-Position Method

Example:

Consider finding the root of 𝑓 𝑥 = 𝑥 2 − 3 using false-position


method. 𝜀𝑠 = 1% & start with interval [1, 2]
Bracketing Methods

2- False-Position Method

Example Solution:

Iteration # l u f(l) f(u) r f(r) ɛa %


1 1 2 -2 1 1.66667 -0.2222 ----
2 1.66667 2 -0.2222 1 1.7273 -0.0164 3.51
3 1.7273 2 -0.0164 1 1.7317 -0.0012 0.25

So, r= 1.7317
Bracketing Methods

Exercise:

consider finding the root of f(x) = 𝑒 −𝑥 [3.2 sin 𝑥 − 0.5 cos 𝑥 ]


on the interval [3,4] & 𝜀𝑠 = 0.1%

Using:
(1) Bisection method
(2) False-Position method

You might also like