0% found this document useful (0 votes)
37 views142 pages

Nmce Unit 01

The document outlines the course structure for Numerical Methods in Chemical Engineering at MGM's College of Engineering & Technology, detailing the importance of numerical methods for solving complex engineering problems. It discusses various mathematical procedures, sources of errors in computations, and methods for solving algebraic equations, including the bisection method. Additionally, it emphasizes the significance of error propagation and techniques to mitigate errors in numerical solutions.

Uploaded by

patelgarv18
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
37 views142 pages

Nmce Unit 01

The document outlines the course structure for Numerical Methods in Chemical Engineering at MGM's College of Engineering & Technology, detailing the importance of numerical methods for solving complex engineering problems. It discusses various mathematical procedures, sources of errors in computations, and methods for solving algebraic equations, including the bisection method. Additionally, it emphasizes the significance of error propagation and techniques to mitigate errors in numerical solutions.

Uploaded by

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

MGM’S COLLEGE OF ENGINEERING &

TECHNOLOGY, KAMOTHE.

DEPARTMENT OF CHEMICAL ENGINEERING

SUBJECT: NUMERICAL METHODS IN CHEMICAL


ENGINEERING (CHC403)

SECOND YEAR – SEMESTER IV

A.Y. - 2024-25

Subject In-charge: Prof. Anand A. Ingle


Prof. Anand A. Ingle, MGMCET
2
Prof. Anand A. Ingle, MGMCET
3
Prof. Anand A. Ingle, MGMCET
4
INTRODUCTION TO NUMERICAL METHODS
⦁ Numerical methods are mathematical techniques used for
solving mathematical problems that cannot be solved or are
difficult to solve. The numerical solution is an approximate
numerical value for the solution.
⦁ Although numerical solutions are an approximation, they can
be very accurate.

Prof. Anand A. Ingle, MGMCET


⦁ Mathematical models are an integral part in solving
engineering problems. Many times, these mathematical
models are derived from engineering and science principles,
while at other times the models may be obtained from
experimental data.
⦁ Mathematical models generally result in need of using
mathematical procedures that include but are not limited to
(A) differentiation,
(B) nonlinear equations,
(C) simultaneous linear equations,
(D) curve fitting by interpolation or regression,
(E) integration, and 5
(F) differential equations.
⦁ These mathematical procedures may be suitable
to be solved exactly as you must have
experienced in the series of calculus courses you
have taken, but in most cases, the procedures
need to be solved approximately using
numerical methods.

Prof. Anand A. Ingle, MGMCET


⦁ Let us see an example of such a need from a
real-life physical problem.
⦁ To make the fulcrum (Figure 1) of a bascule
bridge, a long hollow steel shaft called the
trunnion is shrink fit into a steel hub. The
resulting steel trunnion-hub assembly is then
shrink fit into the girder of the bridge. 6
Prof. Anand A. Ingle, MGMCET
This is done by first immersing the trunnion
in a cold medium such as a dry-ice/alcohol
mixture. After the trunnion reaches the
steady state temperature of the cold medium,
the trunnion outer diameter contracts. The
trunnion is taken out of the medium and slid 7
through the hole of the hub (Figure 2).
Prof. Anand A. Ingle, MGMCET
When the trunnion heats up, it expands and
creates an interference fit with the hub. In 1995,
on one of the bridges in Florida, this assembly
procedure did not work as designed. Before the
trunnion could be inserted fully into the hub, the
trunnion got stuck. Luckily, the trunnion was
taken out before it got stuck permanently.
Otherwise, a new trunnion and hub would needed 8

to be ordered at a cost of $50,000.


⦁ A hollow trunnion of outside diameter
12.363” is to be fitted in a hub of inner
diameter 12.358" .
⦁ The trunnion was put in dry ice/alcohol
mixture (temperature of the fluid - dry
ice/alcohol mixture is -108° F) to contract the

Prof. Anand A. Ingle, MGMCET


