CE 601 Numerical Methods

Tutorial – 1

Total Marks (90) 17-Aug-2019

All questions carry 15 marks each. You are encouraged to use computational tools and
softwares like MATLAB, C, C++, MATHEMATICA, MS-EXCEL, etc. for calculations and
algorithm developments. The last date of submission is 22-Aug-2019 before 5:00 PM to the
Teaching Assistants (Mr. Arghya Ghosh, Mr. Subhaprakash Rath, Mr. Nadeem Khan)

1. Find the determinant and inverse of:

1.29694 0.86487 
A 
0.21613 0.14416 

With the given precision and significant digits. Let B be the matrix obtained from A by
rounding off to four decimal places (like 1.29694 1.2969 ). Find the determinant and
inverse of B. Do A-1 and B-1 differ? If so, explain.

2. Write and check the results of a code using single precision and double precision to
evaluate f  x   cos 104 x  on the interval [0,1]. Determine how many significant figures
the values of f  x  will have.
3. The economy of a region consists of various expenditures (input) and production (output)
in following four sectors – agriculture ( x1 ), energy ( x2 ), manufacturing ( x3 ), and labor
( x3 ). The output in one sector requires input from all the four sectors. The relationships
between various sectors are given by the input-output matrix

 0.05 0.09 0.09 0.19 

 0.16 0.15 0.28 0.21
A
 0.19 0.21 0.22 0.27 
 
0.27 0.04 0.35 0.02 

where the element aij represents the input required from sector i to produce one unit from
sector j. If the total output in billion rupees is for agriculture 35, for energy 59, for
manufacturing 49, and for labor 24. Use Gauss-elimination method with appropriate
algorithm to solve and determine the input vector {x} .
4. Solve using Thomas algorithm the following tri-diagonal system:
 2 1 0 0 0   x1  100 
 1 2 1 0 0   x  150 
   2   
 0 1 2 1 0   x3   175
    
 0 0 1 2 1  x4  150 
 0 0 0 1 2   x5  100 
  x1 
x 
 
5. Solve the following linear systems Ax  b , x   2  ; using Doolittle’s algorithm.
 x3 

 x4 


1 2 3 4 10  4   2 
 1 1 2       3
3 5  5   
A ; ba    ; bb    ; bc   .
 1 1 1 2 3  3 1
 
 1 1 1 5  4  4   8

6. Computer memory can be minimised by using a different storage mode when the
coefficient matrix is symmetric. You know for symmetric matrix aij  a ji . The elements of
matrix A are placed in a vector v in the order a11 , a21 , a22 , a31 , a32 , a33 ,..., ann . Find whether by
n  n  1
storing in such symmetric mode form, you can save memory locations.
2