1st Lecture
1st Lecture
Lecture No : 1st
ai1 ai 2 ....ain
and column j of [A] has m elements and is
a1 j
a
2j
a mj
What is a matrix?
Each matrix has rows and columns and this defines the size of the matrix. If a
matrix [A] has m rows and n columns, the size of the matrix is denoted by m×n.
The matrix [A] may also be denoted by [A]mxn to show that [A] is a matrix with
m rows and n columns.
Each entry in the matrix is called the entry or element of the matrix and is
denoted by aij where I is the row number and j is the column number of the
element.
What is a matrix?
The matrix for the tire sales example could be denoted by the matrix [A] as
25 20 3 2
[ A] 5 10 15 25
6 16 7 27
There are 3 rows and 4 columns, so the size of the matrix is 3×4. In
the above [A] matrix, a34 =27.
Special Types of Matrices
Column vector:
If a matrix [C] has one column, it is called a column vector
c1
[C ]
cm
[ B ] [25 20 3 2 0]
[B] is an example of a row vector of dimension 5.
Column Vector
Example 2
25
[C ] 5
6
If some row(s) or/and column(s) of a matrix [A] are deleted (no rows or columns
may be deleted), the remaining matrix is called a submatrix of [A].
Example 3
4 6 2
[ A]
3 1 2
Square Matrix
25 20 3
[ A] 5 10 15
6 15 7
is a square matrix as it has the same number of rows and columns, that is, 3.
The diagonal elements of [A] are a11 25, a 22 10, a33 7 .
Upper Triangular Matrix
A m×n matrix for which aij 0, i j is called an upper triangular matrix. That is,
all the elements below the diagonal entries are zero.
Example 5
Give an example of an upper triangular matrix.
10 7 0
[ A] 0 0.001 6
0 0 15005
A m×n matrix for which aij 0, j i is called an lower triangular matrix. That is,
all the elements above the diagonal entries are zero.
Example 6
Give an example of a lower triangular matrix.
1 0 0
[ A] 0.3 1 0
0.6 2.5 1
3 0 0
[ A] 0 2.1 0
0 0 4
3 0 0
[ A] 0 2.1 0
0 0 5
1 0 0 0
0 1 0 0
[ A]
0 0 1 0
0 0 0 1
Zero Matrix
A matrix whose all entries are zero is called a zero matrix, ( aij 0for all i and j).
0 0 0
[ A] 0 0 0 0 0 0
[B]
0 0 0
0 0 0
Tridiagonal Matrix
A tridiagonal matrix is a square matrix in which all elements not on the
following are zero - the major diagonal, the diagonal above the major diagonal,
and the diagonal below the major diagonal.
2 4 0 0
2 3 9 0
[ A]
0 0 5 2
0 0 3 6
Non-square Matrix
Do non-square matrices have diagonal entries?
Yes, for a m×n matrix [A], the diagonal entries are a11 , a 22 ..., a k 1,k 1 , a kk where
k=min{m,n}.
Example 11
3.2 5
6 7
[ A]
2 .9 3 .2
5 .6 7 .8
n
aii | aij | for at least one i,
j 1
i j
that is, for each row, the absolute value of the diagonal element is greater than or
equal to the sum of the absolute values of the rest of the elements of that row, and
that the inequality is strictly greater than for at least one row. Diagonally dominant
matrices are important in ensuring convergence in iterative schemes of solving
simultaneous linear equations.
Example 12
and for at least one row, that is Rows 1 and 3 in this case, the inequality is a
strictly greater than inequality.
Example 12 (cont.)
15 6 9
[B] 2 4 2
3 2 5.001
The inequalities are satisfied for all rows and it is satisfied strictly greater
than for at least one row (in this case it is Row 3).
Example 12 (cont.)
25 5 1
C 64 8 1
144 12 1
c 22 8 8 c 21 c 23 64 1 65
Example 13
When are two matrices considered to be equal?
Two matrices [A] and [B] is the same (number of rows and columns are same for [A] and
[B]) and aij=bij for all i and j.
b11 3
[ B]
6 b22
The two matrices [A] and [B] would be equal if b11=2 and b22=7.