trunnion so that it can be slid through the
hole of the hub. To slid the trunnion without
sticking, a diametrical clearance of at least
0.01" is required between the trunnion and
the hub.
⦁ Assuming the room temperature is 80° F , is
immersing the trunnion in dry-ice/alcohol
mixture a correct decision? 9
10
11
12
13
14
APPROXIMATIONS AND ERRORS
⦁ Approximation is unavoidable in mathematical
modeling the real world phenomena
• Approximation leads to errors
• Estimating the errors in computation is

Prof. Anand A. Ingle, MGMCET


necessary for reliability of computed results

15
⦁ Accuracy : It refers to how closely the measured or
computed value matches with the true value.
⦁ Precision: It refers to how closely the computed or
measured values agree with each other in repeated
computation or measurement.

Prof. Anand A. Ingle, MGMCET


as shown here
(a) inaccurate and imprecise,
(b) accurate and imprecise,
(c) inaccurate and precise,
(d) accurate and precise

16
ERRORS IN COMPUTATIONS
Error: The deviation from an expected or true
value. True value may not be known always!

E.g. Area of a rectangle A= LxB=12x10=120 cm2

Prof. Anand A. Ingle, MGMCET


But by measurement LmxBm=11.9x10.1
The computed value Ac= 120.19 cm2

Error , E=|A- Ac |=0.19.This error is known as


Absolute Error.

When it is compared with the actual value or true


value, it is known as relative error,
17
ERRORS IN NUMERICAL SOLUTIONS
⦁ There are three major sources of error in
computation:
1. human errors
2. truncation errors and

Prof. Anand A. Ingle, MGMCET


3. round-off errors.

1. Human errors
Typical human errors are arithmetic errors, and/or
programming errors: These errors can be very
hard to detect unless they give obviously
incorrect solution. In discussing errors, we shall
assume that human errors are not present.
18
2. Round Off error
⦁ A computer can only represent a number
approximately.
⦁ For example, a number like1/3 may be represented as
0.333333 on a PC.

Prof. Anand A. Ingle, MGMCET


Then the round off error in this case is
1/3 - 0.333333= 0.00000033
Then there are other numbers that cannot be
represented exactly.

For example, and √2 are numbers that need to be


approximated in computer calculations.

19
3. Truncation error
Truncation error is defined as the error caused by
truncating a mathematical procedure.
For example, the Maclaurin series for ex is given as

Prof. Anand A. Ingle, MGMCET


This series has an infinite number of terms but
when using this series to calculate ex , only a
finite number of terms can be used.

20
Prof. Anand A. Ingle, MGMCET
21
Prof. Anand A. Ingle, MGMCET
22
Error propagation in numerical methods refers to how errors in initial
data or intermediate calculations accumulate and affect the accuracy of
the final result. Here's a breakdown of key concepts:

Prof. Anand A. Ingle, MGMCET


Types of Errors
•Inherent Errors: These exist in the initial data itself, arising from
measurements, approximations, or previous computations.
•Round-off Errors: Occur due to the finite precision of computers,
which can only store a limited number of digits.
•Truncation Errors: Result from approximating a complex
mathematical expression with a simpler one, like truncating an infinite
23
series.
How Errors Propagate
•Arithmetic Operations: Errors can grow through addition, subtraction, multiplication,
and division. For instance, adding two numbers with uncertainties increases the absolute
uncertainty of the result.
•Function Evaluation: Evaluating a function with an uncertain input leads to uncertainty
in the output. The function's sensitivity determines how much the error is amplified.

Prof. Anand A. Ingle, MGMCET


•Iterative Processes: In methods like root-finding or solving differential equations, errors
can accumulate over multiple iterations, potentially leading to significant deviations from
the true solution.

Techniques to Analyze Error Propagation


•Analytical Methods: Using calculus and statistical techniques to derive formulas that
estimate how errors propagate through specific calculations.
•Numerical Methods: Employing computational approaches to simulate error
propagation, often used when analytical solutions are complex or unavailable.
•Sensitivity Analysis: Studying how the output of a model varies with changes in input
24
parameters, revealing which inputs contribute most to the overall error.
Importance of Error Propagation
Understanding error propagation is crucial in numerical methods because it helps:
•Assess the reliability of results: By estimating the error bounds, we can determine how
much confidence to place in the computed solution.
•Choose appropriate methods: Some methods are more susceptible to error
propagation than others, so understanding this helps select the most suitable approach.

