Scribd
Upload
35 views

Lesson 1.3 Inverse of Matrices

The document discusses the inverse of a matrix. It defines an inverse matrix A-1 as a matrix that satisfies AA-1 = A-1A = I, where I is the identity matrix. Not every matrix has an inverse. The Gauss-Jordan method can be used to find the inverse, which involves performing elementary row operations on the augmented matrix [A|I] until it is transformed into [I|A-1]. Sample problems demonstrate applying this method to find specific inverses.

Uploaded by

Justine Faye Maurillo Petilla
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
35 views

Lesson 1.3 Inverse of Matrices

The document discusses the inverse of a matrix. It defines an inverse matrix A-1 as a matrix that satisfies AA-1 = A-1A = I, where I is the identity matrix. Not every matrix has an inverse. The Gauss-Jordan method can be used to find the inverse, which involves performing elementary row operations on the augmented matrix [A|I] until it is transformed into [I|A-1]. Sample problems demonstrate applying this method to find specific inverses.

Uploaded by

Justine Faye Maurillo Petilla
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

THE INVERSE OF A MATRIX

Definition:
An n x n matrix A is called non-singular (or invertible) if there exists n x n matrix 𝐴−1such
that 𝐴𝐴−1 = 𝐴−1𝐴 = 𝐼, where 𝐼 is the identity matrix. The matrix 𝐴−1 is called the inverse of A.
If there exists no such matrix 𝐴−1, then the matrix A is called singular (or non-invertible). Not
every matrix has an inverse.
Note:
 An 𝑛 𝑥 𝑛 matrix is a square matrix.
 The inverse of any 𝑛 𝑥 𝑛 matrix is also a square matrix.
 When the inverse and the matrix itself are multiplied (or vice versa), the result is an identity
matrix 𝐼.
THEOREMS ON INVERSE OF A MATRIX
1. If A is a non-singular matrix, then 𝐴−1 is non-singular (𝐴−1 )−1 = 𝐴.
2. If A and B are non-singular matrices, then AB is non-singular and (𝐴𝐵)−1 = 𝐵−1 𝐴−1.
3. If A is a non-singular matrix, then (𝐴𝑇 )−1 = (𝐴−1 )𝑇 .
Example:
2 3
Find the inverse of 𝐴 = [ ]
2 2
Solution:
𝑎 𝑏
Let 𝐴−1 = [ ]be the inverse of A;
𝑐 𝑑
Then, considering the relation 𝐴𝐴−1 = 𝐼,
2 3 𝑎 𝑏 1 0
[ ][ ]=[ ]
2 2 𝑐 𝑑 0 1
By multiplication of matrices,
2𝑎 + 3𝑐 2𝑏 + 3𝑑 1 0
[ ]=[ ]
2𝑎 + 2𝑐 2𝑏 + 2𝑑 0 1
So that, by equality of the elements of the matrices,
2𝑎 + 3𝑐 = 1; 2𝑏 + 3𝑑 = 0
2𝑎 + 2𝑐 = 0; 2𝑏 + 2𝑑 = 1
Hence, by solving equations using simultaneously (either by elimination or substitution method),
𝑐=1 ; 𝑑 = −1
3
𝑎 = −1 ; 𝑏=2

These are the elements of the matrix 𝐴1 and, therefore,


3
𝐴−1 = [−1 2 ]
1 −1
Check:
From the definition, 𝐴𝐴−1 = 𝐴−1 𝐴 = 𝐼
3
2 3 −1
3 2(−1) + 3(1) 2 (2) + 3(−1) −2 + 3 3−3 1 0
1
𝐴𝐴 = [ ][ 2 ]=[ ]=[ ]=[ ]
2 2 1 −1 2(−1) + 2(1)
3
2 (2) + 2(−1) −2 + 2 3−2 0 1

3 3 3
−1 −1 2 3 (−1)(2) + ( ) (2) (−1)(3) + ( ) (2) 1 0
𝐴 𝐴=[ 2 ][ ]=[ 2 2 ]=[ ]
1 −1 2 2 (1)(2) + (−1)(2) (1)(3) + (−1)(2) 0 1

ELEMENTARY ROW(COLUMN) OPERATIONS


Definition:
An elementary row (column) operation on a matrix A is any one of the following operations:
a. Interchange rows (or columns) 𝑖 and 𝑗 of A. This is called a type I operation.
b. Multiply row (or column) 𝑖 of A by a non—zero constant “c”. This is called a type II
operation.
c. Add “c” times row (or column) of A to row (column) 𝑗 of A, where 𝑖 ≠ 𝑗.
When a matrix is considered as the augmented matrix of a linear system, the elementary row
operations are equivalent, respectively, to interchanging two equations, multiplying an
equation by a non-zero constant, and adding a multiple of one equation to another equation.
These operations are particularly useful in such methods like Gauss-Jordan method, the
Gaussian elimination and the inverse method for solving a system of linear equations.
PRACTICAL METHOD IN FINDING THE INVERSE OF A MATRIX
Gauss-Jordan Method
[𝐴|𝐼 ] = [𝐼 |𝐴−1 ]
Procedures:
Moving from column 𝑗 = 1, 2, … , 𝑛,
1. Search for the maximum pivot (the element with the largest absolute value)
2. Interchange the row of the maximum pivot with another row (if necessary) so that the pivot
point is located in the diagonal.
3. Normalize the maximum pivot row by dividing all the elements of the row by the value of
the maximum pivot.
4. Eliminate the elements of the pivot column except for the pivot, making the elements equal
to zero.
Note that the procedures can easily be remembered by using the acronym; “S-I-N-E”
S – for search
I – for interchange
N – for normalize
E – for elimination
Sample Problem
In each case find the inverse of the given matrix using Gauss-Jordan method and check
the result.
1 2
1. 𝐴 = [ ]
2 1
4 −1 1
2. 𝐵 = [3 −2 2]
1 0 1
1 1 2 1
0 −2 0 0
3. 𝐶 = [ ]
1 2 1 −2
0 3 2 1

Problem Set # 2.
In each case find the inverse of the given matrix using Gauss-Jordan method and check
the result.
1 3
4. 𝐴 = [ ] [5 pts]
5 2
1 2 1
5. 𝐵 = [1 3 2] [7 pts]
1 0 1
1 1 1 1
1 2 −1 2
6. 𝐶 = [ ] [8 pts]
1 −1 2 1
1 3 3 2

You might also like