Scribd
Upload
67 views5 pages

Matrix Inversion Problem: A B I BA AB B

This document discusses different methods for calculating the inverse of a non-singular square matrix: 1. Using the matrix's adjoint is good for small matrices but impractical for large matrices. 2. Elementary row operations can be used to transform any non-singular matrix into the identity matrix, with the inverse being the product of the elementary matrices in reverse order. 3. This provides a procedure for calculating the inverse by starting with an augmented matrix and performing elementary row operations until the left side is the identity matrix, at which point the right side will be the inverse.

Uploaded by

Serkan Sancak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
67 views5 pages

Matrix Inversion Problem: A B I BA AB B

This document discusses different methods for calculating the inverse of a non-singular square matrix: 1. Using the matrix's adjoint is good for small matrices but impractical for large matrices. 2. Elementary row operations can be used to transform any non-singular matrix into the identity matrix, with the inverse being the product of the elementary matrices in reverse order. 3. This provides a procedure for calculating the inverse by starting with an augmented matrix and performing elementary row operations until the left side is the identity matrix, at which point the right side will be the inverse.

Uploaded by

Serkan Sancak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

Matrix inversion problem.

Given a non-singular square matrix A , obtain a


matrix B such that AB  BA  I . The matrix B is the
inverse of A. A1  B . In our course, we would be
considering only inverses of non-singular matrices
over real field (no complex matrix).

Matrix inversion through its adjoint.

Good for small matrices. Consider the matrix


a b c
P  d e f .
 
 g h i 

Let the corresponding cofactor matrix be


A B C
e f
Q  D E F where A  det 
  h i 
G H I 

d f d e
B   det 
g i  , C  det 
g h  … etc.

Then the inverse of P , P 1 is


1
P 1  Q
det( P )
This scheme is impractical for large matrices.
Consequently, we need easier approaches to deal
with the problem.

We would deal with the square matrices only. We


assume its determinant is non-zero.

Given a non-singular square matrix Ann we can


obtain its inverse Ann
1
. We will approach this problem
from different angles.

a. Using elementary matrices:

A n n matrix is an elementary matrix if it is obtained


from an n n identity matrix I n by a single row
operation.
1 0 0
e.g I 3  0 1 0
 
0 0 1

We can generate a number of elementary matrices


from it.
0 0 1  0 1 1 
a. E1  0 1 0 b. E 2  0 1 0 
   
1 0 0 1 0 0
 1 0 0 1 0 0 
c. E3   2 1 0 

d. E 4  0 1 0 
   
 0 0 1 1 0  1
A general 3 3 matrix can be expressed as a single
column 3 rows:

 R1 
Let A   R2 
 
 R3 

What is the effect of operating by an elementary


matrix Ei on A?

For instance,

 R3 
E1 A   R2  R1 , R3 interchange.
 
 R1 

 R2  R3 
E2 A   R2 
 
R1 is replaced by R2  R3 , R3 by R1
 R1 

 R1 
E3 A   2 R1  R2 

Replace R2 by  2 R1  R2
 
 R3 

 R1 
and E 4 A   R2 
 
 R1  R3 

These demonstrate the effect of elementary matrices


on general matrices -- they effectively achieve row-
operations. Therefore, using such matrices, we can
transform a non-singular matrix A into its row-
echelon form.

Thus,
1 0 0
E m El E k ...E 2 E1 A  0 1 0
 
0 0 1 

Therefore, the matrix product

E m El E k ...E 2 E1  A 1

This gives us a procedure to obtain inverse of a non-


singular matrix A using row transformation.

a. Start with an augmented matrix A | I n .


b. Carry out row-transformation on this using
elementary matrices.
c. When the left-side becomes an identity matrix,
the transformed right side must be the inverse of
the original matrix A .

Observe:

a. Two matrices A and B are row equivalent to


each other if one can get B from A using a
sequence of elementary matrices on the latter.

That means E m El E k ...E 2 E1 A  B


b. Every elementary row-operation can be
“undone” by another elementary row-
operation. Therefore, every elementary matrix
has an inverse.

c. The inverse of a product is the product of the


inverses in reverse order. For instance,

( Em El Ek ...E2 E1 ) 1  E11 E 2 1...Em 1

d. Finally, given any Ann the following


statements are equivalent:

1. A has an inverse.
2. Ax  b has a unique solution for any b .
3. A is row-equivalent to I n
4. A can be expressed as product of
elementary matrices.

You might also like