Introduction To Matrices

By

Bahaa Saif Alnasr Rabi

 AGENDA
Matrices
I. Definition
II. Advantages
III. Applications
IV. Matrices Formula
Types of Matrices
1. Column matrix or vector
2. Row matrix or vector
3. Rectangular matrix
 AGENDA(Cont.)
4. Square matrix
5. Diagonal matrix
6. Unit or Identity matrix
7. Null (zero) matrix
8. Triangular matrix
 Upper triangular matrix
 Lower triangular matrix
9. Scalar matrix
 Matrices(Definition)
 First definition
Any arrangement of m and n values arranged in the shape
of an ordered set of m rows and n columns, is called an m x
n matrix.
 Second definition
A matrix is a set or group of numbers coordinated in a
square or rectangular array enclosed by two brackets [ ].
 Matrices Denoted with a bold Capital letter ,such as
A,B,C,D,…………..
 To declare the size(dimension) of the matrix[A], is
given by mx n, also may be denoted by [A]mx n or (m , n)
or m by n.
 Matrices(Advantages)
Matrices in solving practical problems
have two main advantages:
I. Adjustable to systematic process of
mathematical therapy and fully suited
to computers.
II. Reduces sophisticated systems of
equations to more simple expressions.
 Matrices(Applications)
Matrices have many applications in different
fields of science such as next.
 Computer Graphics
 Optics
 Cryptography
 Economics
 Chemistry
 Geology
 Robotics and animation
 Matrices (Formula)
For a matrix A mx n= m An
 a11 a12 ... aij ain 
a a ... a a 
 21 22 ij 2n 

A=     
 
am1 am 2 aij amn 
 [A] with elements a ij
 i goes from 1 to m
 j goes from 1 to n
 Types of Matrices
Column matrix or vector
Column matrix or vector : The number of
rows consists of many numbers, but the
number of columns is 1.

[ ]
0
 a11  4
 a21  6
⌈ 0 ⌉  6
6   − 1
8 am1  10
 Types of Matrices
Row matrix or vector
Row matrix or vector : Contains any number
of columns but only one row.
a11 a12 a13  a1n 

[-2 6 9]
 Types of Matrices
Rectangular matrix
Rectangular matrix: Contains more than one
element and number of rows is not equal to
the number of columns.

1 3
3 5
  1 41 1 10 0 
 10  7 2 0  3 13  5
   
 7 6 
 Types of Matrices
Square matrix
Square matrix :The number of rows is equal to the
number of columns(a square matrix [A]mx n because m=n, a
square matrix become s [A]mx m ).  6 9
13 0
 
m=n=2
1 1 16
 9 19 10
 
62 6  1 
 Types of Matrices
Diagonal matrix
Diagonal matrix: A square matrix where all the
elements are zero except those on the main diagonal.
main diagonal
1 0 0 0
10 0 0  0 
 0 20 0   6 0 0
  0 0 2 0
 0 0 14  
0 0 0  9

aij =0 for all i = j

aij = 0 for some or all i = j
 Types of Matrices
Unit or Identity matrix
Unit or Identity matrix (I):A diagonal matrix with
ones on the main diagonal.
1 0 0 0
0 
1 0 0 1 0  aij 0
 0 1  0 
0 0 1 0    aij 
 
0 0 0 1
aij =0 for all i = j
aij = 1 for some or all i = j
 Types of Matrices
Null (zero) matrix
Null (zero) matrix :All elements in the matrix are
zero.

0  0 0 0 
0  0 0 0 
   
0 0 0 0

aij  0 For all i, j

 Types of Matrices
Triangular matrix
Triangular matrix :A square matrix whose elements
above or below the main diagonal are all zero.

1 0 0  1 8 9
 2 1 0 0 1 6 
   
5 2 3 0 0 3
 Types of Matrices
Upper triangular matrix
Upper triangular matrix : A square matrix whose
elements below the main diagonal are all zero.

aij aij aij  1 81  7 

  0 10 28 
0 aij aij   
0 0 aij  0 0 13 


aij = 0 for all i > j

 Types of Matrices
Lower triangular matrix
Lower triangular matrix :A square matrix whose
elements above the main diagonal are all zero.

aij 0 0 11 0 0
   21 1 0 
aij aij 0  
aij aij aij  35  2 30


aij = 0 for all i < j

 Types of Matrices
Scalar matrix
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 8 0 0 0
  0 1 0  0 
0 aij 0    8 0 0
0 0 aij  0 0 1 0
 0 8 0
aij = 0 for all i = j  
0 0 0 8
aij = a for all i = j