5.

1 Rank of a matrix
Introduction:
 Elementary row operations are
 A non-zero matrix is in Echelon form if
(i) All the zero rows are below the non-zero rows.
(ii) The first non-zero element in each non-zero row lies to the right of the
non-zero element in any preceding row.
 Example:

 Apply elementary row transformation successively to get the echelon form of the
given matrix.
 The rank of the matrix is the number of non-zero rows in the echelon form of the
matrix.
 The rank of the matrix is not altered by elementary transformations.
 A matrix and its transpose have the same rank.
 If A is a null matrix then
 If A is a non-singular matrix then
Find the rank of the following matrices by using elementary transformations:

1.

Let

This is in echelon form. The number of non-zero rows is 2.

Therefore, the rank of the given matrix is 2.

2.

1
 Let

This is in echelon form. The number of non-zero rows is 2.

Therefore, the rank of the given matrix is 2.

3.

Let

This is in echelon form. The number of non-zero rows is 2.

Therefore, the rank of the given matrix is 2.

4.

Let

This is in echelon form. The number of non-zero rows is 2.

Therefore, the rank of the given matrix is 2.

5.

2
 Let

This is in echelon form. The number of non-zero rows is 2.

Therefore, the rank of the given matrix is 2.

6.

Let

This is in echelon form. The number of non-zero rows is 3.

Therefore, the rank of the given matrix is 3.

3
7.

Let

This is in echelon form. The number of non-zero rows is 3.

Therefore, the rank of the given matrix is 3.

8. (May 22)

Let

4
 This is in echelon form. The number of non-zero rows is 2.
Therefore, the rank of the given matrix is 2.

9.

Let

This is in echelon form. The number of non-zero rows is 4.

Therefore, the rank of the given matrix is 4.

10.

Let

5
This is in echelon form. The number of non-zero rows is 3.
Therefore, the rank of the given matrix is 3.

5.2 Consistency of a system of linear equations

I. Homogeneous system of linear equations

Consistent Solution exists

Inconsistent Solution does not exist

Homogeneous system

Matrix form

Or
Coefficient matrix

Trivial solution (Unique)

Non-trivial solution (Infinite)

Homogeneous system of equations is always consistent.

6
 II. Non-homogeneous system of linear equations

Non-homogeneous
system

Matrix form

Or
Augmented matrix

Unique solution
Infinite number of solutions
Consistent
Inconsistent

1. Test for consistency and solve the following system of equations:

Coefficient matrix is

7
 This is in echelon form. Number of non-zero rows is 3.
Therefore, the given system of equations has trivial solution.
Therefore,
2. Test for consistency and solve the following system of equations:

Coefficient matrix is

This is in echelon form. Number of non-zero rows is 2.

Therefore, the given system of equations has non-trivial solutions.
Reduced system of equations is
---- (1)
------- (2)

Choose then and

Therefore,

3. Test for consistency and solve the following system of equations:

,
Coefficient matrix is

8
 This is in echelon form. Number of non-zero rows is 2.
Therefore, the given system of equations has non-trivial solutions.
Reduced system of equations is
---- (1)
----- (2)

Choose then and

Therefore,

4. Test for consistency and solve the following system of equations:

Augmented matrix is

This is in echelon form. Number of non-zero rows is 3.

Therefore, the given system of equations is consistent and has a unique solution.
Reduced system of equations is
---- (1)
---- (2)
---- (3)
Solving by back substitution,

5. Test for consistency and solve the following system of equations:

Augmented matrix is

9
 This is in echelon form. Number of non-zero rows is 2.

Therefore, the given system of equations is consistent

and has an infinite number of solutions.

Reduced system of equations is

---- (1)
---- (2)

Choose then and .

Therefore,

6. Test for consistency and solve the following system of equations:

Augmented matrix is

This is in echelon form. Number of non-zero rows is 3.

Therefore, the given system of equations is inconsistent

Therefore, the system has no solution.

10
7. Test for consistency and solve the following system of equations:

Coefficient matrix is

This is in echelon form. Number of non-zero rows is 4.

Therefore, the given system of equations is inconsistent

Therefore, the system has no solution.

8. Find the values of and for which the system

has (i) Unique solution (ii) Infinitely many solutions (iii) No solution. (May 22)
Augmented matrix is

11
 This is in echelon form.
(i) If then
The given system of equations has a unique solution.
(ii) If then
The given system of equations has infinitely many solutions.
(iii) If then
The given system of equations has no solution.

9. Find the values of and for which the system

has (i) Unique solution (ii) Infinitely many solutions (iii) No solution.
Coefficient matrix is

This is in echelon form.

(i) If then
The given system of equations has a unique solution.
(ii) If then
The given system of equations has infinitely many solutions.
(iii) If then
The given system of equations has no solution.

5.3 Gauss elimination method

1. Apply Gauss elimination method to solve the system of equations
.
Augmented matrix is

12
 Reduced system of equations is

By back substitution,
gives

gives

gives

Therefore, the solution is

2. Apply Gauss elimination method to solve the system of equations

. (MQP 2)
Augmented matrix is

Reduced system of equations is

13
 By back substitution,
gives
gives
gives
Therefore, the solution is

3. Apply Gauss elimination method to solve the system of equations

.
Augmented matrix is

Reduced system of equations is

By back substitution,
gives
gives
gives
Therefore, the solution is

4. Apply Gauss elimination method to solve the system of equations

.
Augmented matrix is

14
 Reduced system of equations is

By back substitution,
gives
gives
gives
Therefore, the solution is

5. Apply Gauss elimination method to solve the system of equations