Prof. Anand A. Ingle, MGMCET


•Improve algorithm stability: By identifying sources of error amplification, we can design
algorithms that minimize error growth.
Mitigating Error Propagation
While errors are inevitable, several strategies can help minimize their impact:
•Use higher precision arithmetic: Employing more digits in calculations reduces round-
off errors.
•Choose stable algorithms: Opt for methods known to be less sensitive to error
propagation.
•Reformulate mathematical expressions: Rewriting formulas can sometimes reduce
error accumulation.
25
•Employ error correction techniques: Some methods include built-in mechanisms to
detect and correct errors.
SOLUTION OF ALGEBRAIC AND
TRANSCENDENTAL EQUATIONS.

⦁ Suppose we have function f(x) & we have to find the


values of x for which f(x) = 0.

Prof. Anand A. Ingle, MGMCET


⦁ The solution (values of x)are known as the roots of the
equation f(x) = 0.

⦁ Roots of the equations are may be real or complex.

26
Prof. Anand A. Ingle, MGMCET
27
BISECTION METHOD
OR BINARY SEARCH METHOD
OR INTERVAL HALVING METHOD

Prof. Anand A. Ingle, MGMCET


⦁ X= (a+b)/2
⦁ Where,
a and b are limits
x is new solution

28
Prof. Anand A. Ingle, MGMCET
29
Prof. Anand A. Ingle, MGMCET
30
Prof. Anand A. Ingle, MGMCET
31
Prof. Anand A. Ingle, MGMCET
32
Prof. Anand A. Ingle, MGMCET
33
Prof. Anand A. Ingle, MGMCET
34
Prof. Anand A. Ingle, MGMCET
35
Prof. Anand A. Ingle, MGMCET
36
Prof. Anand A. Ingle, MGMCET
37
Q. SHOW PROGRESS OF BISECTION METHOD
USING GRAPHICAL REPRESENTATION
⦁ After a roots of f(x)=0 has been bracketed in the
interval ( a, b),bisection method can be used to
close in on it.
⦁ Bisection method accomplishes this by

Prof. Anand A. Ingle, MGMCET


successfully halving (coincidence) the interval
until it becomes sufficiently small.
⦁ Bisection method is also known as “interval
halving method” .
⦁ Bisection method is not the fastest method
available for finding the roots of a function, but it
is most reliable method.

38
⦁ We assume that f(x) is a function that is real-valued
and that x is a real variable.
⦁ Suppose that f(x) is continuous on the interval
a <= x <= b and that f(a).f(b)<0. when this is the case,
f(x) will have opposite sign at the end points of the
interval (a, b) as shown in figure below.

Prof. Anand A. Ingle, MGMCET


⦁ If f(x) is continuous and has a solution between the
points x=a and x=b then either f(a)>0 and f(b)<0 or
f(a)<0 and f(b)>0.
⦁ In other words if this is a solution between x=a and x=b
then f(a).f(b) < 0.

39
Prof. Anand A. Ingle, MGMCET
40
GRAPHICAL METHOD
⦁ The method of finding solution with bisection method is
illustrated in figure.
⦁ It start by finding points a and b, that define the
interval, where a solution exists.
The midpoint of the interval xs1 is then taken as the

Prof. Anand A. Ingle, MGMCET



