STRUCTURAL ANALYSIS II

Lecturer: Achfas Zacoeb

INTRODUCTION TO MATRIX ALGEBRA
1. Definition of Matrix
If we have a linier simultaneous system:
2 x + 3 y + 2 z = 4
x + y + 3 z = 5
- x + 2 y - z = 8
Hence, the coefficient of equation can be written as:

'

'

'

8
5
4
1 2 1
3 1 1
2 3 2
z
y
x
[ ] { } { } B X A
The series of number above, which notation of [A], {X}, or {B} called as
matrix, and in generally matrix [A] can be written as:
1
1
1
1
1
1
1
1
1
]
1

mn mj m m m
in ij i i i
n j
n j
n j
a a a a a
a a a a a
a a a a a
a a a a a
a a a a a







3 2 1
3 2 1
3 3 33 32 31
2 2 23 22 21
1 1 13 12 11
where:
m, n : real number 1
a
ij
: elements of matrix [A] (i = 1, 2, , m) ; (j = 1, 2, , n)
m : the number of row
n : the number of column
the order of matrix : m x n
Matrix with order m x n, in common be written as [A]
mxn
2. Types of Matrixes
Types of matrixes are:
2.1. Rectangular matrix, if m = n
3 3
9 8 3
6 5 2
7 4 1
x
1
1
1
]
1

Elements: a
11
, a
22, ,
a
mn
are called as main diagonal elements.
2.2. Row matrix, if m = 1
[ ]
3 1
3 2 1
x
2.3. Column matrix, if n = 1
1 3
3
2
1
x

'

2.4. Null matrix, if a

ij
= 0
3 3
0 0 0
0 0 0
0 0 0
x
1
1
1
]
1

3. Types of Rectangular Matrixes

3.1. Diagonal matrix (if all elements = 0, except its main diagonal)
1
1
1
]
1

3 0 0
0 2 0
0 0 1
a
ij
= 0 ; a
ii
0
3.2. Unit matrix (if main diagonal elements = 1, and the others = 0)
[ ] I
1
1
1
]
1

1 0 0
0 1 0
0 0 1
3.3. Symmetries matrix, if a
ij
= a
ji
1
1
1
]
1

5 7 3
7 4 2
3 2 1
3.4. Skew Symmetries matrix, if a
ij
= - a
ji
1
1
1
]
1

5 7 3
7 4 2
3 2 1
3.5. Orthogonal matrix
A rectangular matrix named as orthogonal if [A]
-1
= [A]
T
.
So that [A][A]
T
= [A][A]
-1
= [I].
[ ]
[ ] [ ]
1
]
1

1
]
1

1
]
1

cos sin
sin cos
;
cos sin
sin cos
cos sin
sin cos
1
A A
A
T
Because [A]
T
= [A]
-1
[A] : orthogonal matrix
3.6. Partition matrix
A matrix can be separated into sub-matrix, by following a few of rows or
columns from original matrix.
Example:
[ ]
1
]
1

1
1
1
]
1

23 22 21
13 12 11
36 35 34 33 32 31
26 25 24 23 22 21
16 15 14 13 12 11
A A A
A A A
a a a a a a
a a a a a a
a a a a a a
A

where:
[ ] [ ] [ ]
[ ] { } [ ] [ ] [ ] [ ]
36 35 23 34 33 32 22 31 21
26 25
16 15
13
24 23 22
14 13 12
12
21
11
11
; ;
; ;
a a A a a a A a A
a a
a a
A
a a a
a a a
A
a
a
A

1
]
1

1
]
1

'

The role that used for operating partition matrix is precisely similar with
ordinary matrix operation.
4. OPERATION OF MATRIX
4.1. Addition
If [A] and [B] have the same order, so that both of matrixes can be added
become matrix [C].
[A] + [B] = [C] ; a
ij
+ b
ij
= c
ij
Example:
[ ] [ ]
[ ]
1
]
1

1
]
1

+ + +
+ + +

1
]
1

1
]
1

10 10 10
4 4 4
4 6 5 5 6 4
1 3 2 2 3 1
4 5 6
1 2 3
;
6 5 4
3 2 1
C
B A
The characteristic of matrix addition:
- Cumulative : [A] + [B] = [B] + [A]
- Associative : [A] + [B] + [C] = ([A] + [B]) + [C]
4.2. Multiply by scalar
A matrix [A] can be multiplied by scalar k, and the result is matrix [D] = k [A].
where d
ij
= k.a
ij
Example:
[ ]
[ ]
1
]
1

1
]
1

