Oat-res.

Determinants, Hermitian and Skew-Hermitian Matrices, Inverse and Rank of Matrix 213
,■=
1.
ECHELON FORM AND ROW-REDUCED ECHELON FORM OF A MATRIX
matrix A is said to be in Echelon form if
./(i The first non-zero element in each row, called its leading entry, is 1. However, if it is not 1 we
scale the row to make its leading entry 1.
v(ii) In any two successive rows ith and (i + 1)th that do not consist entirely of zeros, thc1!adin
element in the (1 + 1)th row lies to the right of the leading element in ith row.
Any row or rows that consist entirely of zeros, lie at the bottom of the matrix.
The matrix A is said to be in row-reduced echelon form if, in addition to conditions (i) to (iii),
it is also true that

(iv) In a column that contains the leading entry of a row, all the other elements are zero.
In essence, it means that a matrix A is in echelon form if the first non-zero entry in any row is 1
and the entry appears to the right of the first non-zero entry in the row above and all rows of zeros lie
at the bottom of the matrix. Furthermore, matrix A is in row-reduced echelon form if, in addition to these
conditions, the first non zero entryinany row is the only non-zero entry in the column containing that
entry.
For example, the matrices
1 1 1 1
1 0 2 5 0 0 1 3
0 0 1 0 and 0 0 0 1 are in echelon form
LO 0000
0 0 0 0

and the
The process of reducing a matrix to echelon form and to rove-reduced echelon form, will be more
1 5 , 1 0 0 1 0 2 0
Clear after 0 4 following0example.
undertaking 7
0 1 1 0 are all in row-reduced echelon form.
0 7 0 3
2 0 1
and
0 0 0 0 1 c===.-
0 1 0 1 1
0 0 0 0
1

MOM
is, applying
and 2, that
to its echelon form and its row-reduced echelon ferny 1/1°14M10114: Interchanging rows 1
Reduce the matrix
R1 4-► R2
0 1 2 0 32
4 8 2 4 1
A- 2 4 2 2 1
-
2 2 4 8 2
4 0 I 2 0 3 6 now1 5applying R I --) R 1 )
A
(

3 1 2 4
2 2 1 3
214 Advanced Engineenng Mathematics
1 2 4 1 2
1 2 0 3
(applying R 3 -÷ R 3 - R 1 and R4 --+ R4 - R1 )
0 2 4 2 2
3 6 1 5
1
2 4 1 2
1 2 3
1 (applying R4 --> R4 R2)
0 0 0 0
1 1 2 3
0 1 _
2 4
0
2 2
_ 10 0 3
0
0
0 0 1 0
1 0
and this matrix is in echelon form. Having obtained the echelon form of the given matrix, we use it to
get the row-reduced echelon form. Thus, we have
1 2 4 1 2
0 1 2 0 3
A 0 0 0 1 0 (apply R 1 -> R 1 - 2R 2 )

_ 0 0 0 0

1 0 0 1 _-4
0 1 2 0 3
0 0 0 1 0 (apply R 1 -4 R 1 - R 3 )

0 0 0 0 0_
1 0 0 0 -4
0 1 2 0 3
Ans.
0 0 0 1 0
0 0 0 0 0
and this matrix is now in its row-reduced echelon form.

INVERSE OF A MATRIX BY GAUSS-JORDAN METHOD

The method can be stated as follows:
"The elementary row operations which reduce a given matrix A (n k n) to a unit matrix 1 (ri i tL

when applied to the unit matrix i n , give the inverse of A."

Let the successive row operations which reduce the given square matrix A (n x n) to I. result from
the premultiplication of A by the elementary matrices R 1 , R 2 , ..., R k , so that
R k R k R k _ 2 ... R 2 R 1 A 1
-

Post multiplying this by A 1 , we obtain (R k R A

- R 2 R 1 A) A I IA
or (RkRk R 2 R 1 ) (AA I )= A-1 Or
RkRk R 2 R 1 1- A 1

or A =RA,Rii...R2Ril.
wows, Determinants, Hermitian and Skew-Hermitian Matrices, Inverse and Rank of Matrix 215

Thus, to find A-1 we write the augmented matrix [A, I] where I is the unit matrix of the same order
as that of A. Then perform the same row operations on both A and 1, till such time when A reduces

to I, the other matrix represents A. However, this method fails when det (A) = 0.
This can be symbolically written as (A/1) elementary
(1/B).
row operation
(a) Applying Gauss-Jordan technique, find the inverse of the matrix
1 2 3
A= 2 4 5 [GGSIPU I Sem End Term 2013]
3 5 6
_,

(b) By elementary transformations find the inverse of 1 3 5

3 2 4
[GGSIPU I Sem End Term January 2011] 5 4 2

12 3I1
SOLUTION: (a) The augmented matrix [A, 1] = 2 4 5 0
0 0
356I0 1 1
0
Applying R 2 - 2R 1 and R 3 — 3R 1 , we get 0 1_

1 2 3 1 0 0
[A, 1] - 0 0 -1 -2 1 0
0 -1 -3, j -3 0 1
Next, applying R2 4-÷ R3 and R2 —› —R2, we get
1 2 31 1 0 0
0 1 3 3 0 -1
0 0 -1 -2 1 0
Now, applying R1 R I - 2R 2 and R 3
—
R 3 , we get

1 0 -31 -5 0 2-
0 1 3 3 0 -1
0 0 1 j 2 -1 0
Finally, applying R1 R + 3R3 and R2 R2 — 3R3, we get
0 0 1 1 -3 2
0 1 0 -3 3 -1
0 0 11 2 -1 0_
1 -3 2
Hence A -3 3 - I Ans.
2 -1 0
 t f ill r 1
ilw i
216 Advancec baii, ern•ut

1 0 0-
[1 3 5] and /= 0 1 0, then
(b) Let A= 3 2 0 0 1

1 3 5 1 0 0
Al = 2 4 0 1 0
(Applying R2 -> R2 - 3R, and R3-> R3 - 5R1 on both A and I, we get I
3 4 2 0 0 1

1
3 5 I 0 0
= 0 - 7 -11 -3 1 0 (Applying R3-> R3 - 2R2)
0 -11 -23 -5 0 1
_

1 3 51 1 00
= 0 -7 -11 I
-3 10 (Next applying R i --R 1 -R 3 and R2-> R2 2R3)
0 3 -1 1 -2 1

10 6
0 2 -1
= 0 -1 -13 -
1 -3 2 (Now
applying R3
-> R3 +
3R2)
0 3 -1
1 -2 1

10 6
0 2 -1
= 0 -1
-13
1 0 6 0 2 -1 1 0 6 0 80 -40
= 0 1 13 1 3 -2 = 1 0 1 13 40 120 -80
40
00 1 2 11 -7 0 0 1 2 11 -7
_40 40 40_

(Next applying R1-4 - 6R3 and R2-> R2- 13R

1 0 0 -12 14 2 -12 14 2
1 A-1= — 1
0 0 1 -23 11 -23
40 40 11 Ans.
0 1 1 4 11 -7 4 11 -
2
 -1 -
3 2
(Nex
t
appl
ying
R2-
3-R2
and
R3-
>-
R3)
_0
0 -
40 -
2 -
11 7

_
I 0 6 0
2 -1
= 0 1 13
1 3 -2 (Now
applying R3 -*
—1 R3)
0 0 40 2
I1 -7
i

40
z
 , Determinants, Hermitian and Skew-Hermitian Matrices, Inverse and Rank of Matrix 217

IIIIIIIIIIIIIIUsing the method of elementary row transformations to compute the inverse of

1 2 5
2 31
[ [GGSIPU I Sem End Term 2007]
-1 1 1_
1 2 5 1 0 0-
SourrION: Let A= 2 3 1 and 13 = 0 1 0
—
1 1 1 0 0 1
We apply row transformations on A as well as 1 simultaneously till A becomes 1 and
fate of I will be A -1 .
Applying R2 —+ R2 + 2R1 and R3 —> R3 + R1, we get
1 2 5- 1 0 0
A 0 -1 -9 and 1 -2 1 0 Now applying R3 --> R3 + 3R2
0 3 6 10 1
1 2 5 1 0 0
-

A- 0 -1 -9 and 1- -2 1 0 Now applying R2 -> — R2, R3 --> — R3

0 0 -21 -5 3 1

1 2 10 0
5
A- 0 1 9 and 2 -1 0
0 0 1 • 5 -3 -1
21 21 21_
Next applying R2 —+ R2 — 9R3 and R, -+ R, -

-4 15 5
21 21 21
-4 15 5
1 2 0 -3 6 9
A- 0 1 0 / 21 21 21 21 -3 6 9
0 0 l 5 -3 -1 5 -3 -1
21 21

Finally applying R 1 -+ R I - 2R 2 , we get

2 1 -13
2 3 -13 - 1 0 0 3 9
- 6
A 0 1 0 ,
Ans. 3 -1
21 0 0 1 -3 6 9 -3
-
5
5 -3 L