Scribd
Upload
17 views2 pages

Mid-Semester Question CHC503 2022

computational technique

Uploaded by

Shivani Kumari
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
17 views2 pages

Mid-Semester Question CHC503 2022

computational technique

Uploaded by

Shivani Kumari
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/ 2

INDIAN INSTITUTE OF TECHNOLOGY (INDIAN SCHOOL OF MINES) DHANBAD

MID-SEMESTER EXAMINATION
SEMESTER: MONSOON, SESSION: 2022-2023

Subject: Computational Techniques in Chemical Engineering (CHC503)

Answer all questions. Assume suitable values wherever missing

Total number of questions: 7

Total marks: 28 Time: 2 hours

1. Consider the following matrix: (2 marks)


1 2 3
4 5 6
 
7 8 9 

Is it possible to calculate the inverse of the above matrix? If yes, calculate the inverse
of the matrix. If not, explain why it is not possible.

2. Both Gauss-Siedel and Gauss elimination methods are aimed at solving system of linear
equations. However, they differ fundamentally in their approaches. State and explain
this difference (answer in 3-6 sentences). (2 marks)

3. You need to find out a root of the equation


2.1x3 −11.6 x2 + 17.5x − 6 = 0 .
You need to start with the initial points x−1 = 3 , x0 = 4 . You need to choose either (i)
Newton-Raphson method or (ii) regula-falsi (also known as the false-position) method.
Based on the supplied information, which method would you choose, and why? Also, carry
out three iterations with the chosen method. (5 marks)

4. Consider the following matrix:


 1 1/ 2 1/ 3 
1/ 2 1/ 3 1/ 4 
 
1/ 3 1/ 4 1/ 5 
(a) Calculate the condition number of the matrix (use the row-sum norm approach).
(b) Is the matrix ill-conditioned or well-conditioned? Explain (answer in 1-3
sentences).
(c) What is generally done to reduce the computational error in case of ill-conditioned
matrices (answer in 1-3 sentences)? (5 + 1.5 + 1.5 = 8 marks)

1
5. Both regula-falsi and secant methods have identical formula for calculating the refined
estimates of the roots. Then, what is the essential difference between the two methods?
(answer in 3-6 sentences) (2 marks)

6. Consider the following system of equations (6 marks)


 3 −2 1   x1   −10
 2 6 −4  x  =  44 
  2  
 −1 −2 5   x3   −26
(a) Is the above system solvable by LU decomposition method (Doolittle
decomposition variant)? If yes, solve and state the solution (i.e., values of x1, x2, x3).
If no, explain why.
(b) Is the above system solvable by Cholesky decomposition method? If yes, solve and
state the solution. If no, explain why.

7. Consider the following function f ( x ) (3 marks)

f ( x ) = −2 x 6 − 1.6 x 4 + 12 x + 1

Use bisection method to estimate that value of x where f ( x ) becomes optimum (i.e., you
need to estimate that value of x at which f ( x ) will become either maximum or minimum).
NOTE THAT YOU ARE NOT ASKED TO FIND THE ROOT OF THE EQUATION
f ( x ) = 0 . Start with a = 0 and b = 1 as the initial points for the bisection method, carry
out three iterations, and state your result (it is fine even if you do not get an accurate
estimate of x after three iterations; you need not do any further iterations).

*********************** END OF QUESTION PAPER ***********************

You might also like