Sample Examination Questions

Kwame Nkrumah University of Science and Technology

Institute of Distance Learning(IDL)
College of Engineering
Third Year [Classes: BSc(Mechanical Eng, Electrical Eng, Computer Eng, Civil Eng)]
Math 351: Numerical Analysis

INDEX NUMBER:

Instructions:
1. Attempt ALL Questions.

2. Make sure your INDEX NUMBER is written correctly above.

3. SHADE the correct answer on the ANSWER SHEET provided and CIRCLE it on the
QUESTION PAPER.
4. You are expected to submit the both the question paper and answer sheet after the
exams.
5. If you are convinced that the answer options for a particular question does not
include the correct answer, SHADE option E on the ANSWER SHEET and WRITE
what you think is the correct answer on the QUESTION PAPER with a remark.
6. You may use any available scientific and/or programmable calculator, to aid you in
your computations. However you are reminded and encouraged to use it responsibly
since you may be sanctioned appropriately if caught using your programmable
calculator in any other way apart from the intended purpose as a computational aid
7. Failure to comply with the stated instructions would attract appropriate sanctions.

Best Wishes!

1
Use the following set of algebraic equations to answer questions 1
and 2.

2x1 + 3x2 − x3 = 4
x1 − 2x2 + x3 = 6
x1 − 12x2 + 5x3 = 10

1. The above system of equations has: 3. The significance of perfoming forward elimina-
tion when using the naive Gaussian elimination
(a) a unique solution
method is to reduce the coefficient matrix to
(b) no solutions one of the following matrices.
(c) infinitely many solutions (a) diagonal
(d) the trivial solution (b) identity
(e) None of the above. (c) lower triangular
(d) upper triangular
(e) None
4. During the process of forward elimination steps
in naive Gaussian elimination for a set of equa-
tions [A] [X] = [C], encountering division by
2. Find the solution to the above system. zero implies the coefficient matrix [A]
(a) (0, 5, −13)T (a) is invertible
T
(b) (5, 0, 13) (b) is nonsingular
T
(c) (0, 10, 26) (c) may be singular or nonsingular
(d) Cannot be solved (d) is singular
(e) None of the above. (e) None

Choose the most correct answer in the following set of questions

5. Given that the profile of velocity of a machine 6. Using a four significant digits with chopping
at t = 21 s is estimated by a quadratic poly- at every stage of calcualtion, find the solution
nomial, v(t) = at2 + bt + c, what will be the to the system below using the naive Gaussian
correct set of equations that will help calculate elimination method
the values of a, b and c, using the data below?
t (s) 0 14 15 20 30 35 0.0030x1 + 55.23x2 = 58.12
v(t) 0 227.04 362.78 517.35 602.97 901.67 6.239x1 − 7.123x2 = 47.23
(m/s)
    
176 14 1 a 227.04 (a) x1 = 26.66; x2 = 1.051
(a)  225 15 1   b  =  362.78 
400 20 1 c 517.35 (b) x1 = 8.769; x2 = 1.051
    
225 15 1 a 362.78 (c) x1 = 8.800; x2 = 1.000
(b)  400 20 1   b  =  517.35 
(d) x1 = 8.771; x2 = 1.052
900 30 1 c 602.97

0 0 1

a
 
0
 (e) None