first estimate for numerical solution. The true solution
is either in the portion between point a and xs1 or in the
portion between points xs1 and b.
⦁ If the solution obtained is not accurate enough a new
interval a new interval that contains the true solution
and its midpoint is taken as new (second) estimate of
the numerical solution.
⦁ The procedure repeated until the numerical solution is
accurate enough according to certain criterion that is
selected 41
Prof. Anand A. Ingle, MGMCET
42
Prof. Anand A. Ingle, MGMCET
43
Prof. Anand A. Ingle, MGMCET
44
Prof. Anand A. Ingle, MGMCET
45
EXAMPLE 1
Prof. Anand A. Ingle, MGMCET
46
Prof. Anand A. Ingle, MGMCET
47
EXAMPLE 2
Prof. Anand A. Ingle, MGMCET
48
EXAMPLE 3
Prof. Anand A. Ingle, MGMCET
49
Prof. Anand A. Ingle, MGMCET
50
FOR PRACTICE
Prof. Anand A. Ingle, MGMCET
51
Prof. Anand A. Ingle, MGMCET
52
Prof. Anand A. Ingle, MGMCET
53
Prof. Anand A. Ingle, MGMCET
54
Prof. Anand A. Ingle, MGMCET
55
Prof. Anand A. Ingle, MGMCET
56
Prof. Anand A. Ingle, MGMCET
57
PROBLEMS FOR PRACTICE
PROBLEMS FOR PRACTICE
1. Find the positive root of 𝑥 3 − 𝑥 = 1; correct to four
decimal places by bisection method.(Ans = 1.32475)
2. Assuming that a root of 𝑥 3 − 9𝑥 + 1 = 0 lies in the
interval (2,4), find the root by bisection method.
(Ans=2.9429)
3. Find the positive root of x – cos X = 0; by bisection
method. (Ans=0.73888)
4. Find the positive root of 𝑥 4 − 𝑥 3 − 2𝑥 2 − 6𝑥 − 4 = 0 by
bisection method. (Ans=2.7315)
5. Using bisection method, find the negative root of
𝑥 3 -4x+9=0 by bisection method. (Ans: -2.7065)

58
FALSE POSITION METHOD OR
REGULAR FALSI METHOD OR
LINEAR INTERPOLATION METHOD

Prof. Anand A. Ingle, MGMCET


59
Prof. Anand A. Ingle, MGMCET
60
Prof. Anand A. Ingle, MGMCET
61
62
Prof. Anand A. Ingle, MGMCET
63
Prof. Anand A. Ingle, MGMCET
64
Prof. Anand A. Ingle, MGMCET
65
Prof. Anand A. Ingle, MGMCET
66
Prof. Anand A. Ingle, MGMCET
67
Prof. Anand A. Ingle, MGMCET
68
Prof. Anand A. Ingle, MGMCET
69
Prof. Anand A. Ingle, MGMCET
70
FOR PRACTICE
Prof. Anand A. Ingle, MGMCET
71
Prof. Anand A. Ingle, MGMCET
72
Prof. Anand A. Ingle, MGMCET
73
Prof. Anand A. Ingle, MGMCET
74
Prof. Anand A. Ingle, MGMCET
75
Prof. Anand A. Ingle, MGMCET
76
Prof. Anand A. Ingle, MGMCET
77
Prof. Anand A. Ingle, MGMCET
78
Prof. Anand A. Ingle, MGMCET
79
Prof. Anand A. Ingle, MGMCET
80
Prof. Anand A. Ingle, MGMCET
81
PROBLEMS FOR PRACTICE
1. Solve for positive root of 𝑥 3 − 4𝑥 + 1 = 0 by Regula
Falsi method. [Ans: 0.25410]
2. Find approximate root of 𝑥 𝑙𝑜𝑔10 x -1.2 =0 by False
Position Method. [Ans: 2.7405]
3. Find the positive root of 𝑥 3 = 2𝑥 + 5 by False Position
method. [Ans: 2.0945]
4. Solve for positive root of x - Cos x =0 by Regula Falsi
method. [Ans: 0.7391]
5. Solve the equation x tan x = -1 by Regula Falsi
method starting with a=2.5 and b= 3 correct to 3
decimal places.[Ans: 2.798]
6. Find a positive root of x. 𝑒 𝑥 =2 by the method of Fasle
Position. [Ans: 0.85261]
82
Prof. Anand A. Ingle, MGMCET
83
OPEN METHODS
Prof. Anand A. Ingle, MGMCET
84
Prof. Anand A. Ingle, MGMCET
85
Prof. Anand A. Ingle, MGMCET
86
Prof. Anand A. Ingle, MGMCET
87
Prof. Anand A. Ingle, MGMCET
88
Prof. Anand A. Ingle, MGMCET
89
Prof. Anand A. Ingle, MGMCET
90
Prof. Anand A. Ingle, MGMCET
91
Prof. Anand A. Ingle, MGMCET
92
Prof. Anand A. Ingle, MGMCET
93
Prof. Anand A. Ingle, MGMCET
94
Prof. Anand A. Ingle, MGMCET
95
Prof. Anand A. Ingle, MGMCET
96
Prof. Anand A. Ingle, MGMCET
97
Prof. Anand A. Ingle, MGMCET
98
Prof. Anand A. Ingle, MGMCET
99
SECANT METHOD OR
CHORD METHOD
⦁ Algorithm
1. Choose i = 1

