CH 1.2 Slides 210 SJ
CH 1.2 Slides 210 SJ
CH 1.2 Slides 210 SJ
4
Matrices (1 of 3)
Definition of a Matrix
If m and n are positive integers, then an m × n (read “m by
n”) matrix is a rectangular array
5
Matrices (2 of 3)
The entry aij is located in the i th row and the j th column. The
index i is called the row subscript because it identifies the
row in which the entry lies, and the index j is called the
column subscript because it identifies the column in which
the entry lies.
6
Example 1 – Sizes of Matrices
Each matrix has the indicated size.
7
Matrices (3 of 3)
The matrix derived from the coefficients and constant terms
of a system of linear equations is the augmented matrix of
the system. The matrix containing only the coefficients of
the system is the coefficient matrix of the system.
8
Elementary Row Operations
9
Elementary Row Operations (1 of 4)
Elementary Row Operations
1. Interchange two rows.
2. Multiply a row by a nonzero constant.
3. Add a multiple of a row to another row.
10
Example 3 – Using Elementary Row Operations to Solve a System (1 of 3)
x − 2y + 3z = 9
y + 3z = 5
2x − 5y + 5z = 17
Add −2 times the first Add −2 times the first row to the third
equation to the third equation. row to produce a new third row.
11
Example 3 – Using Elementary Row Operations to Solve a System (2 of 3)
x − 2y + 3z = 9
y + 3z = 5
−y − z = −1
Add the second equation to Add the second row to the third row to
the third equation. produce a new third row.
x − 2y + 3z = 9
y + 3z = 5
2z = 4
Multiply the third equation by Multiply the third row by
to produce a new third row.
12
Example 3 – Using Elementary Row Operations to Solve a System (3 of 3)
x − 2y + 3z = 9
y + 3z = 5
z=2
13
Elementary Row Operations (2 of 4)
Row-Echelon Form and Reduced Row-Echelon Form
A matrix in row-echelon form has the properties below.
1. Any rows 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.
14
Elementary Row Operations (3 of 4)
Row-Echelon Form and Reduced Row-Echelon Form
A matrix in row-echelon form is in reduced row-echelon
form when every column that has a leading 1 has zeros
in every position above and below its leading 1.
15
Elementary Row Operations (4 of 4)
The procedure for using Gaussian elimination with back-
substitution is summarized below.
16
Example 5 – Gaussian Elimination with Back-Substitution
Solution:
The augmented matrix for this system is
17
Example 5 – Solution (1 of 3)
Obtain a leading 1 in the upper left corner and zeros
elsewhere in the first column.
18
Example 5 – Solution (2 of 3)
Now that the first column is in the desired form, change the
second column as shown below.
19
Example 5 – Solution (3 of 3)
The matrix is now in row-echelon form, and the
corresponding system is shown below.
x1 + 2x2 − x3 =2
x2 + x3 − 2x4 = −3
x3 − x4 = −2
x4 = 3
20
Gauss-Jordan Elimination
21
Gauss-Jordan Elimination (1 of 1)
With Gaussian elimination, you apply elementary row
operations to a matrix to obtain a (row-equivalent) row-
echelon form. A second method of elimination, called
Gauss-Jordan elimination after Carl Friedrich Gauss and
Wilhelm Jordan (1842–1899), continues the reduction
process until a reduced row-echelon form is obtained.
22
Example 7 – Gauss-Jordan Elimination
Use Gauss-Jordan elimination to solve the system.
x − 2y + 3z = 9
−x + 3y = −4
2x − 5y + 5z = 17
Solution:
You used Gaussian elimination to obtain the row-echelon
form
23
Example 7 – Solution (1 of 2)
Now, apply elementary row operations until you obtain zeros
above each of the leading 1’s, as shown below.
24
Example 7 – Solution (2 of 2)
The matrix is now in reduced row-echelon form. Converting
back to a system of linear equations, you have
x= 1
y = −1
z = 2.
25
Homogeneous Systems of Linear
Equations
26
Homogeneous Systems of Linear Equations (1 of 2)
Solution:
Applying Gauss-Jordan elimination to the augmented matrix
28
Example 9 – Solution (1 of 2)
x1 + 2x3 = 0
x2 − x3 = 0.
29
Example 9 – Solution (2 of 2)
Using the parameter t = x3, the solution set is x1 = −2t,
x2 = t, and x3 = t, where t is any real number. This system
has infinitely many solutions, one of which is the trivial
solution (t = 0).
30
Homogeneous Systems of Linear Equations (2 of 2)
31