.
Augmented matrix is

Reduced system of equations is

By back substitution,
gives
gives
gives

15
 Therefore, the solution is

6. Apply Gauss elimination method to solve the system of equations

.
Augmented matrix is

Reduced system of equations is

By back substitution,
gives
gives
gives
Therefore, the solution is

16
 5.4 Gauss Jordan method

Introduction

In this method, using elementary row transformations, augmented matrix is reduced to

the form .

1. Apply Gauss Jordan method to solve the system of equations:

The augmented matrix associated to the given system of equations is

Therefore,
2. Solve the system of equations by using the Gauss-Jordan method

The augmented matrix associated to the given system of equations is

17
Therefore,

3. Solve the system of equations by using Gauss-Jordan method

The augmented matrix associated to the given system of equations is

18
Therefore,

4. Apply Gauss Jordan method to solve the system of equations:

The augmented matrix associated to the given system of equations is

19
 Therefore,

5. Apply Gauss Jordan method to solve the system of equations:

The augmented matrix associated to the given system of equations is

Therefore,

6. Apply Gauss Jordan method to solve the system of equations:

(7, -9, 5)
The augmented matrix associated to the given system of equations is

20
 Therefore,

5.4 Gauss Seidel method

Introduction
Consider the system of equations

Rearrange this system of equations to a diagonally dominant system.

Rearrange the given system of equations in such a way that must be non
zero and numerically largest comparing to other coefficients.

Rewrite this system of equations as

21
 Consider the initial approximations as

First iteration:

Second iteration:

Third iteration:

Therefore, approximate solution of the given system of equations is

Accuracy can be improved by increasing number of iterations.

Initial approximation does not affect the solution, it may affect the number of iterations.

1. Solve the following system of equations by Gauss-Seidel method

Rearrange this system of equations to a diagonally dominant system.

Rewrite this system of equations as

Consider the initial approximations as

First iteration:

Second iteration:
22
 Third iteration:

Therefore, approximate solution of the given system of equations is

2. Solve the following system of equation by Gauss-Seidel method:

Rearrange this system of equations to a diagonally dominant system.

Rewrite this system of equations as

Consider the initial approximations as

First iteration:

Second iteration:

Third iteration:

23
 Therefore, approximate solution of the given system of equations is

3. Use the Gauss – Seidel iterative method to solve the system of equations

Carryout four iterations, taking the initial approximation to the solution as

Rearrange this system of equations to a diagonally dominant system.

Rewrite this system of equations as

Consider the initial approximations as

First iteration:

Second iteration:

Third iteration:

Therefore, approximate solution of the given system of equations is

24
4. Apply the Gauss –Seidel iterative method to solve the system of equations

Rearrange this system of equations to a diagonally dominant system.

Rewrite this system of equations as

Consider the initial approximations as

First iteration:

Second iteration:

Third iteration:

Therefore, approximate solution of the given system of equations is

5. Use the Gauss –Seidel iterative method to solve the system of equations
5
Rearrange this system of equations to a diagonally dominant system.

25
 Rewrite this system of equations as

Consider the initial approximations as

First iteration:

Second iteration:

Third iteration:

Therefore, approximate solution of the given system of equations is

6. Solve the following system of equations by Gauss Seidel iterative method

Rearrange this system of equations to a diagonally dominant system.

Rewrite this system of equations as

Consider the initial approximations as

26
 First iteration:

Second iteration:

Third iteration:

Therefore, approximate solution of the given system of equations is

5.6 Rayleigh’s power method

Introduction:

 This method is useful to find the largest Eigen value and its corresponding Eigen
vector.
 If initial Eigen vector is not given, take as an initial Eigen vector.
Problems:

1. Using Rayleigh’s power method find the the largest eigen value and the

corresponding eigen vector of the matrix by taking as

initial eigen vector [carry out 6 iterations]. (MQP 1)

27
 After 6 iterations, largest eigen value is 5.98, The corresponding eigen vector is

2. Find the largest eigen value and the corresponding eigen vector of

with the initial approximate eigen vector (MQP 2)

28
 After 6 iterations, largest eigen value is 8

The corresponding eigen vector is

3. Find the largest eigen value and the corresponding eigen vector for

with initial vector [Carryout 5 iterations.]

(July 2021 18MAT11)

After 5 iterations, largest eigen value is 7.98

The corresponding eigen vector is

4. Using Rayleigh’s power method find the largest eigen value and the corresponding

eigen vector of the matrix by taking as initial eigen

vector [carry out 5 iterations]. (Jan 20,

18MAT11)

29
 After 5 iterations, largest eigen value is 7.98

The corresponding eigen vector is

5. Using Rayleigh’s power method find the largest eigen value and the corresponding

eigen vector of the matrix by taking as initial eigen

vector [carry out 7 iterations]. (MQP 1, 18MAT11)

Two consecutive iterations give the same eigen value and eigen vector.
Largest eigen value is 25.18

The corresponding eigen vector is

30
6. Find the largest eigen value and the corresponding eigen vector of the matrix

. Perform 5 iterations by taking the initial eigen vector as

After 5 iterations, largest eigen value is 25.18

The corresponding eigen vector is

7. Find the largest eigen value and the corresponding eigen vector of the matrix

by Rayleigh’s power method. (May 22)

Take as an initial eigen vector.

31
 After 5 iterations, largest eigen value is 3.41

The corresponding eigen vector is

8. Find the largest eigen value and the corresponding eigen vector of the matrix

by Rayleigh’s power method.

Take as an initial eigen vector.

After 5 iterations, largest eigen value is 6.941

The corresponding eigen vector is

32