Solving Systems of Linear Equations using Inverse of a Matrix & Elementary Row

Operations
Consider:

+ + +
+ + +
+ + +
n n nn n n
n n
n n
b x a x a x a
b x a x a x a
b x a x a x a
...
...
...
2 2 1 1
2 2 2 22 1 21
1 1 2 12 1 11

be a linear system of n equations in n unknowns and let
[ ]
ij
a A
be the coefficient matrix so that
we can write the given system as AX = B where
1
1
1
1
]
1

1
1
1
1
]
1

n n
x
x
x
X
b
b
b
B

2
1
2
1
,
. If
, 0 A
then the system has a unique soution.
!o sove for "#$ of the form, B AX ,
B A X
1

.
Recall:

For SLE in 2 unknowns For SLE in ! unknowns
given
1
]
1

22 21
12 11
a a
a a
A
, given
1
1
1
]
1

%% %2 %1
2% 22 21
1% 12 11
a a a
a a a
a a a
A

A
a a
a a
A
1
]
1

11 21
12 22
1
A
A of Adjo
A
int
1

, where
1
T C
A AdjA & ' ,
T C
A & ' is the trans(ose
of the cofactors of A.

Minor
Any element ij
a
of
A
is associated with another determinant ij
M
of
& 1 ' & 1 ' n x n
order
obtained by deleting the ith row and the jth column in
A
.
Example:
%% %2
2% 22
11
a a
a a
M
,
%2 %1
12 11
2%
a a
a a
M
, ,
2% 22
1% 12
%1
a a
a a
M
"ofa#tor
The product of the minor
j i
ij
M
+
& 1 ' )
is called the cofactor of the element of ij
a
.
That is ij
j i
ij
M A
+
& 1 '
.
Example: !iven:
% 2 *
+ , -
0 % 1

A
% 2
+ ,
& 1 '
1 1
11


+
A
,
% *
+ -
& 1 '
2 1
12
+
A
,
2 *
, -
& 1 '
% 1
1%


+
A
% 2
+ ,
11

A
,
% *
+ -
12
A
,

,
2 *
, -
1%
A
Examples: "olve each of the following systems of linear equations using #nverse:
$%

+

1 2
11 %
y x
y x
&%

+

1. - %
% % 2
y x
y x
%.

+
+
. %
/
% 2
z y x
z y x
z y x
'%

+
+
+ +
- % 2
0 2
2 / . 2
z y x
z x
z y x
"olution:
2
$%

+

1 2
11 %
y x
y x
The corresponding matrix for this is
1
]
1

1 2
% 1
A
%

, A
,
1
]
1

1 2
% 1
,
1
1
A
, to sove0
B A X
1

, ie.
1
]
1

1
]
1

1
]
1

+
+

1
]
1

1
]
1

1
]
1

1
]
1

%
2
21
1.
,
1
1 22
% 11
,
1
1
11
1 2
% 1
,
1
y
x
y
x
X
.
!herefore0
% ) 2 y x
an1 the s.s. = { } & % , 2 '
&%

+

1. - %
% % 2
y x
y x
The corresponding matrix for this is
1
]
1

- %
% 2
A
-

1* A
,
1
]
1

2 %
% -
1*
1
1
A
, to sove0
B A X
1

, ie.
1
]
1

1
]
1

1
]
1

+
+

1
]
1

1
]
1

1
]
1

1
]
1

1
%
1*
-,
1*
1
2+ *
.2 1-
1*
1
1.
%
2 %
% -
1*
1
y
x
y
x
X
/
!herefore0
1 ) % y x
an1 the s.s. =
{ } & 1 , % '
(%

+
+
. %
/
% 2
z y x
z y x
z y x
The corresponding matrix for this is
1
1
1
]
1

1 1 %
1 1 1
1 1 2
A

/ A
,
1
1
1
]
1

% % 0
1 - 2
. 2 2
C
A
,
( )
1
1
1
]
1

% 1 .
% - 2
0 2 2
T
C
A
,
,
to sove0
B A X
1

, ie.
1
1
1
]
1

1
1
1
]
1

1
1
1
]
1

+
+

