ME103 LINEAR ALGEBRA

DR. ORHAN KEKLICIOGLU

References:
• Applications of Linear Algebra by Gordon C. Everstine
• Linear Algebra by David Cherney, Tom Denton, Rohit Thomas and Andrew Waldron
• Linear Algebra, A gentle introduction by Shivkumar Kalyanaraman
• Lecture Notes, Prof.Dr.Şaban EREN

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:1/No:1

6. Specific Matrices
Zero Matrix: It is a matrix with all elements of zero. If the zero matrix under consideration is of mxn dimension, it should
be written as m0n.

Square Matrix: The matrix whose number of rows is equal to the number of columns is called square matrix.

Main Diagonal : Here, elements a11, a22, a33,..., ann are called main diagonal elements.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:2

6. Specific Matrices
Diagonal Matrix: A square matrix whose elements other than the main
diagonal are zero is called a diagonal matrix.

Scalar Matrix: A diagonal matrix whose main diagonal elements are equal to
each other is called a scalar matrix.

Identity Matrix: If the main diagonal elements in a diagonal matrix are equal to
1, this matrix is called the identity matrix. If the matrix is nxn-dimensional, it is
denoted by In.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:3

6. Specific Matrices
Tri-Diagonal Matrix : If the main diagonal of a square matrix and the elements
in the adjacent diagonals are zero, then this matrix is called a Tri-Diagonal
Matrix. Some (not all) elements of these diagonals may have a value of zero.

Upper Triangular Matrix: : If all the elements of a square matrix below the
main diagonal are zero, this matrix is called the upper triangular matrix.

Lower Triangular Matrix: : If all the elements of a square matrix above the
main diagonal are zero, this matrix is called the lower triangular matrix.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:4

6. Specific Matrices
Transpose Matrix: : To obtain the transpose of a matrix, the rows and columns
of the matrix are swapped. If our matrix is A, its transpose is AT

Symmetric Matrix: If AT = A in a square matrix, it is said that the matrix is the symmetric matrix.

Trace of Matrix:The sum of the main diagonal is called trace of a matrix.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:5

 PART 3
Solution of Linear Systems
Using Matrix

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:6

1. Matrix Notation Representation of Linear Equation Systems
Consisting of m equations and n unknowns

Let's consider the system of linear equations. As mentioned before, x1, x2, ..., xn are unknowns, a's and b's are
constants.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:7

2. Augmented Matrix
Consisting of m equations and n unknowns

Ex:1 Find the coefficients matrix, unknown column matrix, constant column matrix and augmented matrix of given
linear equation system.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:8

2. Augmented Matrix
Ex:1 Find the coefficients matrix, unknown column matrix, constant column matrix and augmented matrix of given
linear equation system.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:9

2. Augmented Matrix
Ex:2 Find the coefficients matrix, unknown column matrix, constant column matrix and augmented matrix of given
linear equation system.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:10

2. Augmented Matrix
Ex:3 Find the coefficients matrix, unknown column matrix, constant column matrix and augmented matrix of given
linear equation system.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:11

3. Row echolon Form
3.a) Elementary row operations in Matrix
In solving systems of equations we are allowed to perform operations of the following types:

These correspond to the following operations on the augmented matrix,

1. Multiply a row by a non-zero constant. (Ri  kRi)

2. Add a multiple of one row to another row. (Ri  Ri + k Rj)

3. Interchange two rows in the matrix (this only amounts to writing down the equations of the system in a different

order). (Ri  Rj)

Operations of these three types are called Elementary Row Operations (ERO’s) on a matrix.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:12

3. Row echolon Form
3.a) Elementary row operations in Matrix
We now describe how ERO’s on the augmented matrix can be used to solve the system of Example 1. The following

table describes how an ERO is performed at each step to produce a new augmented matrix corresponding to a new

(hopefully simpler) system.

Ex:1 Find thesolution of the linear eq. System with using elementary row operations in Matrix.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:13

3. Row echolon Form
3.a) Elementary row operations in Matrix
Ex:1 Find the solution of the linear eq. System with using elementary row operations in Matrix.

The matrix obtained in Step 5 above is in Row-Echelon

Form.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:14

