Elementary Linear

Algebra

Howard Anton
Copyright © 2010 by John Wiley & Sons,
Inc.
All rights reserved.
 GOALS
• To introduce concepts in linear algebra,
and motivate theis use and importance
through fun and interesting problems and
applications

• Note : i cannot cover everything in 2 hours

a week. It is up to you to supplement
lectures with reading outside classwork
 ASSIGNMENT
• Purpose : to give you a chance to exercise
your mind (task every week), and to
solidify the concepts introduces to you in
class
• You will not understand linear algebra if
you only sit back and listen and do not
work problems

• Exam : Midterm, and Final

 Lecture Notes
• Sometimes, I will leave parts of the slide
blank and fill it in during class, and many
times will create a new slide, in real-time,
during lecture to answer a question or add
some additional explanations, it will be
your responsibility to take notes.
 Grading and Class attendance
• Attendance : 10%
• Assignment : 15%
• Midterm : 25%
• Final : 50%

copying each others assignments or test is

strictly prohibited (No collaboration allowed)
OBJECTIVE OF THE COURSE
• To understand basic operations with vectors, and
matrices
• to become familiar with the concept of a system of
linear equations, and to undertand the number and
geometry of the solutions to these equations and
how to find them
• to understand the concept of a vector space
• to be able to formulate a variety of problems in
terms of finding the solution to a system of linear
equations and to be able to efficiently find the
solution.
MATRIX
 Matrices and Matrix Operations

● Definition
1 A matrix is a rectangular
array of numbers. The numbers in
the array are called the entries of the
matrix.

● Thesize of a matrix M is written in

terms of the number of its rows x the
number of its columns. A 2x3 matrix
has 2 rows and 3 columns
 An example
• example of size 2 x 3

• example of size 4 x 3
 NOTATION
• Size of matrix : m x n
• The entry that occurs in row i and column j
of a matrix A will be denoted by ���
�11 �12 ⋯ �1�
�21 �22 ⋯ �2�
� = [��� ] =
⋮ ⋮ ⋮ ⋮
��1 ��2 ⋯ ���
 NOTATION...Cont.
• Column Matrix : a matrix with only one column
Example : 2 x 1 matrix
• Row matrix : a matrix with only one row.
Example : 1 x 3 matrix
• Square Matrix : a matrix with the same number of rows
and columns
• Two matrices are defined to be equal if they have the
same size and their corresponding entries are equal.
Example : a = 1, b = 2, c = 3, and d = 4
• a matrix A with n rows and n columns is
called a square matrix of order n, and the
shaded entries a11, a22, ..., ann are said to
be on the main diagonal of A
 Arithmetic of Matrices
●A + B: add the corresponding entries
of A and B
● A – B: subtract the corresponding
entries of B from those of A
● Matrices A and B must be of the
same size to be added or subtracted
● cA (scalar multiplication): multiply
each entry of A by the constant c
EXAMPLE MATRIX OPERATIONS
• Let A, B and C be matrices

• A+B

• A-C
Sifat Penjumlahan
Multiplication of Matrices
 Scalar Multiples
• If A is any matrix and c is any scalar, them the product
cA is the matrix obtained by multiplying each entry of the
matix A by c. The matrix cA is said to be a scalar multiple
of A.
(��)�� = �(�)�� = ����

1
How 2A, (-1)B, 3
�
answer of example
sifat perkalian skalar
TRANSPOSES

(�� )�� = ���

 TRANSPOSE..cont.
• In special case where A is a square matrix, the transpose
of A can be obtained by interchanging entries that are
symmetrically positioned about the main diagonal.
sifat-sifat perkalian matrix
Trace
 HOMEWORK

a. D + E b. 2B - C c. -3(D+2E)
d. tr(D-3E) e. 4tr(7B) f. BT + 5CT
g. (CD)E h. tr(DET) i. (AB)C
j. (CTB)AT k. (4B)C + 2B l. (BAT - 2C)T
 Gaussian Elimination and Gauss-Jordan Elimination

n mn matrix:
 a11 a12 a13  a1n 
 a21 a22 a23  a2 n 
 a31 a32 a33  a3n  m rows
  
 
 a m1 am 2 am 3  amn 
n columns
n Notes:
(1) Every entry aij in a matrix is a number.
(2) A matrix with m rows and n columns is said to be of size mn .

(3) If m  n , then the matrix is called square of order n.

(4) For a square matrix, the entries a11, a22, …, ann are called
the main diagonal entries.
n Elementary row operation:

(1) Interchange two rows. rij : Ri  R j

(2) Multiply a row by a nonzero constant. ri( k ) : ( k ) Ri  Ri

(3) Add a multiple of a row to another row. rij( k ) : ( k ) Ri  R j  R j
n Ex : (Elementary row operation)

 0 1 3 4 
 
r12   1 2 0 3
 1 2 0 3 
 2 3 4 1 
 0 1 3 4
 
 2  3 4 1

2  4 6  2 r 1
( 12 )
 1  2 3  1
 1 3  3 0  1 3  3 0
 5  2 1 2 5  2 1 2

 1 2  4 3 r13( 2 )  1 2  4 3
 0 3  2  1 0 3  2  1
