Professional Documents
Culture Documents
Lec#1 Intro To Matrices
Lec#1 Intro To Matrices
Lec#1 Intro To Matrices
Introduction
Matrices - Introduction
Matrix algebra has at least two advantages:
•Reduces complicated systems of equations to simple
expressions
•Adaptable to systematic method of mathematical treatment
and well suited to computers
Definition:
A matrix is a set or group of numbers arranged in a square
or rectangular array enclosed by two brackets
4 2 a b
1 1 3 0 c d
Matrices - Introduction
Properties:
•A specified number of rows and a specified number of
columns
•Two numbers (rows x columns) describe the dimensions
or size of the matrix.
Examples:
3x3 matrix 1 2 4
2x4 matrix
4 1 5 1 1
3 3
1 1
3 3 3 0 0 3 2
1x2 matrix
Matrices - Introduction
A matrix is denoted by a bold capital letter and the elements
within the matrix are denoted by lower case letters
e.g. matrix [A] with elements aij
Amxn=
a11 a12 ... aij ain
a a22 ... aij
a2 n
mA
n
21
am1 am 2 aij amn
i goes from 1 to m
j goes from 1 to n
Matrices - Introduction
TYPES OF MATRICES
1. Column matrix or vector:
The number of rows may be any integer but the number of
columns is always 1
1 a11
4 1 a21
3
2
am1
Matrices - Introduction
TYPES OF MATRICES
1 1 6 0 3 5 2
3. Rectangular matrix
Contains more than one element and number of rows is not
equal to the number of columns
1 1
3 7 1 1 1 0 0
2 0 3 3 0
7 7
7 6
mn
Matrices - Introduction
TYPES OF MATRICES
4. Square matrix
The number of rows is equal to the number of columns
(a square matrix A has an order of m)
mxm
1 1 1 1 1
9 9 0
3 0
6 6 1
The principal or main diagonal of a square matrix is composed of all
elements aij for which i=j
Matrices - Introduction
TYPES OF MATRICES
5. Diagonal matrix
A square matrix where all the elements are zero except those on
the main diagonal
3 0 0 0
1 0 0 0
3 0 0
0 2 0
0 0 5 0
0 0 1
0 0 0 9
i.e. aij =0 for all i = j
aij = 0 for some or all i = j
Matrices - Introduction
TYPES OF MATRICES
1 0 0 0
0
1 0 0 1 0 aij 0
0 0 1 0 0 1 0
aij
0 0 0 1
i.e. aij =0 for all i = j
a = 1 for some or all i = j
Matrices - Introduction
TYPES OF MATRICES
0 0 0 0
0 0 0 0
0
0 0 0
8. Triangular matrix
A square matrix whose elements above or below the main
diagonal are all zero
1 0 0 1 0 0 1 8 9
2 1 0 2 1 0 0 1 6
5 2 3 5 2 3 0 0 3
Matrices - Introduction
TYPES OF MATRICES
aij 0 0 1 0 0
2 1 0
aij aij 0
aij aij aij 5 2 3
i.e. aij = 0 for all i < j
Matrices – Introduction
TYPES OF MATRICES
9. Scalar matrix
A diagonal matrix whose main diagonal elements are
equal to the same scalar
A scalar is defined as a single number or constant
aij 0 0 1 0 0 6 0 0 0
0 1 0 0
0 aij 0 6 0 0
0 0 aij 0 0 1
0 0 6 0
i.e. aij = 0 for all i = j 0 0 0 6
aij = a for all i = j
Matrices
Matrix Operations
Matrices - Operations
EQUALITY OF MATRICES
Two matrices are said to be equal only when all
corresponding elements are equal
Therefore their size or dimensions are equal as well
1 0 0 1 0 0
A= 2 1 0 B= 2 1 0 A=B
5 2 3 5 2 3
Matrices - Operations
Some properties of equality:
•IIf A = B, then B = A for all A and B
•IIf A = B, and B = C, then A = C for all A, B and C
Associative Law:
A + (B + C) = (A + B) + C = A + B + C
7 3 1 1 5 6 8 8 5
2 5 6 4 2 3 2 7 9
A B C
2x3 2x3 2x3
Matrices - Operations
A+0=0+A=A
A + (-A) = 0 (where –A is the matrix composed of –aij as elements)
6 4 2 1 2 0 5 2 2
3 2 7 1 0 8 2 2 1
Matrices - Operations
SCALAR MULTIPLICATION OF MATRICES
3 1
Ex. If k=4 and
2 1
A
2 3
4 1
Matrices - Operations
3 1 3 1 12 4
2 1 2 1 8 4
4 4
2 3 2 3 8 12
4 1 4 1 16 4
Properties:
• k (A + B) = kA + kB
• (k + g)A = kA + gA
• k(AB) = (kA)B = A(k)B
• k(gA) = (kg)A
Matrices - Operations
MULTIPLICATION OF MATRICES
A x B = Not possible!
(6x2) (6x3)
Example
A x B = C
(2x3) (3x2) (2x2)
Matrices - Operations
b11 b12
a11 a12 a13 c11 c12
a b21 b22
21 a22 a23 c21 c22
b31 b32
31 21
63 57
Remember also:
IA = A
1 2
T
5 0
3 4
S
0 2
1 2 3 4 3 8
TS
5 0 0 2 15 20
3 4 1 2 23 6
ST
0 2 5 0 10 0
Matrices - Operations
If AB = 0, neither A nor B necessarily = 0
1 1 2 3 0 0
0 0 2 3 0 0
Matrices - Operations
TRANSPOSE OF A MATRIX
If :
2 4 7
3
A 2 A
2x3 5 3 1
Then transpose of A, denoted AT is:
2 5
T
A 2 A 3T
4 3
7 1
T
aij a ji For all i and j
Matrices - Operations
To transpose:
Interchange rows and columns
The dimensions of AT are the reverse of the dimensions of A
3 2 4 7
A 2 A 2x3
5 3 1
2 5
T
A 3 A T2
4 3 3x2
7 1
Matrices - Operations
Properties of transposed matrices:
1. (A+B)T = AT + BT
2. (AB)T = BT AT
3. (kA)T = kAT
4. (AT)T = A
Matrices - Operations
1. (A+B)T = AT + BT
7 3 1 1 5 6 8 8 5 8 2
2 5 6 4 2 3 2 7 9 8 7
5 9
7 2 1 4 8 2
3 5 5 2 8 7
1 6 6 3 5 9
Matrices - Operations
(AB)T = BT AT
1
1 1 0 2
0 2 3 1 8 2 8
2
1 0
1 1 21 2 2 8
0 3
Matrices - Operations
SYMMETRIC MATRICES
A Square matrix is symmetric if it is equal to its
transpose:
A = AT
a b
A
b d
T a b
A
b d
Matrices - Operations
a b
A
c d
T a c
A
b d
The identity matrix, I, a diagonal matrix D, and a scalar matrix, K,
are equal to their transpose since the diagonal is unaffected.
Matrices - Operations
INVERSE OF A MATRIX
Consider a scalar k. The inverse is the reciprocal or division of 1
by the scalar.
Example:
k=7 the inverse of k or k-1 = 1/k = 1/7
Division of matrices is not defined since there may be AB = AC
while B = C
Instead matrix inversion is used.
The inverse of a square matrix, A, if it exists, is the unique matrix
A-1 where:
AA-1 = A-1 A = I
Matrices - Operations
Example:
2 3 1
A 2 A
2 1
1 1 1
A
2 3
Because:
1 1 3 1 1 0
2 3 2 1 0 1
3 1 1 1 1 0
2 1 2 3 0 1
Matrices - Operations
Properties of the inverse:
( AB) 1 B 1 A1
1 1
(A ) A
T 1 1 T
(A ) (A )
1 1 1
(kA) A
k
A square matrix that has an inverse is called a nonsingular matrix
A matrix that does not have an inverse is called a singular matrix
Square matrices have inverses except when the determinant is zero
When the determinant of a matrix is zero the matrix is singular
Matrices - Operations
DETERMINANT OF A MATRIX
1 2
If A
6 5
1 2
then A
6 5
Matrices - Operations
If A = [A] is a single element (1x1), then the determinant is
defined as the value of the element
Then |A| =det A = a11
If A is (n x n), its determinant may be defined in terms of order
(n-1) or less.
Matrices - Operations
MINORS
If A is an n x n matrix and one row and one column are deleted,
the resulting matrix is an (n-1) x (n-1) submatrix of A.
The determinant of such a submatrix is called a minor of A and
is designated by mij , where i and j correspond to the deleted
row and column, respectively.
mij is the minor of the element aij in A.
Matrices - Operations
eg.
a11 a12 a13
A a21 a22 a23
a31 a32 a33
Each element in A has a minor
Delete first row and column from A .
The determinant of the remaining 2 x 2 submatrix is the minor
of a11
a22 a23
m11
a32 a33
Matrices - Operations
Therefore the minor of a12 is:
a21 a23
m12
a31 a33
And the minor for a13 is:
a21 a22
m13
a31 a32
Matrices - Operations
COFACTORS
When the sum of a row number i and column j is even, cij = mij and
when i+j is odd, cij =-mij
c11 (i 1, j 1) (1)11 m11 m11
1 2
c12 (i 1, j 2) (1) m12 m12
1 3
c13 (i 1, j 3) (1) m13 m13
Matrices - Operations
DETERMINANTS CONTINUED
A a11 (a22 a33 a23a32 ) a12 (a21a33 a23a31 ) a13 (a21a32 a22 a31 )
Matrices - Operations
Example 2:
1 0 1
A 0 2 3
1 0 1
A a11 (a22 a33 a23a32 ) a12 (a21a33 a23a31 ) a13 (a21a32 a22 a31 )
Example:
1 2
If A
3 4
4 3
The cofactor C of A is C
2 1
Matrices - Operations
The adjoint matrix of A, denoted by adj A, is the transpose of its
cofactor matrix
T
adjA C
It can be shown that:
A(adj A) = (adjA) A = |A| I
Example:
1 2
A
3 4
A (1)(4) (2)(3) 10
4 2
T
adjA C
3 1
Matrices - Operations
1 2 4 2 10 0
A(adjA) 10 I
3 4 3 1 0 10
4 2 1 2 10 0
(adjA) A 10 I
3 1 3 4 0 10
Matrices - Operations
USING THE ADJOINT MATRIX IN MATRIX INVERSION
Since
AA-1 = A-1 A = I
and
A(adj A) = (adjA) A = |A| I
then
1adjA
A
A
Matrices - Operations
Example
1 2
A= 3 4
1 1 4 2 0.4 0.2
A
10 3 1 0.3 0.1
so
1 1 1
adjA C T 2 4 2
3 7 5
and
1 1 1 0.5 0.5 0.5
1 adjA 1 1.0 2.0 1.0
A 2 4 2
A 2
3 7 5 1.5 3.5 2.5
Matrices - Operations
The result can be checked using
AA-1 = A-1 A = I
Simple 2 x 2 case
Simple 2 x 2 case
Let
and
a b w x
1
A A
c d y z
then
a b w x 1 0
c d y z 0 1
Simple 2 x 2 case
Multiplying gives
aw by 1
ax bz 0
cw dy 0
cx dz 1
1 by
w
a
dy
w
c
1 by dy
a c
c c
y
ad cb A
Simple 2 x 2 case
bz
x
a
1 dz
x
c
bz 1 dz
a c
a a
z
ad bc A
Simple 2 x 2 case
So that for a 2 x 2 matrix the inverse can be constructed
in a simple fashion as
d b
A A 1 d b
1w x
A c a A c a
y z A
A
Check inverse
A-1 A=I
1 1 3 2 3 1 0
I
10 4 2 4 1 0 1
Matrices and Linear Equations
Linear Equations
Linear Equations
Linear equations are common and important for survey
problems
Matrices can be used to express these linear equations and
aid in the computation of unknown values
Example
n equations in n unknowns, the aij are numerical coefficients,
the bi are constants and the xj are unknowns
A-1 AX = A-1 B
Now since
A-1 A = I
We get
X = A-1 B
3 1 1 x1 2
2 1 0 x 1
2
1 2 1 x3 3
Linear Equations
When A-1 is computed the equation becomes
Therefore
x1 2,
x2 3,
x3 7
Linear Equations
The values for the unknowns should be checked by substitution
back into the initial equations
x1 2, 3x1 x2 x3 2
x2 3, 2 x1 x2 1
x3 7 x1 2 x2 x3 3