(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
(e) None
2
 7. At the end of the forward elimination steps of the naive Gaussian elimination method on the following
equations

4.2857 × 107 −9.2307 × 105 −7.887 × 103

    
0 0 c1
 4.2857 × 107 −5.4619 × 105 −4.2857 × 107 5.4619 × 105   c2   0 
  c3  = 
    
 −6.5 −0.15384 6.5 0.15384 0.007 
0 0 4.2857 × 107 −3.6057 × 105 c4 0

the resulting equations in matrix form are given by

4.2857 × 107 −9.2307 × 105 −7.887 × 103

     
0 0 c1
5 7
 0 3.7688 × 10 −4.2857 × 10 5.4619 × 105   c2   7.887 × 103 
  c3  =  1.19530 × 10−2
     
 0 0 −26.9140 0.579684 
0 0 0 5.62500 × 105 c4 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
(e) None

Use the following set of linear equations to answer questions 8 to

19.
The naive Gaussian elimination method is used to solve the following set of linear equations.

x1 + x2 + 3x4 = 4
2x1 + x2 − x3 + x4 = 1
3x1 − x2 − x3 + 2x4 = −3
−x1 + 2x2 + 3x3 − x4 = 4

The following triangularised form (with some missing values) is obtained at the end of the forward
elimination stage     
1 1 0 A14 x1 4
 0 A22 −1 A23   x2   b2 
  = 
 0 0 A33 13   x3   b3 
0 0 0 A44 x4 −13

8. The value of A14 is 9. The value of A22 is

(a) -13 (a) -13
(b) -5 (b) -5
(c) -1 (c) -1
(d) 3 (d) 3
(e) -7 (e) -7

3
 10. The value of A23 is 15. What method would be employed to solve the
triangularised system?
(a) -13
(b) -5 (a) Forward substitution method
(c) -1 (b) Forward elimination method
(d) 3 (c) Back substitution method

(e) -7 (d) Back elimination method

(e) Reordering method
11. The value of A44 is
16. Solving with the method of choice, x1 is
(a) -13
(a) -3
(b) -5
(b) 2
(c) -1
(c) 0
(d) 3
(d) 3
(e) -7
(e) 1
12. The value of A33 is
17. Solving with the method of choice, x2 is
(a) -13
(a) -3
(b) -5
(b) 2
(c) -1
(c) 0
(d) 3
(d) 3
(e) -7
(e) 1
13. The value of b2 is 18. Solving with the method of choice, x3 is
(a) -13 (a) -3
(b) -5 (b) 2
(c) -1 (c) 0
(d) 3 (d) 3
(e) -7 (e) 1
14. The value of b3 is 19. Solving with the method of choice, x4 is
(a) -13 (a) -3
(b) -5 (b) 2
(c) -10 (c) 0
(d) 3 (d) 3
(e) 13 (e) 1

Use the following set of linear equations to answer questions 20 to

27.
The following set of linear equations is solved with Gaussian elimination with partial pivoting

2x1 − 3x2 + 2x3 = 5

− 4x1 + 2x2 − 6x3 = 14
2x1 + 2x2 + 4x3 = 8

The following triangularised form (with some missing values) is obtained at the end of the forward

4
elimination stage     
A11 2 −6 x1 b1
 0 A22 1   x2  =  15 
0 0 A33 x3 b3

20. What is the value of A11 ? 24. What is the value of b3 ?

(a) 3 (a) 14
(b) -4 (b) 15
(c) -1 (c) 22
(d) -1/3 (d) 3
(e) 7 (e) 14
25. Solving with an appropriate solution technique
21. What is the value of A22 ? of your choice, x1 is
(a) 3 (a) 109
(b) -4 (b) 27
(c) -1 (c) -66
(d) -1/3 (d) 30
(e) 7 (e) -30
26. Solving with an appropriate solution technique
22. What is the value of A33 ? of your choice, x2 is
(a) 3 (a) 109
(b) -4 (b) 27
(c) -1 (c) -66
(d) -1/3 (d) 30
(e) 7 (e) -30
27. Solving with an appropriate solution technique
23. What is the value of b2 ? of your choice, x3 is
(a) 14 (a) 109
(b) 15 (b) 27
(c) 22 (c) -66
(d) 3 (d) 30
(e) 14 (e) -30

Choose the most accurate answer to the following questions

28. The [L] [U ] LU decomposition method is com-

putationally more efficient than naive Gaussian
elimination for solving
(a) a single set of simultaneous linear equa-
tions.
(b) multiple sets of simultaneous linear
equations with different coefficient ma-
trices and the same right hand side vec-
tors.
(c) multiple sets of simultaneous linear 5
equations with the same coefficient ma-
trix and different right hand side vec-
tors.
(d) less than ten simultaneous linear equa-
tions.
(e) None
 29. The lower triangular matrix [L] in the [L] [U ] 31. For a given 2000×2000 matrix [A], assume that
decomposition
 of the matrix given below it takes about 15 seconds to find the inverse
25 5 4 of [A] by the use of the [L] [U ] decomposition
 10 8 16  is method, that is, finding the [L] [U ] once, and
8 12 22 then doing forward substitution and back sub-
  stitution 2000 times using the 2000 columns of
1 0 0
 0.40000 the identity matrix as the right hand side vec-
(a) 1 0 
tor. The approximate time, in seconds, that it
0.32000 1.7333 1
  will take to find the inverse if found by repeated
25 5 4 use of the naive Gaussian elimination method,
(b)  0 6 14.400  that is, doing forward elimination and back sub-
0 0 −4.2400 stitution 2000 times by using the 2000 columns

1 0 0
 of the identity matrix as the right hand side
(c)  10 1 0  vector is most nearly
8 12 0 (a) 300
 
1 0 0 (b) 1500
(d)  0.40000 1 0  (c) 7500
0.32000 1.5000 1
(d) 30000
(e) None
(e) None
30. The upper triangular matrix [U ] in the [L] [U ]
decomposition of the matrix given below is?
 
25 5 4
 0 8 16 
0 12 22

 
1 0 0
(a)  0.40000 1 0 
0.32000 1.7333 1
 
25 5 4
(b)  0 6 14.400 
0 0 −4.2400
 
25 5 4
(c)  0 8 16 
0 0 −2
 
1 0.2000 0.16000
(d)  0 1 2.4000 
0 0 −4.240
(e) None

Use the following set of linear equations to answer questions 32 to

47.
The naive Gaussian elimination method is used to solve the following set of linear equations.

3x1 − x2 − x3 + 3x4 = −3
2x1 + x2 − x3 + x4 = 4
3x1 − x2 − x3 + 2x4 = 1
x1 + x2 + 3x4 = 1

The following triangularised form (with some missing values) is obtained at the end of the forward

6
elimination stage
    
1 0 0 0 3 −1 −1 U14 x1 −3
 −1/3 1 0 0   0 U22 8/3 −1/3   x2   4 
   = 
 L31 1 1 0  0 0 −3 U34   x3   1 
1/3 L42 L43 1 0 0 0 U44 x4 1

32. The value of L31 is 37. The value of U34 is

(a) 4/5 (a) 0
(b) 3/5 (b) 13/5
(c) 2 (c) 2
(d) 2/3 (d) 2/3
(e) 5/3 (e) 5/3

33. The value of L42 is 38. The value of U44 is

(a) 4/5 (a) 0

(b) 3/5 (b) 13/5
(c) 2 (c) 2
(d) 2/3 (d) 2/3
(e) 5/3 (e) 5/3

39. What method would be employed to solve the

34. The value of L31 is
intermediary triangularised system Ly = b
(a) 4/5
(a) Forward substitution method
(b) 3/5
(b) Forward elimination method
(c) 2
(c) Back substitution method
(d) 2/3
(d) Back elimination method
(e) 5/3
(e) Reordering method

35. The value of U14 is 40. Solving with the method of choice, y1 is
(a) 4/5 (a) -3
(b) 3/5 (b) 3
(c) 2 (c) 0
(d) 2/3 (d) 0.4
(e) 5/3 (e) -0.3

36. The value of U22 is 41. Solving with the method of choice, y2 is
(a) 0 (a) -3
(b) 13/5 (b) 3
(c) 2 (c) 0
(d) 2/3 (d) 0.4
(e) 5/3 (e) -0.3

7
 42. Solving with the method of choice, y3 is 45. Using appropriate solution technique of your
choice, x2 is
(a) -3
(b) 3 (a) -0.1538
(c) 0 (b) 2.5
(d) 0.4 (c) 0

(e) -0.3 (d) 1.7692

(e) -0.3077
43. Solving with the method of choice, y4 is 46. Using appropriate solution technique of your
choice, x3 is
(a) -3
(b) 3 (a) -0.1538
(c) 0 (b) 2.5

(d) 0.4 (c) 0

(e) -0.3 (d) 1.7692
(e) -0.3077
44. Using appropriate solution technique of your 47. Using appropriate solution technique of your
choice, x1 is choice, x4 is
(a) -0.1538 (a) -0.1538
(b) 2.5 (b) 2.5
(c) 0 (c) 0
(d) 1.7692 (d) 1.7692
(e) -0.3077 (e) -0.3077

Answer the following questions

48. Find α > 0 and β > 0 so that the matrix 49. Consider y = f (x) = x3 over the range
1 ≤ x ≤ 3. Use the three nodes x0 = 1, x1 = 2
and x3 = 3 to construct a quadratic interpola-
 
4 α 1
A =  2β 5 4  is strictly diagonally dom- tion polynomial P2 (x) using the Lagragian in-
β 2 α terpolation. P2 (x) = .
inant. (a) −6x2 − 11x − 6
1
(a) α< 2 and α + 2 < β < 3 (b) −6x2 + 11x + 6
1
(b) β< 2 and β + 2 < α < 3 (c) 6x2 − 11x + 6
(c) β < 1 and β + 2 < α < 3 (d) 6x2 + 11x − 6
(d) α < 1 and α + 2 < β < 3 (e) None of the above
(e) None
50. A matrix is said to be positive definite if and
only if the determinant of all the leading prin-
cipal minors are .
(a) less than zero
(b) greater than zero
(c) less than or equal to zero
(d) greater than or equal to zero
(e) None of the above

8
 51. A matrix A is said to be positive definite if and
only if all the follo
(a) 7500 wing holds except
(b) A is symmetric
(c) A is diagonally dominant
(d) the diagonal elements of A are all
greater or equal to zero
(e) the diagonal elements of A are all
greater than zero
(f) None

Use the following information to answer questions 52–55.

A tridiagonal matrix T can be factorized into the product of two matrices, LU using the following
algorithm:
Set ui = a1
F or i = 2, 3, ..., n do
ci
Ii = , ui = ai − Ii bi−1
Uui−1
Constructing a tridiagonal system from the following set of equations:
3x1 − 4x2 = −2
6x1 − 17x2 + 11x3 = −1
8x2 + x3 = 3

52. Find the lower triangular matrix, L. 53. Find the upper triangular matrix,U .
   
1 0 0 4 3 0
(a) −2 1 0 (a) 0 11/4 1 
0 −1 1 0 0 27/11
   
1 0 0 3 2 0
(b) −1/4 1 0 (b) 0 −8 2
0 −16/11 1 0 0 3
   
3 0 0 1 −8 0
(c) 2 −4 0 (c) 0 1 3
0 −1 1 0 0 1
   
1 0 0 3 2 0
(d) 2 1 0 (d) 0 −8 2 
0 −1 1 0 0 −1
(e) None (e) None

9
54. Find the vector y, if Ly = b 55. Find the solution x such that U x = y
   
2 2/3
(a) −5 (a) −3/9
−2 19/9
   
2 13/6
(b) −3 (b)  11/4 
0 −2/3
   
2 0
(c)  −1/2  (c)  2/3 
25/11 −1/27
   
2 13/36
(d) −2 (d) 11/24
−5 −2/3
(e) None (e) None

Use the following to answer questions 56–61.

 
1 0 −1
Given the matrix, A =  0 1 1 , find all value(s) of α for which
−1 1 α

56. A is singular. 58. A is symmetric

(a) -3 (a) α≥1
(b) 2 (b) α>0
(c) 3 (c) α−arbitrary
(d) -2 (d) α≤ 1
(e) None (e) None
57. A is strictly diagonally dominant. 59. A is positive definite.
(a) −2 < α < 2 (a) α>3
(b) α > 2 or α < −2 (b) α > −3
(c) α≥ 2 or α≤ −2 (c) α>2
(d) α−arbitrary (d) α > −2
(e) None (e) None

60. Which of the following matrices has 1 as its 61. A square matrix [A] is said to be a Lower tri-
leading diagonal elements? angular matrix if:
(a) Lower triangular matrix of Cholesky (a) aij = 0, i = j
factorization (b) aij = 0, i 6= j y
(b) Upper triangular matrix of Cholesky (c) aij = 0, i < j
factorization
(d) aij = 0, i > j
(c) Lower triangular matrix of Tridiagonal
factorization (e) None

(d) Upper triangular matrix of Tridiagonal

factorization
(e) None
10
Use the following information to answer questions 62 to 65.
The following system is a symmetric positive definite system which can be solved using Cholesky factor-
ization,
A = HH T
(10 + 41 p)x1 − 4x2 + 4x3 = −8
−4x1 + 17x2 + 11x3 = −6
4x1 + 11x2 + 2qx3 = −32
 
2 β −1 64. Find y such that Hy = b
62. Find β so that A =  β 2 1  is posi-  
3
−1 1 4 1
tive definite. (a)
12
(a) −4 < β < 4  
2
3
(b) −2 < β < 2 (b)  −1 
(c) −2≤α≥ 2 3 −12
 
(d) −4≤α≥4 −2
(c)  −2 
(e) None
−12
 
−2
(d)  −1 
−32/2
(e) None

65. Find the solution, x such that H T x = y

 
245/64
(a)  89/16 
−31/4
 
  2
4 0 0 (b) 4
63. Find the values of p and q if H = −1 4 0 −6
1 3 2  
64/245
(c) −16/89
(a) p = 24 and q = 7
−31/4
(b) p = 2 and q = 14  
1
(c) p = 12 and q = 7 (d) 2
(d) p = 17 and q = 12 −3
(e) None (e) None

Use the following information to answer questions 66–69.

Six computers with different processor speed were given a programming task. The time each computer
used in completing the task was recorded. The following table contains data of speed of a computer with
respect to time.
Time, t(s) 1 1.5 3 4.5 5.2 7
Speed, V (Ghz) 2.4 2.0 1.8 1.6 1.2 1.0
66. Find the function L0 (t)
1
(a) − (t − 4.5)(t − 5.2)
1.05
1
(b) (t − 3)(t − 5.2)
3.3
(c) 3.3(t − 3)(t − 5.2) 11
1
(d) (t − 4.5)(t − 5.2)
3.3
(e) None
 67. Find the function L1 (t) 68. Find the function L2 (t)
1 1
(a) − (t − 4.5)(t − 5.2) (a) (t − 3)(t − 5.2)
1.05 1.54
(b) −1.05(t − 4.5)(t − 5.2) 1
(b) (t − 3)(t − 5.2)
1 1.55
(c) − (t − 3)(t − 5.2) 1
1.05 (c) (t − 3)(t − 5.2)
1 1.34
(d) − (t − 3)(t − 5.2) 1
1.54 (d) − (t − 3)(t − 4.5)
(e) None 1.8
(e) None
69. Find the approximate speed of a computer that
will complete the task in time t = 3.4s.
(a) 1.75Ghz
(b) 1.73Ghz
(c) 1.1Ghz
(d) 1.83Ghz
(e) None

Use the following nonlinear system to answer questions 70 – 76

The iterative methods for solving systems of linear equations can be given by
x(k) = Bx(k−1) + d , k=1, 2,... where B = −D−1 (L + U ) and d = D−1 b for Jacobi Method and
B = −(D + L)−1 U and d = (D + L)−1 b for Gauss-Seidel Method.
Given the system with initial solution x(0) = (0, 0, 0)T
−4x1 − x2 + 2x3 = 1
2x1 + 6x2 − 3x3 = 2
2x1 + x2 + 7x3 = 16

70. Compute the matrix B for Jacobi Method. 71. Find the approximate solution, x(2) for k = 2
  using Jacobi Method.
0 1/4 −1/2
(a) 1/3 0 −1/2 (a) (0.8095, 1.5595, 2.3095)T
2/7 1/7 0 (b) (0.0895, 0.5595, 2.3095)T
 
0 −1/4 1/2 (c) (1.1095, 0.5595, 2.3095)T
(b) −1/3 0 1/2
−2/7 −1/7 0 (d) (1.5619, 2.6857, 4.5810)T
  (e) None
0 −1/5 2/5
(c) −1/3 0 1/2
−2/7 −1/7 0
 
0 1/4 1/2
(d) −1/3 0 1/2 ||x(k+1) − x(k) ||∞
72. If is the relative error for any
2/7 −1/7 0 ||x(k+1) ||∞
two successive iterates, then what is the relative
(e) None error for x(1) and x(2) using Jacobi Method.
(a) 0.553244
(b) 0.53093
(c) 0.513510
(d) 0.75433
(e) None

12
 73. Compute B for Gauss-Seidel Method 75. Find the second iterate, x(2) for Gauss-Seidel
  Method.
0 −1/4 1/2
(a) 0 1/12 1/3  (a) (1.5486, 2.1029, 3.8286)T
0 5/84 −4/21 (b) (0.7946, 1.2173, 1.8848)T
 
0 −1/4 −1/2 (c) (−0.2000, 0.4000, 4.5714)T
(b) 0 −1/12 1/3 
0 5/84 −4/21 (d) (1.7946, 2.2173, 1.0648)T
  (e) None
0 −4 2
(c) 0 12 3  ||x(k+1) − x(k) ||∞
0 84 −21 76. If is the relative error for any
||x(k+1) ||∞
two successive iterates, then what is the rela-
 
0 −1/5 2/5
(d) 0 1/15 11/30 tive error for x(1) and x(2) using Gauss-Seidal
0 1/12 −1/6 Method.
(e) None (a) 0.554246
74. Compute vector d for Gauss-Seidel Method. (b) 0.654241
(c) 0.504246
 
−1/5
(a)  2/5  (d) 0.456722
32/7
  (e) None
−1/4
(b)  −5/12 
84/193
 
−1/4
(c)  5/12 
193/84
 
−4
(d)  12 
84
(e) None

Consider the following set of linear equations and use it answer

questions 77 to 85

10x1 − x2 + 2x3 =6
− x1 + 11x2 − x3 + 3x4 = 25
2x1 − x2 + 10x3 − x4 = −11
3x2 − x3 + 8x4 = 15
The table below shows results(with some missing values) from two(2) iterations using the Jacobi iterative
k 0 1 2
(k) (1) (2)
x1 0.0000 x1 x1
method to solve the given linear system x(k)
2 0.0000 x
(1)
2 1.7159
(k) (2)
x3 0.0000 -1.1000 x3
(k) (1)
x4 0.0000 x4 0.8852
(1)
77. What is x1 ?
(a) 0.6
(b) 1.0473
(c) 2.2727
(d) -0.8052
(e) 1.8750 13
 (2) (2)
78. What is x1 ? 80. What is x3 ?
(a) 0.6 (a) 0.6
(b) 1.0473 (b) 1.0473
(c) 2.2727 (c) 2.2727
(d) -0.8052 (d) -0.8052
(e) 1.8750 (e) 1.8750
(1) (1)
79. What is x2 ? 81. What is x4 ?
(a) 0.6 (a) 0.6
(b) 1.0473 (b) 1.0473
(c) 2.2727 (c) 2.2727
(d) -0.8052 (d) -0.8052
(e) 1.8750 (e) 1.8750

The table below shows results(with some missing values) from two(2) iterations
using the Gauss siedel iterative method to solve the given linear system

k 0 1 2
(k) (1)
x1 0.0000 x1 1.0473
(k) (2)
x2 0.0000 2.3272 x2
(k) (1)
x3 0.0000 x3 -1.0140
(k) (2)
x4 .0000 0 0.8789 x4
(1) (1)
82. What is x1 ? 84. What is x3 ?
(a) 0.6 (a) 0.6
(b) 2.3272 (b) 2.3272
(c) 2.0370 (c) 2.0370
(d) -0.9873 (d) -0.9873
(e) 0.9844 (e) 0.9844
(2) (2)
83. What is x2 ? 85. What is x4 ?
(a) 0.6 (a) 0.6
(b) 2.3272 (b) 2.3272
(c) 2.0370 (c) 2.0370
(d) -0.9873 (d) -0.9873
(e) 0.9844 (e) 0.9844

Use the following to answer questions 86–89.

The power developed by a hydraulic impulse turbine (P ) by changing the penstock diameter (d) is found
to be as follows:

d(m) 0.4 0.6 0.8 1.0 1.2

P (M W ) 20 50 105 180 295
For a penstock diameter, d = 0.73m, using third order Newton’s divided difference interpolation polyno-
mial

14
 86. Find the divided difference P [d1 , d0 ] . 88. Find the divided difference
P [d3 , d2 , d1 , d0 ].
(a) 150
(b) 275 (a) 104.167
(c) 155 (b) 575
(d) 375 (c) 416.667

(e) None (d) 500

(e) None
89. Estimate the power developed by the hydraulic
87. Find the divided difference impulse turbine by changing the penstock di-
P [d2 , d1 , d0 ]. ameter to d = 0.73m.
(a) 321.5 (a) 62.593M W
(b) 250 (b) 84.499M W
(c) 257 (c) 85.342M W
(d) 312.5 (d) 82.593M W
(e) None (e) None

Use the following to answer questions 90–97.

Given 4x21 − 20x1 + 14 x22 + 8 = 0, 12 x1 x22 + 2x1 − 5x2 + 8 = 0, with x(0) = (0, 0)T use fixed point iteration
with the formulation
4x21 + 41 x22 + 8


x1 =
20
1 2
x 1 x 2 + 2x1 + 8
x2 = 2
5

90. Find the first iterate x(1) 92. The Newtons method for solving the above sys-
(1) T tem is given by
(a) x = (8, 8)
x(k) = x(k−1) − J(x(k−1) )−1 F x(k−1)
(1)
(b) x = (0.4, 1.65)T where K = 1, 2, 3... Find the Jacobi matrix
(c) x(1) = (0, 0)T J(x(0) ).
 
(d) x(1) = (0.4, 1.6)T 8 0
(a)
(e) None 0 8
 
20 0
(b)
2 −5
 
−12 0
(c)
0 −2.5
 
−20 0
(d)
2 5
(e) None
91. Find x(2)
(a) x(2) = (0.4, 1.65)T
(b) x(2) = (8, 8)T
(c) x(2) = (0.523, 1.987)T
(d) x(2) = (0.464, 1.8624)T
(e) None

15
93. Find the functional value,F (x(0) ). 96. Find the functional value F (x(1) )
   
−8 1.08
(a) (a)
8 0.61952
   
0 1.0423
(b) (b)
0 0.8213
   
−12 1.4144
(c) (c)
3 0.61952
   
8 1.1134
(d) (d)
8 0.5432
(e) None (e) None
94. Find the first iterate x(1) . 97. Find the second iterate x(2)
 
0.414
 
(a) 0.4168
1.6 (a)
1.9759
 
0.464
 
(b) 0.4968
1.76 (b)
0.9859
 
0.4
 
(c) 1.6232
1.76 (c)
1.1242
 
0
 
(d) 0.4868
0 (d)
1.9759
(e) None (e) None
(1) −1
95. Find J(x )
 
−0.05 0
(a)
−0.02 −0.2
 
−0.060115 −0.002799
(b)
−0.049659 −0.235087
 
0.060115 0.002799
(c)
0.049659 0.235087
 
−0.080545 −0.0017355
(d)
−0.049659 −0.5366487
(e) None

Use the following to answer questions 98–99.

The following are formulas for numerical integration.
Z xn n−1
hX
Trapezium Rule: f (x) dx ≈ (f (xi ) + f (xi+1 )), h = (x0 − xn )/n
x0 2 i=0
Z x2n n−1
hX
Simpsons Rule: f (x) dx ≈ (f (x2i ) + 4f (x2i+1 ) + f (x2i+2 )), h = (x0 − x2n )/2n
x0 3 i=0

R2
98. Find the approximate value of 1 Inx dx by us-
ing four-panel Trapezium Rule.
(a) 0.3845
(b) 0.3878
(c) 0.3836
(d) 0.3837 16
(e) None
 R 2.2
99. The approximate value of 0.2
xex dx using two-
panel Simpsons rule is:
(a) 11.82149
(b) 11.78407
(c) 12.81151
(d) 9.57758
(e) None

Use the following to answer questions 100–105.

Consider y = f (x) = x1 over the range [1, 6]. Use the three nodes x0 = 2, x1 = 4 and x3 = 5 to construct
a quadratic interpolation polynomial P2 (x) using Newton interpolation.

100. Find F [x0 , x1 ] 103. Find P2 (x)

(a) 0.125 (a) −0.025x2 + 0.275x − 0.95
(b) −0.125 (b) 0.025x2 − 0.275x + 0.95
(c) 0.05 (c) −0.025x2 − 0.275x + 0.95
(d) −0.05 (d) 0.025x2 + 0.275x − 0.95
(e) None of the above (e) None of the above
104. Find P2 (5.4)
101. Find F [x1 , x2 ]
(a) −0.1940
(a) 0.125
(b) 0.1940
(b) −0.125
(c) −1.2640
(c) 0.05
(d) 1.2640
(d) −0.05
(e) None of the above
(e) None of the above
105. Which of the following is not appropriate for
102. Find F [x0 , x1 , x2 ] interpolation?
(a) 0.025 (a) Lagrange polynomial interpolation
(b) −0.025 (b) Taylor polynomial interpolation
(c) 0.05 (c) Cubic Spline interpolation
(d) −0.125 (d) Hermite interpolation
(e) None of the above (e) None

17