Scribd
Upload
2 views

Lecture 4(1) Falsi Method

The Regula Falsi method, also known as the False Position method, is a numerical technique for finding the root of a continuous function by using linear approximation within an interval where the function changes sign. It converges faster than the Bisection Method but may struggle with highly non-linear functions. The document includes an algorithm for the Fixed Point Iteration Method, advantages and disadvantages of the Regula Falsi method, and an example with MATLAB code implementation.

Uploaded by

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

Lecture 4(1) Falsi Method

The Regula Falsi method, also known as the False Position method, is a numerical technique for finding the root of a continuous function by using linear approximation within an interval where the function changes sign. It converges faster than the Bisection Method but may struggle with highly non-linear functions. The document includes an algorithm for the Fixed Point Iteration Method, advantages and disadvantages of the Regula Falsi method, and an example with MATLAB code implementation.

Uploaded by

Muneeb Tahir
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Regula Falsi method

(False Position method)


Fixed point Method
 The Regula Falsi Method is a numerical
technique for finding the root of a
continuous function f(x) in a given interval
[a,b] Like the Bisection Method, it uses the
Intermediate Value Theorem, requiring that
f(a) and f(b) have opposite signs
(f(a)⋅f(b)<0) . However, instead of having
the interval, it uses a linear approximation
to estimate the root.
Algorithm of Fixed Point Iteration Method

Step-1: Find points x0 and x1 such


that x0<x1 and f(x0)⋅f(x1)<0.
Step-2: Take the interval [x0,x1] and
find next value using

Step-3: If f(x2)=0 then x2 is an exact root,


else if f(x0)⋅f(x2)<0 then x1=x2,
else if f(x2)⋅f(x1)<0 then x0=x2.
Step-4:
Repeat steps 2 & 3 until f(xi)=0 or |f(xi)|≤Accuracy
Advantages and Disadvantages

Advantages:
 Converges faster than the Bisection Method

in many cases.
 Does not require calculating derivatives.

Disadvantages:
 Convergence may be slow if the function is

highly non-linear near the root.


 May fail to converge if the function is not

well-behaved..
Example 1

Find a root of an equation using Fixed Point Iteration


method
Solution:

x 0 1 2
f(x) -1 -1 5
From Table it is observed that root lies between 1 and
2
Example 1

1st iteration :

Here f(1)=-1<0 and f(2)=5>0

∴ Now, Root lies between x0=1 and x1=2

x2=1.16667
Table
n x0 f(x0) x1 f(x1) x2 f(x2) Update
1 1 -1 2 5 1.16667 -0.5787 x0=x2

2 1.16667 -0.5787 2 5 1.25311 -0.28536 x0=x2

3 1.25311 -0.28536 2 5 1.29344 -0.12954 x0=x2

4 1.29344 -0.12954 2 5 1.31128 -0.05659 x0=x2

5 1.31128 -0.05659 2 5 1.31899 -0.0243 x0=x2

6 1.31899 -0.0243 2 5 1.32228 -0.01036 x0=x2

7 1.32228 -0.01036 2 5 1.32368 -0.0044 x0=x2

8 1.32368 -0.0044 2 5 1.32428 -0.00187 x0=x2

9 1.32428 -0.00187 2 5 1.32453 -0.00079 x0=x2

10 1.32453 -0.00079 2 5 1.32464 -0.00034 x0=x2


MATLAB CODE
 % Regular Falsi Method
 f=@(x)x^2 - sin(x) - 0.5; % main function
 a=1; % Xn-1
 b=2; % Xn
 d=f(a); %f(Xn-1)
 e=f(b); %f(Xn)
 c=(b-((b-a)/(e-d))*e) % calculate Xn+1
 for i = 1:15
 iteration = i + 1
 if f(a)*f(b)<0
 if f(a) && f(c) < 0
 a=c;
 else
 b=c;
 end
 end
 c=(b-((b-a)/(e-d))*e)
 d=f(a);
 e=f(b);

You might also like