Scribd
Upload
2 views

Lecture 2_2 False Position Method

The document discusses the False Position Method, a numerical technique for finding roots of non-linear equations. It explains the method's iterative process, where one endpoint of an interval remains fixed while the other moves towards the root, and provides an example of its application. Additionally, it highlights the advantages of the method over the Bisection method, including faster convergence and reduced computational effort.

Uploaded by

ghulam mustafa ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

Lecture 2_2 False Position Method

The document discusses the False Position Method, a numerical technique for finding roots of non-linear equations. It explains the method's iterative process, where one endpoint of an interval remains fixed while the other moves towards the root, and provides an example of its application. Additionally, it highlights the advantages of the method over the Bisection method, including faster convergence and reduced computational effort.

Uploaded by

ghulam mustafa ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

Solutions to Non-linear Equations

False Position Method


Dr. Umer Farooq Ahmed

04/05/2025 Capital University of Science and Technology 1 1


False Position Method

 Frequently, as in the case shown in Fig., the function in the


interval [a, b] is either concave up or concave down.
 In this case, one of the endpoints of the interval stays the
same in all the iterations, while the other endpoint advances
toward the root.
 In other words, the numerical solution advances toward the
root only from one side.
 The convergence toward the solution could be faster if the
other endpoint would also "move" toward the root.
 Food for thought: How we move other point?

04/05/2025 Capital University of Science and Technology 2


False Position Method

04/05/2025 Capital University of Science and Technology 3


False Position Method
 Consider an equation f(x) =
0, which contains only one
variable, i.e. x.

 To find the real root of the


equation f(x) = 0, we
consider a sufficiently small
interval (a, b) where a < b
such that f(a) and f(b) will
have opposite signs.
According to the
intermediate value theorem,
this implies a root lies
between a and b.
04/05/2025 Capital University of Science and Technology 4
False Position Method
 Also, the curve y = f(x) will
meet the x-axis at a certain
point between A[a, f(a)] and
B[b, f(b)].

 Now, the equation of the


chord joining A[a, f(a)] and
B[b, f(b)] is given by:

04/05/2025 Capital University of Science and Technology 5


False Position Method
 Let y = 0 be the point of
intersection of the chord
equation (given above) with
the x-axis. Then,

04/05/2025 Capital University of Science and Technology 6


False Position Method
 This can be simplified as

 Thus, the first approximation


is
x1 = [af(b) – bf(a)]/ [f(b) – f(a)]

04/05/2025 Capital University of Science and Technology 7


False Position Method
 Also, x1 is the root of f(x) if
f(x1) = 0.

 If f(x1) ≠ 0 and if f(x1) and


f(a) have opposite signs, then
we can write the second
approximation as:

 x2 = [af(x1) – x1f(a)]/ [f(x1)


– f(a)]

04/05/2025 Capital University of Science and Technology 8


False Position Method
 Similarly, we can estimate x3,
x4, x5, and so on.

 Geometrical representation of
the roots of the equation f(x)
= 0 can be shown as:

04/05/2025 Capital University of Science and Technology 9


False Position Method:
Method Example
of False
Position
Find a root of an equation f(x)=2x3-2x-5 using False Position method (Regula
Falsi method)
Solution

Here 2x3-2x-5=0

Let f(x)=2x3-2x-5

x 0 1 2
f(x) -5 -5 7

Approximate root of
the equation 2x3-2x-
5=0 using
False Position
method is 1.60056

10
False Position Method: Algorithm

11
Advantages
Regula- Falsi Method

• Oldest method ( dates back to ancient Egyptians)


• Also known as method of linear interpolation or False
position method.
• Effective alternate to Bisection method.
• Roots convergence is faster than Bisection method.
• Computational efforts are less.
Home Tasks
 Apply bisection Method and regula falsi method and find p3 for f
(x) = √x - cos x on [0, 1]. Also compare results
 Use the Bisection method and Regula Falsi to find solutions
accurate to within 10-2 for x3 - 7x2 + 14x - 6 = 0 on
each interval.
– a. [0, 1]
– b. [1, 3.2]
 Also compare results
 Use the Bisection method to find solutions, accurate to within
10-5 for the following problems.
 3x - ex = 0 for 1 ≤ x ≤ 2
 2x + 3 cos x - ex = 0 for 0 ≤ x ≤ 1
 x2 - 4x + 4 - ln x = 0 for 1 ≤ x ≤ 2 and 2 ≤ x ≤ 4

13
Error Analysis of Bisection Method

04/05/2025 Capital University of Science and Technology 1414


Bisection
Bisection Method Method

 What is the maximum error after n iterations of


bisection method?
 How many iterations will be required to obtained the root
to the desired accuracy.
Error Estimate 12 Chang 16
e of
Iter1 sign

-34.8 17.6
At the n-th iteration:
endpoints of the inteval
12 14 Chang 16
e of
Iter2 sign

-34.8 -12.6 17.6

Length of the interval


14 15 16
Chang
Iter3 e of
sign
-12.6 1.5 17.6

Change of sign
14.5
15
14
Iter4

1.5
-5.8
-12.6
Error 12 14 16
Estimates for Iter1
Bisection -34.8 -12.6 17.6

At the iter1:
True root
live inside
this
interval

At the iter2:
14 15 16
Iter2
-12.6 1.5 17.6

At the nth iteration: Theorem


2.1

the absolute
error in the
n-th iteration
Example:
Theorem 2.1

Remark

It is important to realize that


1 14.0000 9.0000e-
Theorem 2.1 gives only a bound 01
for approximation error and that 2 15.0000 1.0000e-
this bound might be quite 01
conservative. For example, 3 14.5000 4.0000e-
01
4 14.7500 1.5000e-
01
5 14.8750 2.5000e-
02
Iterations till desired error
Theorem 2.1
Example:

Example
Determine the number of
iterations necessary to solve f (x)
= 0 with accuracy 10−2 using a1 1 14.0000 9.0000e-
= 12 and b1 = 16. 2 01
2 15.0000 1.0000e-
2n the desired error 01
3 14.5000 4.0000e-
solve for 01
n: 4 14.7500 1.5000e-
01
Remark 5 14.8750 2.5000e-
It is important to keep in mind that the error 02
analysis gives only a bound for the number of 6 14.9375 3.7500e-
iterations. In many cases this bound is much 02
larger than the actual number required. 7 14.9063 6.2500e-
03

You might also like