Modern Education Society’s
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 program in MATLAB
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) f(x) = 0.
– a zero of the function f.
x f(x) = 0,
root of
or zero of 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
has a radius of 5.5cm. You are asked to find the
distance to which the ball will get submerged when
floating in water.
Mathematical Model: The equation that gives the
depth x to which the ball is submerged under water is
given by:
Computer Oriented Numerical Methods Page 1 of
f(x) = x3 – 0.165x2 + 0.3993 10–3 = 0
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
o False position method (Regula falsi)
Numerical Methods & Optimization
Bisection Method: Procedure -
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 xr of f(x) = 0 as the mid-
point between xl and xu as:
𝒙𝒍 + 𝒙𝒖
𝒙𝒓 =
𝟐
Step 3: Now check the following:
• If f(xl)f(xr) = 0 then the root is xr; (BINGO!)
• stop the algorithm.
– If f(xl)f(xr) < 0 then
• the root lies in interval (xl, xr); update xu as xr;
• go to step 2.
– If f(xl)f(xr) > 0 then
• the root lies in interval (xr, xu);
• update xl as xr;
• 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.)
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:
Numerical Methods & Optimization
𝒇(𝒙𝒊 )
Formula for Newton-Raphson Method: 𝒙𝒊+𝟏 = 𝒙𝒊 − ′
𝒇 (𝒙𝒊 )
Pit falls for Newton Raphson Method:
Numerical Methods & Optimization
Successive Approximation Method:
Requires only one guess value
Simplest method for programming
If function y=f(x) is given, then root is at f(x) = 0
Convert this function or rewrite function as x = g(x)
New values of x are found out by following equation
𝒙𝒊+𝟏 = 𝒈(𝒙𝒊 )
𝐴𝑐𝑐𝑢𝑟𝑎𝑐𝑦 = |𝑥𝑖+1 − 𝑥𝑖 |
ALGORITHM/FLOWCHART:
Numerical Methods & Optimization
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 Methods & Optimization
