Modern Education Society’s
Wadia College of Engineering, Pune
NAME OF STUDENT: CLASS:
SEMESTER/YEAR: ROLL NO:
DATE OF PERFORMANCE: DATE OF SUBMISSION:
EXAMINED BY: EXPERIMENT NO:
TITLE: Numerical Solution of Algebraic and Transcendental Equations.
AIM:
To write a program on Numerical Solution of Algebraic and Transcendental equations by
using bracketing methods and open methods.
OBJECTIVES:
Student must be able to:
o Develop problem solution skills using computers and numerical methods
o Understand difference between algebraic and transcendental equations
o Identify various numerical methods for roots of algebraic and transcendental
equations
o Understand graphical representation of root
o Able to draw flow chart, computer programs in C++, MATLAB, Python, etc.
PRE-REQUISITES:
Given a function f of a variable x,
find a value r such that: f(r ) = 0
• The value r is called:
– a root of the equation
f(x) = 0.
– a zero of the function
f.
Example: You are working for “DOWN THE
TOILET COMPANY” that makes floats for
commodes. The ball has a specific gravity of 0.6 and
a radius of 5.5cm. You are asked to find the distance
to which the ball will get submerged when floating
in the water.
Mathematical Model: The equation that gives the
depth x to which the ball is submerged under water
is given by:
f(x) = x3 – 0.165x2 + 0.3993 10–3 = 0
Numerical & Statistical Methods Page 1 of 7
Why Numerical Methods?
Analytical methods exist for some specific equations only. e.g., 𝒂𝒙𝟐 + 𝒃𝒙 + 𝒄 = 𝟎
Where,
−𝒃 ± √𝒃𝟐 − 𝟒𝒂𝒄
𝒙=
𝟐𝒂
What about equations like:
𝒂𝒙𝟑 + 𝒃𝒙𝟐 + 𝒄𝒙 + 𝒅 = 𝟎 and 𝒙 + 𝒔𝒊𝒏𝒙 + 𝒃𝒆𝒙 = 𝟎
Bracketing Methods (Additional contents apart from syllabus):
• Two initial guesses for the root are required.
• The two guesses must “bracket” the root i.e., on either side of the root
• Two bracketing methods to be introduced:
o Bisection method
Numerical & Statistical Methods
Bisection Method: Procedure (Pseudo-code) -
Step 1:
Choose 𝑥𝑙 and 𝑥𝑢 as two guesses
for the root such that
𝒇(𝒙𝒍 )𝒇(𝒙𝒖 ) < 0
In other words, f(x) changes sign
between 𝑥𝑙 and 𝑥𝑢
Step 2:
Estimate the root xm of f(x) = 0 as the mid-
point between xl and xu as:
𝒙𝒍 + 𝒙𝒖
𝒙𝒎 =
𝟐
Step 3: Now check the following:
• If f(xl)f(xm) = 0 then the root is xm; (BINGO!)
• stop the algorithm.
– If f(xl)f(xm) < 0 then
• the root lies in interval (xl, xm); update xu as xm;
• go to step 2.
– If f(xl)f(xm) > 0 then
• the root lies in interval (xm, xu);
• update xl as xm;
• go to step 2.
Features of Bisection Method:
• Guaranteed to converge - The bracket gets halved with each iteration.
• Only the signs of the computed function values are used.
• Relatively slow convergence: Each iteration gains one binary digit in accuracy.
(Roughly one decimal digit per 3.3 iterations.)
Numerical, Flow-chart & Program in MATLAB/PYTHON on Bisection
/ Half-Interval Search Method (Open):
(i) Accuracy based.
(ii) Iteration based.
Numerical & Statistical Methods
Numerical & Statistical Methods
OPEN METHODS:
• Open methods are based on formulas that require either:
– only a single starting value of x; or
– Two starting values that do not necessarily bracket a root.
Newton-Raphson Method:
𝒇(𝒙𝒊 )
Formula for Newton-Raphson Method: 𝒙𝒊+𝟏 = 𝒙𝒊 −
𝒇′ (𝒙𝒊 )
Pit falls for Newton Raphson Method:
Numerical & Statistical Methods
Numerical, Flow-chart & Program in MATLAB/PYTHON on Newton-
Raphson Method (N-R Method):
(i) Accuracy based.
(ii) Iteration based.
Numerical & Statistical Methods
CONCLUSION:
Comparison between results obtained by calculations and programs:
Sr. Result by
Method Error
No. Calculations Program
Difference in result is due to following reasons:
QUESTIONS FOR REVIEW:
1) Write condition for convergence for Newton-Raphson method and Successive
Approximation Method.
2) Write realistic applications of this experiment in brief (at least two applications).
Numerical & Statistical Methods