Prof. Anand A. Ingle, MGMCET


2. Start with guesses xi-1 and xi
3. Use the formula

4. Find

5. Choose i=2 and continue iteration 100


Prof. Anand A. Ingle, MGMCET
101
Prof. Anand A. Ingle, MGMCET
102
Prof. Anand A. Ingle, MGMCET
103
Prof. Anand A. Ingle, MGMCET
104
Prof. Anand A. Ingle, MGMCET
105
https://atozmath.com/example/CONM/Bisection.aspx?q=se&q1=E3

106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
Prof. Anand A. Ingle, MGMCET
125
Prof. Anand A. Ingle, MGMCET
126
Prof. Anand A. Ingle, MGMCET
127
Prof. Anand A. Ingle, MGMCET
128
ITERATION METHOD OR
SUCCESSIVE APPROXIMATION METHOD

Prof. Anand A. Ingle, MGMCET


129
Prof. Anand A. Ingle, MGMCET
130
Problem 1: solve 𝑒 𝑥 − 3𝑥 = 0 by the method of iteration.
Solution: let 𝑓 𝑥 = 𝑒 𝑥 − 3𝑥 = 0
𝑓 0 = 1 + 𝑣𝑒 ; 𝑓 1 = 𝑒 − 3 = −𝑣𝑒
Root lies between 0 and 1
1
Let 𝑥 = 𝑒𝑥 = ∅ 𝑥
3
1 1
∅′ 𝑥 = 𝑒 𝑥 𝑎𝑛𝑑 ∅′ 0 = ; ∅′ 1 < 1
3 3
In the interval (0.1) |∅′ 𝑥 |<1
1 1
Select 𝑥0 = 0.6, 𝑥1 = 𝑒 𝑥0 = 𝑒 0.6 = 0.60737
3 3
1 1
𝑥2 = 𝑒 0.60737 = 0.61187; 𝑥3 = 𝑒 0.61187 = 0.61452;
3 3
1 1
𝑥4 = 𝑒 0.1452 = 0.61626; 𝑥5 = 𝑒 0.61626 = 0.61733;
3 3
1 0.61733 1 0.61799
𝑥6 = 𝑒 = 0.61799; 𝑥7 = 𝑒 = 0.61840; 𝑥8 =
3 3
1 0.61840 1 1
𝑒 = 0.61865; 𝑥9 = 𝑒 0.61865 = 0.61881; 𝑥10 = 𝑒 0.61881 =
3 3 3
1 0.61891 1 0.61897
0.61891; 𝑥11 = 𝑒 = 0.61897; 𝑥12 = 𝑒 = 0.61900;
3 3
1 131
𝑥13 = 𝑒 0.61900 = 0.61902
3
132
133
134
135
136
137
Prof. Anand A. Ingle, MGMCET
138
Prof. Anand A. Ingle, MGMCET
139
Prof. Anand A. Ingle, MGMCET
140
Prof. Anand A. Ingle, MGMCET
141
CHEMICAL ENGINEERING APPLICATION

⦁ Bisection Method

Prof. Anand A. Ingle, MGMCET


⦁ Newton's Method

⦁ Secant Method

142

You might also like