Indian Institute of Technology (BHU), Varanasi
Department of Mathematical Sciences
Numerical Techniques (MA–201)
Tutorial–4
1. Given the linear system:
2x1 − 6kx2 = 3
3kx1 − x2 = 1.5
(a) Find value(s) of k for which the system has infinitely many solutions.
(b) Find value(s) of k for which the system has no solution.
(c) Assuming a unique solution exists for a given k, find the solution.
2. Solve the following system of linear equations.
(a) 0.03x1 + 58.9x2 = 59.2 (b) 3.03x1 − 12.1x2 + 14x3 = −119
5.31x1 − 6.10x2 = 47.0 − 3.03x1 + 12.1x2 − 7x3 = 120
6.11x1 − 14.2x2 + 21x3 = −139
Use:
(i) Gaussian Elimination and 3-digit chopping arithmetic.
(ii) Gaussian Elimination and 3-digit rounding arithmetic.
(iii) Gaussian Elimination with partial pivoting and 3-digit chopping arithmetic.
(iv) Gaussian Elimination with partial pivoting and 3-digit rounding arithmetic.
3. Consider the following linear system of equations
0.5x1 + 1.1x2 + 3.1x3 = 6.0
2.0x1 + 4.5x2 + 0.36x3 = 0.02
5.0x1 + 0.96x2 + 6.5x3 = 0.96
Solve the above system with 3 decimal digit rounding arithmetic by using
(a) Gaussian elimination without pivoting.
(b) Gaussian elimination with partial pivoting.
4. Find the value of det(A) by using 3 digit arithmetic with rounding of the following matrix
3.41 2.71 1.89
A = 1.23 2.14 −1.91 .
−1.09 1.29 −1.89
(a) Use Gaussian elimination without pivoting.
1
(b) Use Gaussian elimination with pivoting.
5. Consider the linear system
6x1 + 2x2 + 2x3 = −2,
2 1
2x1 + x2 + x3 = 1,
3 3
x1 + 2x2 − x3 = 0,
and verify that its solution is
x1 = 2.6, x2 = −3.8, x3 = −5.0.
Solve the system by Gaussian elimination, both without and with pivoting, using four-digit
floating-point decimal arithmetic with rounding.
6. Solve the following systems of equations using the Gauss–Jordan method:
2 2 1 x1 1 2 1 3 x1 1
(a) 4 2 3 x2 = 2 (b) 4 −3 5 x2 = −7 .
1 1 1 x3 3 −3 2 4 x3 −3
7. Consider the following matrix
4 0.6 −5
A = −0.5 −3 2 .
2 4 0.8
Find A−1 using Gauss Jordan method.
8. Classify each of the following matrices as strictly diagonally dominant, symmetric positive def-
inite, both or neither.
4 −2 2 1 2 0 2 −1 0
(a) −2 6 4 (b) 4 6 −1 (c) −1 4 2
2 4 7 −3 2 0 0 2 6
9. Find the l1 , l2 , and l∞ norms of these matrices:
5 2 1 10.2 −2.3 −5.5
A = −9 −7 5 , B = 2.4 7.7 −3.2 .
6 4 8 4.5 11.1 0.9
10. Find the condition number of the following matrices relative to ∥ · ∥∞ and ∥ · ∥2 (spectral norm).
" # " #
3.9 1.6 1.003 58.09
(a) (b)
6.8 2.9 5.550 321.8
11. Consider the following system:
2x1 − x2 + x3 = −1
2x1 + 2x2 + 2x3 = 4
−x1 − x2 + 2x3 = −5
2
Compute the spectral radius of the Jacobi and Gauss-Seidel iteration matrices.
12. Perform 4 iterations of the Gauss-Jacobi and Gauss-Seidel method, starting with the initial
vector x(0) = 0.
(a) 4x − y = −1 (b) − 9x + 7y − 20z = 7
− x + 4y + 2z = 3 2x − 6y + 3z = −13
2y + 6z = 5 3x − y + z = 4
Also, solve the above system of equations using Jacobi and Gauss-Seidel error format iteration
procedure (residual form).
13. Consider the following linear system using x(0) = (0, 0, 0)T :
10x1 − x2 = 9
−x1 + 10x2 − 2x3 = 7
−2x2 + 10x3 = 6
Use the Jacobi and Gauss-Seidel methods to solve the system with T OL = 10−3 in the l∞ norm.
14. Solve the system of equations by Jacobi’s method using 5-digit arithmetic rounding. Also find
the minimum number of iterations required, so that solution is correct to 6 decimal places.
3x − 6y + 2z = 23
−4x + y − z = −15
x − 3y + 7z = 16
15. The system of equations AX = Y where
! ! !
3 2 x1 1
A= , X= , Y =
1 2 x2 2
can be solved by the following iteration:
!
1
X (n+1) = X (n) + α AX (n) − Y , X (0) =
.
1
How should the parameter α be chosen to produce optimal convergence?
16. Let Ax = b be written as x = Bx + c, with some norm of B, ∥B∥ < 1, then x = Bx + c has
unique solution. Further, sequence x(m) generated by x(m+1) = Bx(m) + c, starting with some
initial x(0) will converge to true solution vector ξ.