2 1 5  2 0  3 13  8
 n Ex : Using elementary row operations to solve a system
Linear System Associated Elementary
Augemented Matrix Row Operation

x  2 y  3z  9  1 2 3 9
 x  3y  4  1 3 0  4
 
2 x  5 y  5 z  17  2  5 5 17

 1  2 3 9
0 r12(1) : (1) R1  R2  R2
1 3 5
 
2  5 5 17

 1  2 3 9
0 1 3 5  r13( 2 ) : (2) R1  R3  R3
 
0  1  1  1
 Associated Elementary
Linear System Augemented Matrix Row Operation

 1  2 3 9
0 r23(1) : (1) R2  R3  R3
1 3 5
 
0 0 2 4

x  2 y  3z  9  1  2 3 9 1
( ) 1
0 1 3 5 r 2
: ( ) R3  R3
y  3z  5  
3
2
z  2 0 0 1 2

x  1
y  1
z  2
n Row-echelon form:
n Reduced row-echelon form:

(1) All row consisting entirely of zeros occur at the bottom

of the matrix.
(2) For each row that does not consist entirely of zeros,
the first nonzero entry is 1 (called a leading 1).
(3) For two successive (nonzero) rows, the leading 1 in the higher
row is farther to the left than the leading 1 in the lower row.
(4) Every column that has a leading 1 has zeros in every position
above and below its leading 1.
n Ex : (Row-echelon form or reduced row-echelon form)
 1 2  1 4 0 1 0 5
0 1 0 3 0 0 1 3
0 0 1  2 0 0 0 0

 1  5 2  1 3 1 0 0  1
0 0 1 3  2  0 1 0 2
0 0 0 1 4  0 0 1 3
0 0 0 0 1 0 0 0 0
n Gaussian elimination:
The procedure for reducing a matrix to a row-echelon form.

n Gauss-Jordan elimination:
The procedure for reducing a matrix to a reduced row-echelon
form.

n Notes:
(1) Every matrix has an unique reduced row echelon form.
(2) A row-echelon form of a given matrix is not unique.
(Different sequences of row operations can produce
different row-echelon forms.)
n Ex: (Procedure of Gaussian elimination and Gauss-Jordan elimination)
Produce leading 1
0 0  2 0 8 12
r12 2 8  6 4 12 28
2 8  6 4 12 28 0 0  2 0 
   8 12 
2 4  5 6  5 4 2 4  5 6  5 4
The first nonzero column

leading 1 Produce leading 1

r1
( 12 )
1 4  3 2 6 14 r13( 2 ) 1 4  3 2 6 14
0 0  2 0 0 0  2 0 12
8 12 
8

 
2 4  5 6  5 4 0 0 5 0  17  24
Zeros elements below leading 1 The first nonzero Submatrix
column
 leading 1
(  12 ) 1 4  3 2 6 14
r23( 5) 1 4  3 2 6 14
r 0 0
2
1 0  4  6 0 0 1 0  4  6
   
0 0 5 0  17  24 0 0 0 0 3 6
Zeros elements below leading 1 Submatrix
Produce leading 1
Zeros elsewhere
1
( )
1 4  3 2 6 14 r31( 6 ) 1 4  3 2 0 2
r3 3
0 0
0 0 1 0  4  6 1 0  4  6
   
0 0 0 0 1 2 0 0 0 0 1 2
leading 1

r32( 4 )  1 4  3 2 0 2  1 4 0 2 0 8
0 0 r21(3)
1 0 0 2 0 0 1 0 0 2 
   
0 0 0 0 1 2 0 0 0 0 1 2
 n Ex : Solve a system by Gauss-Jordan elimination method
(only one solution)
x  2 y  3z  9
 x  3y  4
2 x  5 y  5 z  17
Sol:
augmented matrix
 1  2 3 9 r12(1) , r13( 2 )  1  2 3 9 r23(1)  1  2 3 9
0 
0 
  1 3 0  4  1 3 5   1 3 5 
 2  5 5 17 0  1  1  1 0 0 2 4
1
( ) ( 2) ( 3) ( 9 )
r
3
2
 1  2 3 9 r
 21 32 , r , r31  1 0 0 1 x  1
0 1 3 5 0 1 0  1 y  1
0 0 1 2 0 0 1 2 z  2
n Ex ：Solve a system by Gauss-Jordan elimination method
(infinitely many solutions)
2 x1  4 x1  2 x3  0
3 x1  5 x2  1
Sol: augmented matrix
( 12 ) ( 3 ) (  1) ( 2 )
r
2 4  2 0 1 12 2 , r , r , r21  1 0 5 2
 3 5 0 1 0 1  3  1

the corresponding system of equations is

x1  5 x3  2
x2  3 x3   1
leading variable：x1 , x2
free variable： x3
x1  2  5 x3
x 2   1  3 x3
Let x3  t
x1  2  5t ,
x2  1  3t , tR
x3  t ,

So this system has infinitely many solutions.