USN 12MMD/MDE/MCM/MEA/MAR/MST11

First Semester M.Tech. Degree Examination, June/July 2013

Applied Mathematics

Time: 3 hrs. Max. Marks:100

Note: Answer any FIVE full questions.
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

1 a. Explain in brief:
i) Inherent errors
ii) Rounding errors
iii) Truncation errors
iv) Absolute, relative and percentage errors. (10 Marks)
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

2
4xy
b. If f  3 and the errors in x, y, z are 0.001, find the maximum relative error in f at
z
x = y = z = 1. (10 Marks)

2 a. Explain secant method for finding a root of the equation f(x) = 0. By using the Regula-Falsi
method, find the root of the equation x log10 x  1.2 that lies between 2 and 3. (10 Marks)
4 3 2
b. Find the multiple root of the equation x  11x  36 x  16 x  64  0 , that lies near 3.9.
(10 Marks)

3 a. Find two iterations of the Muller method to find the root of the equation
f ( x )  x 3  5x  1  0 in (0, 1). (10 Marks)
2
b. Perform two iterations of the Bairstow method to extract a quadratic factor x  px  q from
the polynomial x 4  5x 3  20x 2  40x  60  0 , use the initial approximations p0 = 4,
q0 = 8. (10 Marks)

4 a. From the following data obtain the first and second derivatives of y  log e x i) at x = 500,
ii) at x = 550. (10 Marks)
0.5
 x 
b. Evaluate the integral   dx using Romberg’s method, correct to three decimal places.
0
sin x 
(10 Marks)

5 a. Use Cholesky’s method to solve the system

x  y  z 1
3x  y  3z  5
x  2 y  5z  10 (10 Marks)
b. Using the partition method, solve the system of equations:
2x  4 y  3z  4
y  z 1
2x  2 y  z  2 (10 Marks)

1 of 2
 12MMD/MDE/MCM/MEA/MAR/MST11

6 a. By employing the Given’s method, reduce the matrix

2 1  2
A 1 2  2
  2  2 3 
to tridiagonal form and hence find its largest eigen value. (10 Marks)
b. Find all the eigenvalues of the matrix
1 1 1
A  2 1 2
1 3 2
using the Rutishauser method. (Carryout 5 steps) (10 Marks)

7 a. Find a spanning set for the null space of the matrix

 3 6  1 1  7
 
A   1  2 2 3  1 (10 Marks)
 2  4 5 8  4
 
 2 1 3 
2 4  2 3
   
b. Let A    2  5 7 3 , u    and v   1
  1
3 7  8 6    3 

0 
i) Determine if u is in Nul A, could u be in Col A?
ii) Determine if v is in Col A, could v be in Nul A? (10 Marks)

1 5 4 
a.  
Find a least-squares solution of the system AX = b where A  3 1  , b    2 . (10 Marks)
8  
 2 4   3
 
2   2 1 
b. If u1   5  , u 2   1  , y  2 and w = span {u1, u2}, then find orthogonal projection of
   
 1  1  3
y onto w. (10 Marks)

*****

2 of 2