Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
71 views

Assignment 1

This document provides a 12 question assignment on numerical methods topics like significant digits, matrix operations, Gaussian elimination, and iterative methods. The questions test understanding of concepts like determining significant digits, calculating matrix determinants, solving systems of equations, and choosing optimal parameters for iterative convergence.

Uploaded by

Bhavik Bohra
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
71 views

Assignment 1

This document provides a 12 question assignment on numerical methods topics like significant digits, matrix operations, Gaussian elimination, and iterative methods. The questions test understanding of concepts like determining significant digits, calculating matrix determinants, solving systems of equations, and choosing optimal parameters for iterative convergence.

Uploaded by

Bhavik Bohra
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

NUMERICAL METHODS

ONLINE CERTIFICATION COURSE, MOOC, NPTEL

Assignment-1 (July-October 2017)

Note: Each question is having only a correct answer.

1. Consider the following TABLE

Value/Data Number of significant digits


(1) 4563 (I) 5
(2) 0.091 (II) 3
(3) 0.620 (III) 2
(4) -70805 (IV) 4

The correct combination is


(A) 1 → I, 2 → II, 3 → III, 4 → IV
(B) 1 → IV, 2 → III, 3 → II, 4 → I
(C) 1 → IV, 2 → II, 3 → III, 4 → I
(D) 1 → I, 2 → III, 3 → II, 4 → IV

2. Consider the matrix  


0.312 0.121
0.031 0.213
If each of the intermediate calculation is rounded off up to three significant digits, then
determinant of the above matrix is
(A) 0.0628
(B) 0.0627
(C) 0.063
(D) 0.062

3. Using a computer with four significant digits with chopping, the Gaussian elimination(without
pivoting) solution of following system
0.0030x1 + 55.23x2 = 58.12
6.239x1 − 7.123x2 = 47.23
is
(A) x1 = 26.66; x2 = 1.051
(B) x1 = 8.769; x2 = 1.051
(C) x1 = 8.800; x2 = 1.000
(D) x1 = 8.771; x2 = 1.052

4. At the end of the forward elimination steps of the Gaussian elimination(without pivoting)
method on the following equations

4.2857 × 107 −9.2307 × 105 −7.887 × 103


    
0 0 x1
 4.2857 × 107 −5.4619 × 105 −4.2857 × 107 5.4619 × 105   x2   0 
  x3  = 
    
 −6.5 −0.15384 6.5 0.15384 0.007 
0 0 4.2857 × 107 −3.6057 × 105 x4 0
the resulting equations in matrix form are given by
4.2857 × 107 −9.2307 × 105 −7.887 × 103
    
0 0 x1
 0 3.7688 × 105 −4.2857 × 10 7 5.4619 × 105   x2   7.887 × 103 
  x3  =  1.19530 × 10−2
    
 0 0 −26.9140 0.579684 
0 0 0 5.62500 × 105 x4 1.90336 × 104
The determinant of the original coefficient matrix is
(A) 0.00
(B) 4.2857 × 107
(C) 5.486 × 1019
(D) −2.445 × 1020

5. The following data is given for the velocity of the rocket as a function of time. To find the
velocity at t = 21s, you are asked to use a quadratic polynomial, v(t) = at2 + bt + c to
approximate the velocity profile.

t (s) 0 14 15 20 30 35
v(t) (m/s) 0 227.04 362.78 517.35 602.97 901.67

Thecorrect set of equations


  that  will find
 a, b and c are
176 14 1 a 227.04
(A) 225 15
 1   b  =  362.78 
400 20 1 c 517.35
    
225 15 1 a 362.78
(B) 400 20 1   b  =  517.35 
900 30 1 c 602.97
    
0 0 1 a 0
(C) 225 15
 1   b  =  362.78 
400 20 1 c 517.35
    
400 20 1 a 517.35
(D) 900 30 1   b  =  602.97 
1225 35 1 c 901.67

6. The lower triangular matrix L in the following LU decomposition of matrix


    
25 5 4 1 0 0 u11 u12 u13
 10 8 16  =  l21 1 0   0 u22 u23 
8 12 22 l31 l32 1 0 0 u33
is  
1 0 0
(A) 0.40 1 0 
0.32 1.733 1
 
1 0 0
(B)  10 1 0 
8 12 1
 
1 0 0
(C)  0.32 1 0 
0.40 1.423 1
 
1 0 0
(D)  0.4 1 0 
0.32 1.5 1

2
7. To ensure that the following system of equations,
2x1 + 7x2 − 11x3 = 6
x1 + 2x2 + x3 = −5
7x1 + 5x2 + 2x3 = 17
converges
 using Gauss-Seidel
  Method,
  one can rewrite the above equations as follows:
2 7 −11 x1 6
(A) 1 2 1   x2  =  −5 
7 5 2 x 17
  3   
7 5 2 x1 17
(B) 1 2 1   x2  =  −5 
2 7 −11 x 6
  3   
7 5 2 x1 6
(C) 1 2 1   x2  =  −5 
2 7 −11 x3 17
(D) The equations can not be rewritten in a form to ensure convergence.

8. For the following system of linear equations


    
12 7 3 x1 22
 1 5 1   x2  =  7 
2 7 −11 x3 −2

with an initial solution [x1 , x2 , x3 ] = [1, 2, 1], the following table gives the values of
[x1 , x2 , x3 ] in each iteration

Iteration # x1 x2 x3
1 0.41666 1.1166 0.96818
2 0.93989 1.0183 1.0007
3 0.98908 1.0020 0.99930
4 0.99898 1.0003 1.0000

At what first iteration number would you trust at least 1 significant digit in your solution?
(A) 1
(B) 2
(C) 3
(D) 4

9. Which
 of thefollowing matrix is ill-conditioned under l1 norm ?
2 0
(A)
−1 3
 
400 −201
(B)
−800 201
 
0.913 0.659
(C)
0.457 0.330
 
1 2
(D)
1.0001 2

3
10. For the given system of equations
5x1 − x2 + x3 = 14
2x1 + 8x2 − x3 = −7
−4x1 + x2 + 10x3 = 21
Using Jacobi’s method, the values of (x1 , x2 , x3 ) with initial value x(0) = 0 i.e., x1 =
0, x2 = 0, x3 = 0 after THREE iterations corrected up to 2 decimal places is
(A) (1.88, −1.01, 3.11)
(B) (2.20, −1.31, 3.31)
(C) (1.98, −0.97, 2.97)
(D) (2.02, −1.00, 3.25)

11. Cholesky
 decomposition
 is guaranteed to which of the following matrix?
8 1 0
(A) 2 −3 7 
0 7 6
 
1 2 3
(B)  2 5 4 
3 4 9
 
4 1 −1
(C) 1 2 1 
−1 1 2
 
4 −1 1
(D) −1 2 −1 
1 1 2

12. Consider the following system of linear equations


3x1 + x2 − x3 = 6
x1 + 5x2 + 2x3 = 9
x1 + 3x2 + 6x3 = 11
If we solve the above system using successive over relaxation(SOR) method, then the
optimal value of relaxation parameter ω will be
(A) 0.0534
(B) 0.1121
(C) 0.4838
(D) 1.0

You might also like