3. Row echolon Form
A matrix is said to be in the form of a row equivalent matrix
(Row echelon form) if the following rules are provided.
a) If there are rows with only zeros, they are at the bottom of
the matrix.
b) The value of the first nonzero element is 1 in rows other
than zeros.
c) The first nonzero 1 value in each row is located to the right of
the first nonzero 1 element in the previous row.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:15

4.Reduced-Row echolon Form
• The first non-zero element in first row is 1 and the other
elements in column 1 where this element is located are
zero.
• The first non-zero element in second row is 1 and this
element is to the right of 1 in the previous row, and the
other elements in the column are zero.
• The first nonzero element in third row is 1 and the first
nonzero element in row 2 is located to the right of 1,
and the other elements of the corresponding column
are zero.
• In this case it is said that the given matrix is in the form
of a reduced row matrix.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:3/No:16

 PART 4
Gauss and Gauss-Jordan
Elimination Methods

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:17

1. Gauss and Gauss-Jordan Elimination Methods
• There are many methods used to obtain the solution of linear equation systems. In the following sections, two of
these methods, Gauss and Gauss-Jordan methods, will be introduced. Here, nxn dimensional linear equation
systems will be discussed. In the next chapters, solutions of mxn dimensional linear equation systems will be
discussed.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:18

2. Gauss Elimination Methods

The process of converting the

given coefficient matrix into an
row echelon matrix with the help
of elementary row operations is
known as the Gauss Elimination
Method.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:19

2. Gauss Elimination Methods
Ex.1 Solve given linear equation system with usin Gauss Elimination method.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:20

2. Gauss Elimination Methods
Ex.2: Solve given linear equation system with usin Gauss Elimination method.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:21

2. Gauss Elimination Methods
Ex.3: The upward velocity of a rocket is given at three different times

Table 1 Velocity vs. time data.

Time, t s  Velocity, v m/s 
5 106.8
8 177.2
12 279.2

The velocity data is approximated by a polynomial as:

vt   a1t 2  a 2 t  a3 , 5  t  12.

Find the velocity at t=6 seconds .

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:22

2. Gauss Elimination Methods
Assume
vt   a1t 2  a2t  a3 , 5  t  12.

Results in a matrix template of the form:

t12 t1 1  a1   v1 
 2   a   v 
t 2 t2 1  2  2
t32 t3 1 
 a3 
  v3 

 
Using data from Table 1, the matrix becomes:

 25 5 1  a1  106.8   25 5 1  106.8 
 64 8 1 a   177.2    64 8 1  177.2 
   2    
144 12 1  a3  279.2 144 12 1  279.2

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:23

2. Gauss Elimination Methods
 25 5 1  106.8  Divide Equation 1 by 25 and
 
 64 8 1  177.2  64
144 12 1  279.2 multiply it by 64,  2.56 .
25

25 5 1  106.8 2.56  64 12.8 2.56  273.408

. 64 8 1  177.2
Subtract the result from
 64 12.8 2.56  273.408
Equation 2
0  4.8  1.56   96.208

 25 5 1  106.8 
Substitute new equation for  0  4.8  1.56   96.208
Equation 2  
144 12 1  279.2 

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:24

2. Gauss Elimination Methods
 25 5 1  106.8  Divide Equation 1 by 25 and
 0  4.8  1.56   96.208
  144
multiply it by 144,  5.76 .
144 12 1  279.2  25

25 5 1  106.8 5.76  144 28.8 5.76  615.168

.

Subtract the result from

144 12 1  279.2
Equation 3  144 28.8 5.76  615.168
0  16.8  4.76   335.968
25 5 1  106.8 
Substitute new equation  0  4.8  1.56   96.208 
for Equation 3  
 0  16.8  4.76   335.968

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:25

2. Gauss Elimination Methods
25 5 1  106.8  Divide Equation 2 by −4.8
 0  4.8  1.56   96.208 
  and multiply it by −16.8,
 0  16.8  4.76   335.968  16.8
 3.5.
 4 .8
0  4.8 1.56   96.208 3.5  0 16.8  5.46   336.728
0  16.8  4.76  335.968
Subtract the result from
Equation 3  0  16.8  5.46   336.728
0 0 0.7  0.76

25 5 1  106.8 
Substitute new equation  0  4.8  1.56   96.208
for Equation 3  
 0 0 0.7  0.76 

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:26