1
1
1
]
1

1
1
1
]
1

1
1
1
]
1

1
1
1
]
1

%
2
1
1+
12
/
/
1
12 / 12
12 %0 /
12 /
/
1
.
/
%
% 1 .
% - 2
0 2 2
/
1
z
y
x
z
y
x
X
+
!herefore0
% , 2 , 1 z y x
an1 the s.s. =
{ } & % , 2 , 1 '
'%

+
+
+ +
- % 2
0 2
2 / . 2
z y x
z x
z y x
The corresponding matrix for this is
1
1
1
]
1

1 % 2
2 0 1
/ . 2
A

2/ A
,
1
1
1
]
1

. 2 +
2 1. 22
% - /
C
A
,
( )
1
1
1
]
1

. 2 %
2 1. -
+ 22 /
T
C
A
,
*
to sove0
B A X
1

, ie.
1
1
1
]
1

1
1
1
]
1

1
1
1
]
1

1
1
1
]
1

1
1
1
]
1

1
1
1
]
1

1
1
1
]
1

1
0
2
2/
0
-2
2/
1
20 /
10 10
.0 12
2/
1
-
0
2
. 2 %
2 1. -
+ 22 /
2/
1
z
y
x
z
y
x
X
10
!herefore0
1 , 0 , 2 z y x
an1 the s.s. = { } & 1 , 0 , 2 '
Row E#$elon Form of a Matrix
A matrix is said to be in re%u#e% e#$elon form &REF' if the following properties hold%
$% All rows consisting entirely of )eros are found below all rows that do not consist entirely of )eros%
&% Any row that does not consist entirely of )eros have the first non)ero entries $ * called the leading $+
(% ,or any & successive non)ero rows the leading $ in the higher row is farther to the left than the
leading$ in the lower row%
(ote: A matrix is said to be in re%u#e%)row e#$elon form&RREF' if every column that has a leading $ has
)eros in every position above and below its leading $%
Examples of :
RE, RRE,
1
1
1
]
1

0 0 0 0
1 1 0 0
% 0 1 0
1
1
1
1
1
1
]
1

0 0 0 0
0 0 0 0
1 0 0 0
1 1 0 0
% 2 1 0
1
1
1
1
]
1

0 0 0 0 0
1 0 0 0 0
0 1 1 0 0
0 % 0 1 1
1
1
1
1
]
1

1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
1
1
1
1
]
1

1 0 0 0
1 1 0 0
1 . 1 0
/ 2 0 1
1
1
1
1
]
1

0 0 0 0
1 0 0 0
0 % 1 0
0 0 0 1
ELEME(*+R, RO- O.ER+*IO(S O( M+*RI"ES
This method makes use of the concepts of coefficient matrix and augmented matrix%
Consider the system:

+
+
2 2 2
1 1 1
c y b x a
c y b x a

+ +
+ +
+ +
% % % %
2 2 2 2
1 1 1 1
d z c y b x a
d z c y b x a
d z c y b x a
There are & matrices associated in this system the coefficient matrix and the augmented matrix%
11

1
]
1

2 2
1 1
b a
b a

1
]
1

2 2 2
1 1 1
0
0
c b a
c b a
1
1
1
]
1

% % %
2 2 2
1 1 1
c b a
c b a
c b a
1
1
1
]
1

% % % %
2 2 2 2
1 1 1 1
0
0
0
d c b a
d c b a
d c b a
Coeff% -atrix Augmented -atrix Coeff% -atrix Augmented -atrix
Elementary Row .perations:
$% #nterchange any row of augmented matrix%
&% -ultiply any row of augmented matrix by a non/)ero constant%
(% Add a non/)ero multiple of any row to another row%
Two matrices are said to be row equivalent if one can be obtained from the other by a sequence
of elementary row operations% To get the solution of a linear system we need to reduce the
augmented matrix in R/RE,%
,or "0E in & unknowns: ,or "0E in ( unknowns:

1
]
1

2
1
0 1 0
0 0 1
k
k
, where
2 1
) k y k x
1
1
1
]
1

