Matrix: Msc. Do Thi Phuong Thao Fall 2013
Matrix: Msc. Do Thi Phuong Thao Fall 2013
amn am am
n a a a
n a a a
... 2 1
... ... ... ...
2 ... 22 21
1 ... 12 11
Examples
If m=n: A is square matrix
(
(
(
(
ann an an
n a a a
n a a a
... 2 1
... ... ... ...
2 ... 22 21
1 ... 12 11
Examples
Identity matrix nxn:
All elements in main diagonal = 1
All other elements = 0
(
(
(
(
1 ... 0 0
... ... ... ...
0 ... 1 0
0 ... 0 1
I
n
=
Examples
Row matrix: m=1
Column matrix: n=1
| |
(
(
(
(
bm
b
b
an a a
...
2
1
... 2 1
Examples
Triangle matrix:
(
(
(
(
ann
n a a
n a a a
... 0 0
... ... ... ...
2 ... 22 0
1 ... 12 11
(
(
(
(
ann an an
a a
a
... 2 1
... ... ... ...
0 ... 22 21
0 ... 0 11
Examples
Diagonal matrix:
Elements in main diagonal 0
All other elements = 0
(
(
(
(
ann
a
a
... 0 0
... ... ... ...
0 ... 22 0
0 ... 0 11
Examples
Row-reduced echelon matrix :
All zero rows are at the bottom of the matrix
The leading entry in any nonzero row is 1.
If the leading entry of row r1 is in the column c1,
and the leading entry of row r2 is in the column
c2, and if r1<r2 then c1<c2.
If any row has its leading entry in column j, then
all other elements of column j are 0
Example of Row-reduced echelon matrix
Contents
Definition
Elementary row operations
Row-Reduced Echelon Matrices
Matrix Algebra
Inverse matrix
Elementary Row Operations
Three elementary row operations that can be
performed on matrix A are:
Multiplication of one row by a non-zero scalar
Add a scalar multiple of one row to another row
Interchange of two rows
Examples
Theorem
To each elementary row operation e there
corresponds an elementary row operation e,
of the same type as e, such that e(e(A)) =
e(e(A)) = A for each A.
In other words, the inverse operation
(function) of an elementary row operation
exists and is an elementary row operation of
the same type.
Examples
Multiplication of one row by a non-zero scalar
c
Multiplication of one row by a non-zero scalar c
-1
Replacement of row r by row r plus c times
row s
Replacement of row r by row r plus (- c) times row
s
Interchange of two rows r and s
Interchange of two rows s and r
Definition
Definition
If A and B are m x n matrices over the field F, we
say that B is row-equivalent to A if B can be
obtained from A by finite sequence of elementary
row operations.
Examples
Contents
Definition
Elementary row operations
Row-Reduced Echelon Matrices
Matrix Algebra
Inverse matrix
Example
Row-reduced echelon matrix
1. All zero rows are at the bottom of the matrix
2. The leading entry in any nonzero row is 1.
3. If the leading entry of row r1 is in the column
c1, and the leading entry of row r2 is in the
column c2, and if r1<r2 then c1<c2.
4. If any row has its leading entry in column j,
then all other elements of column j are 0
Theorem
Every m x n matrix A is row-equivalent to a
row-reduced echelon matrix.
Example 1
Find a row-reduced echelon matrix which is
equivalent to B:
Example 1
Example 1
Contents
Definition
Elementary row operations
Row-Reduced Echelon Matrices
Matrix Algebra
Inverse matrix
Matrix algebra
A = [aij]mxn =
B= [bij]mxn =
(
(
(
(
amn am am
n a a a
n a a a
... 2 1
... ... ... ...
2 ... 22 21
1 ... 12 11
(
(
(
(
bmn bm bm
n b b b
n b b b
... 2 1
... ... ... ...
2 ... 22 21
1 ... 12 11
Matrix addition
A = [aij]mxn, B = [bij]mxn:
A+B = [aij+bij]mxn
A + B = B + A
Multiplication of a scalar and matrix
A = [aij]mxn, k,h are real number:
kA = [kaij]mxn
k(A+B) = kA+kB
(k+h)A = kA + hA
k(hA) = (kh)A
Multiplication of Matrices
A = [aij]mxp, B = [bij]pxn
C = AB = [cij]mxn:
cij = ai1.b1j+ai2.b2j++aip.bpj
cij =
AB and BA are different.
A(B+C) = AB + AC
(B+C)A = BA +AC
A(BC) = (AB)C
k(BC) = (kB)C = B(kC)
=
p
k
bkj aik
1
.
Contents
Definition
Elementary row operations
Row-Reduced Echelon Matrices
Matrix Algebra
Inverse matrix
Inverse matrix
Definition:
An nxn identity matrix I
n
=
Let A is an nxn matrix. Then B is an inverse of A
if:
AB = BA = I
n
so B must also be nxn and B = A
-1
I
n
A = A I
n
= A
(
(
(
(
1 ... 0 0
... ... ... ...
0 ... 1 0
0 ... 0 1
Examples
Theorem
Definition:
A square matrix is said to be nonsingular or
invertible if it has an inverse.
If it has no inverse, the matrix is singular.
Theorem:
An nxn matrix is nonsingular if and only if:
A
R
= I
n
A method for finding A
-1
(Gauss-Jordan method)
A method for finding A
-1
Thank you for your attention.
Thats all for today.