MID PBL PRESENTAION (NACA)

DISCUSS THE FALSE POSITION METHOD IN

GRAPH & USE IN PARTICULAR PROBLEM ,
WHAT ARE THE DRAWBACKS OF FALSE
POSITION METHOD? ALSO DISCUSS THAT IS
THIS METHOD FAST CONVERGENT OR NOT?
Presented by :K17PG23
Presented to :Sir Abdul Majid
 INTRODUCTION

• The Regula–Falsi Method is a numerical method for estimating the roots of a polynomials f(x)
and transcendental with one variable or unknown and is old method .
• we choose two points a and b such that f (a) and f (b) are of opposite signs [f(a)*f(b)<0].
• Work on intermediate value theorem.
• Trail and error
 GRAPHICAL REPRESENTAION OF FALSE POSITION METHOD

• First
  we draw a chord between A and B
• The chord passes through x-axis at
Certain point that have coordinates
according to function or curve.
𝑥1 𝑥2 𝑥3
     

(𝑥 2 ,𝑓 𝑥2)
• We again draw a chord from the (𝑥1, 𝑓 𝑥1)
 
coordinates that chord passes through
Point having coordinates

• We again draw a chord from coordinates which cuts at

• We continue this procedure till we reach the point where f(x)=0
• For that we must know the equation of chord as our points lies on the chord .
 GRAPH AND DERIVATION
 For finding we have to find the value of chords
for that we use equation of line between two points formula :

Putting values from graph

First chord in graph meets x-axis at and y=0

Now cross multiply the above equation

Shift the last two values on RHS to LHS

 
 PROBLEM RELATED TO REGULA FALSI
•  Problem: Solve at (0,1) by regula falsie method up to 3 decimal points.
Solution:
As

Since f(0) and f(1) are of different signs then

a=0 ,b=1
Formula:

For
•Now
  F(

Next root lies between a and

Now

Next root lies between a and

•  Now for :

As we can see that so it converges to zero which means root lies at

DISADVANTAGES OF THIS METHOD:

• Same sign (we can’t interpret it)
• Some time slow down at bigger curve
• only solve one unknown ( if an equation have two unknows or graph passes through two points)

Is it faster than other methods?

It is faster than bisection method but slower than newton Raphson method
 THANKS
ANY QUESTION?