2. Gauss Elimination Methods
25 5 1  106.8  25 5 1   a1   106.8 
 0  4.8  1.56   96.2   0  4.8  1.56 a    96.208
     2  
 0 0 0.7  0.7   0 0 0.7   a3   0.76 

Solving for a3
0.7a3  0.76
0.76
a3 
0.7
a3  1.08571

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:27

2. Gauss Elimination Methods
25 5 1   a1   106.8 
 0  4.8  1.56 a    96.208
   2  
 0 0 0.7   a3   0.76 

Solving for a2
 4.8a2  1.56a3  96.208
 96.208  1.56a3
a2 
 4.8
 96.208  1.56 1.08571
a2 
 4.8
a2  19.6905

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:28

2. Gauss Elimination Methods
25 5 1   a1   106.8 
 0  4.8  1.56 a    96.208
   2  
 0 0 0.7   a3   0.76 

Solving for a2
 4.8a2  1.56a3  96.208
 96.208  1.56a3
a2 
 4.8
 96.208  1.56 1.08571
a2 
 4.8
a2  19.6905

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:29

2. Gauss Elimination Methods
25 5 1   a1   106.8 
 0  4.8  1.56 a    96.2
   2  
 0 0 0.7   a3   0.76 

Solving for a1
25a1  5a2  a3  106.8
106.8  5a2  a3
a1 
25
106.8  5 19.6905  1.08571

25
 0.290472

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:30

2. Gauss Elimination Methods
 25 5 1  a1  106.8 
 64
8 1 a2   177.2 
     
144 12 1  a3  279.2
 a1  0.290472
a    19.6905 
Solution  a1  0.290472
The solution vector is
a    19.6905 
 2  
a3   1.08571 
The polynomial that passes through the three data points is then:
vt   a1t  a2t  a3
2

 2  
a3   1.08571   0.290472t 2  19.6905t  1.08571, 5  t  12

v6  0.2904726  19.69056  1.08571

2

 129.686 m/s .

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:31

3. Gauss-Jordan Elimination Methods

The process of converting the

given coefficient matrix into an
reduced row echelon matrix with
the help of elementary row
operations is known as the Gauss-
Jordan Elimination Method.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:32

3. Gauss-Jordan Elimination Methods
Ex.1: Solve given linear equation system with usin Gauss-Jordan Elimination method.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:33

3. Gauss-Jordan Elimination Methods
Ex.2 Solve given linear equation system with usin Gauss Elimination method.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:34

4. Inverse Matrix
• Identity matrix:
AI = A
• Inverse exists only for square matrices and
nonsingular(det(A)≠0)
Some matrices have an inverse, such that: 1 1 X
2 -1
=
2+1 -1 + 1
= 1 0
3 3 3 3 3 3
AA-1 = I 1 1 -2+ 2 1+2
-1 2 0 1
3 3 3 3 3 3
• Inversion is tricky:
(ABC)-1 = C-1B-1A-1

• Notation. A common notation for the inverse of a matrix A is A-1.

• The inverse matrix is unique when it exists. So if A is invertible, then
A-1 is also invertible and then (AT)-1 = (A-1)T

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:35

4. Inverse Matrix
Ex.1 Find the Inverse matrix of A matrix with using row elementary operations.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:36

4. Inverse Matrix
Ex.1 Find the Inverse matrix of A matrix with using row elementary operations.

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:37

4. Inverse Matrix
Ex.2 Validate the given matrices are Inverses of each other

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:38

 PART 5
Determinants

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:39

1. Definition of Determinants
Definition : The determinant of a square matrix is a single unique real number corresponding to a matrix. For
a matrix , determinant is denoted by A or det( A) . So do not use [ A] and A interchangeably
For a 2 2 matrix,

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:40

2. Theorems of Determinants

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:41

2. Theorems of Determinants
Ex.1

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:42

2. Theorems of Determinants
Ex.2

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:43

2. Theorems of Determinants
Ex.3

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:44

2. Theorems of Determinants
Ex.4

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:45

2. Theorems of Determinants
Ex.5

ME 103 LINEAR ALGEBRA Dr. Orhan KEKLIKCIOGLU Lecture:4/No:46