Title: MAT 2401 Linear Algebra
1MAT 2401Linear Algebra
- 1.1, 1.2 Part I Gauss-Jordan Elimination
http//myhome.spu.edu/lauw
2HW
3Time
- Part I may be a bit longer today.
- Part II will be shorter next time.
4Preview
- Introduce the Matrix notations.
- Study the Elementary Row Operations.
- Study the Gauss-Jordan Elimination.
5Example 1
Elimination
6Example 1
Elimination Geometric Meaning
7How many solutions?
- Q Given a system of 2 equations in 2 unknowns,
how many solutions are possible?
A
8How many solutions?
- Q Given a system of 3 equations in 3 unknowns,
how many solutions are possible?
A
9How many solutions?
- Q Given a system of 3 equations in 3 unknowns,
how many solutions are possible?
______ System ______ System
10Unique Solution
- We will focus only on systems of unique solution
in part I. - Such systems appear a lot in applications.
-
11Example 2
Elimination
12Observation 1
Q Why eliminations are not good? A 1. 2. 3.
13Observation 2
Compare the 2 systems
Q Are the 2 systems the same? A
14Observation 2
Compare the 2 systems
Q What do the 2 systems have in common? A
15Observation 2
Compare the 2 systems
16Observation 2
Compare the 2 systems
Q Which system is easier to solve? A
17Extreme Makeover?
- We want a solution method that
- it is systematic, extendable, and easy to
automate - it can transform a complicated system into a
simple system
18Extreme Makeover?
- We want a solution method that
- it is systematic, extendable, and easy to
automate - it can transform a complicated system into a
simple system
19Extreme Makeover?
- We want a solution method that
- it is systematic, extendable, and easy to
automate - it can transform a complicated system into a
simple system
20Extreme Makeover?
- We want a solution method that
- it is systematic, extendable, and easy to
automate - it can transform a complicated system into a
simple system
21Gauss-Jordan Elimination
22Gauss-Jordan Elimination
- Before we can describe our systematic solution
method, we need the matrix notations.
23Essential Information
- A system can be represented compactly by a
table of numbers.
24Matrix
- A matrix is a rectangular array of numbers.
- If a matrix has m rows and n columns, then the
size of the matrix is said to be mxn.
25Example 2
- Write down the (Augmented) matrix representation
of the given system.
26Coefficient Matrix
- The left side of the Augmented matrix is called
the Coefficient Matrix.
27Elementary Row Operations
- We can perform the following operations on the
matrix - 1. Switching 2 rows.
- 2. Multiplying a row by a constant.
- 3. Adding a multiple of one row to another.
28Elementary Row Operations
- We can perform the following operations on the
matrix - 1. Switching 2 rows.
29Elementary Row Operations
- We can perform the following operations on the
matrix - 2. Multiplying a row by a constant.
30Elementary Row Operations
- We can perform the following operations on the
matrix - 3. Adding a multiple of one row to another.
31Elementary Row Operations
- Theory We can use the operations to simplify the
system without changing the solution. - 1. Switching 2 rows.
- 2. Multiplying a row by a constant.
- 3. Adding a multiple of one row to another.
32Elementary Row Operations
- Notations (examples)
- 1. Switching 2 rows.
- 2. Multiplying a row by a constant.
- 3. Adding a multiple of one row to another.
33Gauss-Jordan Elimination
Main Idea We want to use elementary row operations to get the matrix into the form (reduced row-echelon form RREF)
34Gauss-Jordan Elimination
Main Idea We want to use elementary row operations to get the matrix into the form (reduced row-echelon form RREF) The order of creating 0 and 1 is extremely important!
35Example 2
36Remarks
- Notice sometimes 2 parallel row operations can
be done in the same step. - The procedure (algorithm) is designed so that the
exact order of creating the 0s and 1s is
important.
37Remarks
38How do I Confirm My Answers?
39Example 3
- Use Gauss-Jordan Elimination to solve the system.
40Example 3