12 10 8
6 4 2
:
2 ;
6 5 4
3 2 1
D that so
k A
The characteristic of matrix multiplied by scalar:
- k ([A] + [B]) = k [A] + k [B]
- k ([A] + [B]) = ([A] + [B]) k
4.3. Multiply by another matrix
A matrix [A]
mxp
and matrix [B]
pxn
can be multiplied, and the result is matrix
[C]
mxn
.
[A]
mxp
[B]
pxn
= [C]
mxn
p k
n j
m i
c b a
ij
p
k
kj ik
,..., 2 , 1
,..., 2 , 1
,..., 2 , 1
; .
1

Example:
[ ]
1
]
1

1
]
1

+ + + +
+ + + +

1
1
1
]
1

1
]
1

32 19
11 7
1 6 2 5 4 4 2 6 ) 1 ( 5 3 4
1 3 2 2 4 1 2 3 ) 1 ( 2 3 1
] [
1 2
2 1
4 3
] [ ;
6 5 4
3 2 1
x x x x x x
x x x x x x
C
B A
The characteristic of matrix multiplied by another matrix:
- Distributive: [A] ([B] + [C]) = [A] [B] + [A] [C]
- Distributive: ([A] + [B]) [C] = [A] [C] + [B] [C]
- Associative: [A] ([B] + [C]) = ([A] + [B]) [C]
- [A] [B] [B] [A]
- [A] [B] = [A] [C], not certainly [B] = [C]
4.4. Transpose of matrix
Known a matrix [A]
mxn
, so the transpose of matrix [A] = [A]
T
is matrix with
order n x m (the row and column of matrix [A] become the column and row of
matrix [A]
T
).
Example:
[ ]
1
1
1
]
1

1
]
1

6 3
5 2
4 1
] [ ;
6 5 4
3 2 1
T
A A
The characteristic of matrix transpose:
- ([A]
T
)
T
= [A]
- (k [A])
T
= k [A]
T
- ([A] + [B])
T
= [A]
T
+ [B]
T
- ([A] [B])
T
= [B]
T
[A]
T
4.5. Determinant of rectangular matrix
[ ]
( ) ( ) ( )
ij
j i
ij
b b b
x
x
b b cofactor
b b b b b b b b b b b b b b b B
b b b
b b b
b b b
B
a a a a A A
a a
a a
A
minor ) 1 ( ;
. . . . . .
] [
. . det ] [
13 12 11
minor
31 22 32 21 13
minor
31 23 33 21 12
minor
32 23 33 22 11
33 32 31
23 22 21
13 12 11
3 3
21 12 22 11
22 21
12 11
2 2
+

+
1
1
1
]
1

1
]
1

For a higher order matrix (n x n), can be done on the same method and the
generally formula is:
ik ik
in in i i i i
n
k
ik ik
a cofactor c where
c a c a c a c a A

+ + +

:
. . . .
2 2 1 1
1

4.6. Inverse of rectangular matrix
If a matrix [A] and [B] are rectangular matrixes, and [A][B] = [I] = [B][A], so
matrix [B] called as inverse of matrix [A], and the opposite, matrix [A] is
inverse of matrix [B]. Next, matrix [A] named as non singular matrix. If matrix
[A] has no inverse, the matrix named as singular matrix.
Example:
[ ] [ ]
] 1 [
1 0 0
0 1 0
0 0 1
] ][ [
4 2 1
3 3 1
3 2 1
;
1 0 1
0 1 1
3 2 6
1
1

1
1
1
]
1

1
1
1
]
1

1
1
1
]
1

A A
A A

To calculate an inverse of matrix can be conducted by a few methods, like:
adjoin method, separation method, Gauss-Jordan method, Cholesky method,
and the similar methods. The most popular method that widely used is
Gauss-Jordan method.
For example, we will calculate an inverse from matrix [A]
nxn
. The steps are:
1. Take a unit matrix [ I ]
nxn
.
2. By elementary row operation, change the matrix [A] into unit matrix
[ I ].
3. Step (2) is also be conducted to matrix [ I ], so after the process is
finished, matrix [ I ] had became inverse matrix [A]
-1
.
Example:
[ ]
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 1
0 1 1
3 3 7
] A [
1 0 1
0 1 1
3 3 7
1 0 0
0 1 0
0 0 1
1 0 1
0 1 1
0 3 4
1 0 0
0 1 0
3 0 1
1 0 1
0 1 1
0 0 1
1 0 0
0 1 0
3 3 1
1 0 0
0 1 1
0 0 1
4 3 1
0 1 0
3 3 1
1 0 0
0 1 0
0 0 1
4 3 1
3 4 1
3 3 1
: operation row elementary
4 3 1
3 4 1
3 3 1
A
1
Thanks for the attention and see you next week,
InsyaALLAH.