%
2
1
0 1 0 0
0 0 1 0
0 0 0 1
k
k
k
, where
% 2 1
, , k z k y k x
an1 the s.s. = { } & , '
2 1
k k an1 the s.s. =
{ } & , , '
% 2 1
k k k
Examples: "olve the previous examples on systems of linear equations using Elementary Row
Operations &ERO'
$%

+

1 2
11 %
y x
y x
1
]
1

1 0 1 2
11 0 % 1

1
]
1

21 0 , 0
11 0 % 1

1
]
1

% 0 1 0
11 0 % 1

1
]
1

% 0 1 0
2 0 0 1
% ) 2 y x
&%

+

1. - %
% % 2
y x
y x
1
]
1

1. 0 - %
% 0 % 2

1
]
1

1. 0 - %
0 1
2
%
2
%

1
]
1

2
1*
2
1*
2
%
2
%
0 0
0 1

1
]
1

1 0 1 0
0 1
2
%
2
%

1
]
1

1 0 1 0
% 0 0 1
1 ) % y x
12
(%

+
+
. %
/
% 2
z y x
z y x
z y x
1
1
1
]
1

. 0 1 1 %
/ 0 1 1 1
% 0 1 1 2
1
1
1
]
1

. 0 1 1 %
% 0 1 1 2
/ 0 1 1 1
1
1
1
]
1

1. 0 2 . 0
1- 0 % % 0
/ 0 1 1 1
1
1
1
]
1

1. 0 2 . 0
- 0 1 1 0
/ 0 1 1 1

1
1
1
]
1

/ 0 2 0 0
- 0 1 1 0
1 0 0 0 1

1
1
1
]
1

% 0 1 0 0
- 0 1 1 0
1 0 0 0 1

1
1
1
]
1

% 0 1 0 0
2 0 0 1 0
1 0 0 0 1
% , 2 , 1 z y x
an1 the s.s. =
{ } & % , 2 , 1 '
'%

+
+
+ +
- % 2
0 2
2 / . 2
z y x
z x
z y x
1
1
1
]
1

- 0 1 % 2
0 0 2 0 1
2 0 / . 2
1
1
1
]
1

- 0 1 % 2
2 0 / . 2
0 0 2 0 1
1
1
1
]
1

- 0 - % 0
2 0 2 . 0
0 0 2 0 1
1
1
1
]
1

- 0 - % 0
0 1 0
0 0 2 0 1
2
1
2
1

1
1
1
]
1

2
1%
2
1%
2
1
2
1
0 0 0
0 1 0
0 0 2 0 1

1
1
1
]
1

1 0 1 0 0
0 1 0
0 0 2 0 1
2
1
2
1

1
1
1
]
1

1 0 1 0 0
0 0 0 1 0
2 0 0 0 1
1 , 0 , 2 z y x
an1 the s.s. = { } & 1 , 0 , 2 '
"/0000(ame000000000000000000000000000000001ate0000000000000S#ore0000000000
Section:_______________________________Professor_______________________________
Practice Exercise
Solving System of Linear Equation Using Inverse & Elementary Row Oerations
Exercises: Solve eac! of t!e following systems of linear equations using:
1%
a"Inverse #" Elementary Row Oerations
$%

+
% . -
. 2 %
y x
y x
&%

+
0 2 .
- %
y x
y x
(%

+
- % 2
11 .
2 1
2 1
x x
x x
'%

+
%
2 .
%
2
% 2
y x
y x
-.

+
+
+ +
1 %
. %
% %
z y
y x
z y x
1%

+
+ +
+ +
1 2 %
/ 2 .
/ 2 2
% 2 1
% 2 1
% 2 1
x x x
x x x
x x x
2%

+
+ +
+ +
. 2 /
+ . %
- 2
p n m
p n m
p n m
3%

+
+
+
% 2
. 2
1 % 2
w v u
w v u
w v u
1.
4%

+
+ +
+ +
2 2 2
11 2 .
+ 2
% 2 1
% 2 1
% 2 1
x x x
x x x
x x x
$5%

+

+ +
12 - %
, 2 . -
1. 2 %
- 2 . 2
w z
w z y
w y x
w z y x

1-