Scribd
Upload
251 views

Regula Falsi Method

This document describes the Regula Falsi method, a root-finding algorithm used to find roots of equations. It provides the steps of the method, which involve choosing initial lower and upper bounds for the root, estimating the root as the midpoint between bounds, and iteratively updating the bounds until the solution converges. Two examples applying the Regula Falsi method are given, one finding roots of an equation using a Java program, and another solving for conversion in a chemical reaction.

Uploaded by

yeay_me
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
251 views

Regula Falsi Method

This document describes the Regula Falsi method, a root-finding algorithm used to find roots of equations. It provides the steps of the method, which involve choosing initial lower and upper bounds for the root, estimating the root as the midpoint between bounds, and iteratively updating the bounds until the solution converges. Two examples applying the Regula Falsi method are given, one finding roots of an equation using a Java program, and another solving for conversion in a chemical reaction.

Uploaded by

yeay_me
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Regula Falsi Method

Submitted by:
Aes. Marice
De Guzman, Marnoel
Ocampo, Jediel
Serrano, Faith
Tecson, Adriane

Submitted to: Engr. Jan Vincent Madayag

Schedule: 7:30 F
REGULA-FALSI METHOD
Also known as false-position method
One of the bracketing methods for finding roots of equations by replacing the
curve by a line which gives a false position of the root by similar triangles.

For discussion purposes, the curve could represent the function f(x)=0. (1)

The above nonlinear equation can be stated as finding the value of x such that Equation (1) is
satisfied.

In the bisection method, we identify proper values of XL (lower bound value) and Xu (upper
bound value) for the current bracket, such that
f(xL)f(xu)<0

The next predicted/improved root Xr can be computed as the midpoint between XL and XU .

The new upper and lower bounds are then established, and the procedure is repeated until the
convergence is achieved (such that the new lower and upper bounds are sufficiently close to each
other).
Derivation

Steps
1. Choose XL and XU as two guesses for the root such that f(XL)*f(XU)<0
2. Estimate the root, of the equation as:

3. Now check the following:


If f(XL)*f(XR) <0, the root lies between XL and XR; XL=XL, XU=XR
If f(XL)*f(XR) >0, the root lies between XR and XU; XL=XR, XU=XU
f(XL)*f(XR) =0, the root is XR, Stop the Algorithm

4. Estimate the new root, of the equation as:

5. Find the absolute relative approximate error as:

6. Compare the absolute relative approximate error Ea, with a pre-specified relative error, Es, If
Ea>Es, go back to step# 3

Regula-Falsi Flowchart
EXAMPLES

1. Create a java program to get the roots of the equation F(x)=3x+sin x-ex using regula-falsi
method

2. A homogenous elementary liquid phase reaction 2A B is carried out in a mixed reactor and
50% conversion is attained. If the reactor is replaced by another reactor which is six times as
large and all other factors are kept the same, the % conversion that will be attained will be
near to:

Given:
-rA=KCA^2
Xa1 = 0.5
V2 = 6V1
Required:
Xa2 =?
Solution:
T= CaoXa/(KCao(1-Xa)^2 )
KCaoT= ((0.5))/(1-0.5)^2
KCaoT=2
2(6)=Xa/(1-Xa)^2
Using Regula Falsi Method:
Xa/(1-2Xa+Xa^2 )-12=0
F(0)=-12 F(0.6667) = -5.9985
F(0.5)= -10
F(0.8)=8
True Root Lies between 0.5 and 0.8
Program for #1)
Result:

For #2)
Result:

You might also like