Section 6.3. Matrices and Systems of Equations

Similar documents
Recall, we solved the system below in a previous section. Here, we learn another method. x + 4y = 14 5x + 3y = 2

Relationships Between Planes

Exercise Sketch these lines and find their intersection.

1 - Systems of Linear Equations

Linear Algebra I Lecture 8

Math "Matrix Approach to Solving Systems" Bibiana Lopez. November Crafton Hills College. (CHC) 6.3 November / 25

Math 1314 Week #14 Notes

Linear Equations in Linear Algebra

Pre-Calculus I. For example, the system. x y 2 z. may be represented by the augmented matrix

Solving Linear Systems Using Gaussian Elimination

9.1 - Systems of Linear Equations: Two Variables

3. Replace any row by the sum of that row and a constant multiple of any other row.

Solving Systems of Linear Equations Using Matrices

Lecture 7: Introduction to linear systems

Section 6.2 Larger Systems of Linear Equations

Gauss-Jordan Row Reduction and Reduced Row Echelon Form

CHAPTER 9: Systems of Equations and Matrices

Elementary Linear Algebra

MAC Module 1 Systems of Linear Equations and Matrices I

MAC1105-College Algebra. Chapter 5-Systems of Equations & Matrices

Chapter 2. Systems of Equations and Augmented Matrices. Creighton University

Systems of Linear Equations. By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University

CHAPTER 9: Systems of Equations and Matrices

Linear Equations in Linear Algebra

Lecture 3: Gaussian Elimination, continued. Lecture 3: Gaussian Elimination, continued

Lecture 12: Solving Systems of Linear Equations by Gaussian Elimination

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Introduction to Systems of Equations

March 19 - Solving Linear Systems

Definition of Equality of Matrices. Example 1: Equality of Matrices. Consider the four matrices

Midterm 1 Review. Written by Victoria Kala SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015

Linear Algebra Practice Problems

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Section 1.1: Systems of Linear Equations

Linear Methods (Math 211) - Lecture 2

8.2 Systems of Linear Equations: Augmented Matrices

5x 2 = 10. x 1 + 7(2) = 4. x 1 3x 2 = 4. 3x 1 + 9x 2 = 8

Row Reduction and Echelon Forms

Finite Math - J-term Section Systems of Linear Equations in Two Variables Example 1. Solve the system

LECTURES 4/5: SYSTEMS OF LINEAR EQUATIONS

Section 1.2. Row Reduction and Echelon Forms

is a 3 4 matrix. It has 3 rows and 4 columns. The first row is the horizontal row [ ]

Section Gaussian Elimination

4.3 Row operations. As we have seen in Section 4.1 we can simplify a system of equations by either:

10.3 Matrices and Systems Of

EBG # 3 Using Gaussian Elimination (Echelon Form) Gaussian Elimination: 0s below the main diagonal

Matrix Solutions to Linear Equations

0.0.1 Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros.

Algebra & Trig. I. For example, the system. x y 2 z. may be represented by the augmented matrix

Matrices and RRE Form

M 340L CS Homework Set 1

Last Time. x + 3y = 6 x + 2y = 1. x + 3y = 6 y = 1. 2x + 4y = 8 x 2y = 1. x + 3y = 6 2x y = 7. Lecture 2

Linear Algebra Handout

Lectures on Linear Algebra for IT

Notes on Row Reduction

1 Last time: linear systems and row operations

Methods for Solving Linear Systems Part 2

Determine whether the following system has a trivial solution or non-trivial solution:

4 Elementary matrices, continued

System of Linear Equations

Math 1021, Linear Algebra 1. Section: A at 10am, B at 2:30pm

Lecture 2e Row Echelon Form (pages 73-74)

4 Elementary matrices, continued

Review for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions.

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013

Chapter 1. Vectors, Matrices, and Linear Spaces

Gauss-Jordan elimination ( used in the videos below) stops when the augmented coefficient

Linear Algebra I Lecture 10

Elementary Row Operations on Matrices

MTHSC 3110 Section 1.1

6-2 Matrix Multiplication, Inverses and Determinants

Lecture 1 Systems of Linear Equations and Matrices

Section 1.1 System of Linear Equations. Dr. Abdulla Eid. College of Science. MATHS 211: Linear Algebra

Chapter 4. Solving Systems of Equations. Chapter 4

Math 2331 Linear Algebra

MATRICES. a m,1 a m,n A =

Row Reduced Echelon Form

Lecture 22: Section 4.7

Section 5.3 Systems of Linear Equations: Determinants

MATH 54 - WORKSHEET 1 MONDAY 6/22

Name: MATH 3195 :: Fall 2011 :: Exam 2. No document, no calculator, 1h00. Explanations and justifications are expected for full credit.

a. Define your variables. b. Construct and fill in a table. c. State the Linear Programming Problem. Do Not Solve.

Sections 6.1 and 6.2: Systems of Linear Equations

DM559 Linear and Integer Programming. Lecture 2 Systems of Linear Equations. Marco Chiarandini

POLI270 - Linear Algebra

MATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve:

Elementary matrices, continued. To summarize, we have identified 3 types of row operations and their corresponding

Lecture Notes: Solving Linear Systems with Gauss Elimination

Example: 2x y + 3z = 1 5y 6z = 0 x + 4z = 7. Definition: Elementary Row Operations. Example: Type I swap rows 1 and 3

Chapter 1 Linear Equations. 1.1 Systems of Linear Equations

(I.D) Solving Linear Systems via Row-Reduction

Topics. Vectors (column matrices): Vector addition and scalar multiplication The matrix of a linear function y Ax The elements of a matrix A : A ij

Lecture 4: Gaussian Elimination and Homogeneous Equations

1300 Linear Algebra and Vector Geometry Week 2: Jan , Gauss-Jordan, homogeneous matrices, intro matrix arithmetic

Lesson U2.1 Study Guide

Chapter 1: Systems of Linear Equations and Matrices

1.4 Gaussian Elimination Gaussian elimination: an algorithm for finding a (actually the ) reduced row echelon form of a matrix. A row echelon form

A Quick Introduction to Row Reduction

Transcription:

Section 6.3 Matrices and Systems of Equations

Introduction

Definitions A matrix is a rectangular array of numbers.

Definitions A matrix is a rectangular array of numbers. For example: [ 4 7 π 3 2 5

Definitions A matrix is a rectangular array of numbers. For example: [ 4 7 π 3 2 5 The order or dimension of a matrix is the number of rows by the number of columns.

Definitions A matrix is a rectangular array of numbers. For example: [ 4 7 π 3 2 5 The order or dimension of a matrix is the number of rows by the number of columns. For example, the matrix above is a 2 3 matrix.

Definitions A matrix is a rectangular array of numbers. For example: [ 4 7 π 3 2 5 The order or dimension of a matrix is the number of rows by the number of columns. For example, the matrix above is a 2 3 matrix. The entries of a matrix are the numbers inside the matrix.

Definitions A matrix is a rectangular array of numbers. For example: [ 4 7 π 3 2 5 The order or dimension of a matrix is the number of rows by the number of columns. For example, the matrix above is a 2 3 matrix. The entries of a matrix are the numbers inside the matrix. For example, in the matrix above, 4, -7, π, -3, 2, and 5 are the entries.

Augmented Matrix Every linear system can be written in a standard form - the terms with variables on the left hand side and the constant terms on the right.

Augmented Matrix Every linear system can be written in a standard form - the terms with variables on the left hand side and the constant terms on the right. When systems are written in this form, there is an equivalent augmented matrix whose entries are the coefficients and constant terms.

Augmented Matrix Every linear system can be written in a standard form - the terms with variables on the left hand side and the constant terms on the right. When systems are written in this form, there is an equivalent augmented matrix whose entries are the coefficients and constant terms. For example: 2x + 3y z = 4 5x + y + z = 0 x + 2z = 1 2 3 1 4 5 1 1 0 1 0 2 1

Augmented Matrix Every linear system can be written in a standard form - the terms with variables on the left hand side and the constant terms on the right. When systems are written in this form, there is an equivalent augmented matrix whose entries are the coefficients and constant terms. For example: 2x + 3y z = 4 2 3 1 4 5x + y + z = 0 5 1 1 0 x + 2z = 1 1 0 2 1 As a note, you might also see the augmented matrix written with a line. There s no difference between them. [ 2 3 1 4 5 1 1 0 1 0 2 1

Gaussian Elimination

Elementary Row Operations To solve a system of equations using the augmented matrix, we are allowed to perform these three row operations on the matrix: 1. Switch any two rows. [ 3 0 1 2 2 4 1 6 2 5 0 3 [ 2 5 0 3 2 4 1 6 R1 R 3 3 0 1 2

Elementary Row Operations To solve a system of equations using the augmented matrix, we are allowed to perform these three row operations on the matrix: 1. Switch any two rows. [ 3 0 1 2 2 4 1 6 2 5 0 3 R1 R 3 [ 2 5 0 3 2 4 1 6 3 0 1 2 2. Multiply the entries of a row by a nonzero number. [ 3 0 1 2 [ 4R2 R 2 3 0 1 2 8 16 4 24 2 4 1 6 2 5 0 3 2 5 0 3

Elementary Row Operations To solve a system of equations using the augmented matrix, we are allowed to perform these three row operations on the matrix: 1. Switch any two rows. [ 3 0 1 2 2 4 1 6 2 5 0 3 R1 R 3 [ 2 5 0 3 2 4 1 6 3 0 1 2 2. Multiply the entries of a row by a nonzero number. [ 3 0 1 2 [ 4R2 R 2 3 0 1 2 8 16 4 24 2 4 1 6 2 5 0 3 2 5 0 3 3. Multiply the entries of a row by a number and add it to another row. [ 3 0 1 2 2 4 1 6 2 5 0 3 [ 2R2 +R 3 R 3 3 0 1 2 2 4 1 6 2 13 2 9 4 8 2 12 (2R 2 ) 2 5 0 3 (+R 3 ) 2 13 2 9

Forms of an Augmented Matrix When we are doing our row operations, our goal is to get the matrix into one of the following forms: 1. Row Echelon Form:

Forms of an Augmented Matrix When we are doing our row operations, our goal is to get the matrix into one of the following forms: 1. Row Echelon Form: The first nonzero number in each row is a 1.

Forms of an Augmented Matrix When we are doing our row operations, our goal is to get the matrix into one of the following forms: 1. Row Echelon Form: The first nonzero number in each row is a 1. The first nonzero number in each row is farther right than the first nonzero number in the row above it.

Forms of an Augmented Matrix When we are doing our row operations, our goal is to get the matrix into one of the following forms: 1. Row Echelon Form: The first nonzero number in each row is a 1. The first nonzero number in each row is farther right than the first nonzero number in the row above it. Any row with only zeros is at the bottom of the matrix.

Forms of an Augmented Matrix When we are doing our row operations, our goal is to get the matrix into one of the following forms: 1. Row Echelon Form: The first nonzero number in each row is a 1. The first nonzero number in each row is farther right than the first nonzero number in the row above it. Any row with only zeros is at the bottom of the matrix. For example: [ 1 3 2 7 0 1 5 6 0 0 1 4 or [ 1 2 6 11 0 0 1 3 0 0 0 0

Forms of an Augmented Matrix When we are doing our row operations, our goal is to get the matrix into one of the following forms: 1. Row Echelon Form: The first nonzero number in each row is a 1. The first nonzero number in each row is farther right than the first nonzero number in the row above it. Any row with only zeros is at the bottom of the matrix. For example: [ 1 3 2 7 0 1 5 6 0 0 1 4 2. Reduced Row Echelon Form: or [ 1 2 6 11 0 0 1 3 0 0 0 0

Forms of an Augmented Matrix When we are doing our row operations, our goal is to get the matrix into one of the following forms: 1. Row Echelon Form: The first nonzero number in each row is a 1. The first nonzero number in each row is farther right than the first nonzero number in the row above it. Any row with only zeros is at the bottom of the matrix. For example: [ 1 3 2 7 0 1 5 6 0 0 1 4 or [ 1 2 6 11 0 0 1 3 0 0 0 0 2. Reduced Row Echelon Form: The same rules as Row Echelon form, but you also have to have all zeros above the leading 1 from each row.

Forms of an Augmented Matrix When we are doing our row operations, our goal is to get the matrix into one of the following forms: 1. Row Echelon Form: The first nonzero number in each row is a 1. The first nonzero number in each row is farther right than the first nonzero number in the row above it. Any row with only zeros is at the bottom of the matrix. For example: [ 1 3 2 7 0 1 5 6 0 0 1 4 or [ 1 2 6 11 0 0 1 3 0 0 0 0 2. Reduced Row Echelon Form: The same rules as Row Echelon form, but you also have to have all zeros above the leading 1 from each row. For example: [ 1 0 0 7 0 1 0 6 0 0 1 4 or [ 1 2 0 11 0 0 1 3 0 0 0 0

Strategy For Solving a System We will be using row operations to get our matrix into either Row Echelon Form or Reduced Row Echelon Form. This process is called Gaussian elimination. 1. Figure out which of the two forms you re aiming for. Don t worry about the 1 s until the last step - focus primarily on the location of the zeros.

Strategy For Solving a System We will be using row operations to get our matrix into either Row Echelon Form or Reduced Row Echelon Form. This process is called Gaussian elimination. 1. Figure out which of the two forms you re aiming for. Don t worry about the 1 s until the last step - focus primarily on the location of the zeros. If you want Row Echelon Form, this is your goal: [ # # # # 0 # # # or [ # # # # 0 # # # 0 0 # #

Strategy For Solving a System We will be using row operations to get our matrix into either Row Echelon Form or Reduced Row Echelon Form. This process is called Gaussian elimination. 1. Figure out which of the two forms you re aiming for. Don t worry about the 1 s until the last step - focus primarily on the location of the zeros. If you want Row Echelon Form, this is your goal: [ # # # # 0 # # # or [ # # # # 0 # # # 0 0 # # If you want Reduced Row Echelon Form, this is your goal: [ # 0 0 # 0 # 0 # or [ # 0 0 # 0 # 0 # 0 0 # #

Strategy For Solving a System (continued) 2. Work left to right, column by column to get the zeros where you want them for that column. You will primarily be using a combination of Row Operations 2 and 3 to get your zeros: [ 2 4 1 3 3R1 +2R 2 R 2 3 5 2 4 7 8 5 11 [ 2 4 1 3 6 12 3 9 (3R 1 ) 0 22 1 17 6 10 4 8 (+2R 2 ) 7 8 5 11 0 22 1 17

Strategy For Solving a System (continued) 2. Work left to right, column by column to get the zeros where you want them for that column. You will primarily be using a combination of Row Operations 2 and 3 to get your zeros: [ 2 4 1 3 3R1 +2R 2 R 2 3 5 2 4 7 8 5 11 [ 2 4 1 3 6 12 3 9 (3R 1 ) 0 22 1 17 6 10 4 8 (+2R 2 ) 7 8 5 11 0 22 1 17 When you move on to the second and third columns, you need to be careful to not do something that will mess up the zeros you ve already created.

Strategy For Solving a System (continued) 2. Work left to right, column by column to get the zeros where you want them for that column. You will primarily be using a combination of Row Operations 2 and 3 to get your zeros: [ 2 4 1 3 3R1 +2R 2 R 2 3 5 2 4 7 8 5 11 [ 2 4 1 3 6 12 3 9 (3R 1 ) 0 22 1 17 6 10 4 8 (+2R 2 ) 7 8 5 11 0 22 1 17 When you move on to the second and third columns, you need to be careful to not do something that will mess up the zeros you ve already created. To avoid this, make sure the two rows you use are:

Strategy For Solving a System (continued) 2. Work left to right, column by column to get the zeros where you want them for that column. You will primarily be using a combination of Row Operations 2 and 3 to get your zeros: [ 2 4 1 3 3R1 +2R 2 R 2 3 5 2 4 7 8 5 11 [ 2 4 1 3 6 12 3 9 (3R 1 ) 0 22 1 17 6 10 4 8 (+2R 2 ) 7 8 5 11 0 22 1 17 When you move on to the second and third columns, you need to be careful to not do something that will mess up the zeros you ve already created. To avoid this, make sure the two rows you use are: The same row that the entry you re changing comes from (this is absolutely mandatory - if you don t use this row your work is incorrect).

Strategy For Solving a System (continued) 2. Work left to right, column by column to get the zeros where you want them for that column. You will primarily be using a combination of Row Operations 2 and 3 to get your zeros: [ 2 4 1 3 3R1 +2R 2 R 2 3 5 2 4 7 8 5 11 [ 2 4 1 3 6 12 3 9 (3R 1 ) 0 22 1 17 6 10 4 8 (+2R 2 ) 7 8 5 11 0 22 1 17 When you move on to the second and third columns, you need to be careful to not do something that will mess up the zeros you ve already created. To avoid this, make sure the two rows you use are: The same row that the entry you re changing comes from (this is absolutely mandatory - if you don t use this row your work is incorrect). The row with the same number as the column number for the entry your changing.

Strategy For Solving a System (continued) 3. Once you have your zeros, you can get your 1 s by dividing each row by it s leading nonzero number: 1 2 R 1 R 1 1 4 2 1 8 1 R 2 R 2 1 0 4 1 13 1 5 R 3 R 1 /2 4 1 /2 3 0 1 1 /4 13 /4 0 0 5 10 0 0 1 2

Strategy For Solving a System (continued) 3. Once you have your zeros, you can get your 1 s by dividing each row by it s leading nonzero number: 1 2 R 1 R 1 1 4 2 1 8 1 R 2 R 2 1 0 4 1 13 1 5 R 3 R 1 /2 4 1 /2 3 0 1 1 /4 13 /4 0 0 5 10 0 0 1 2 4. You should end up with one of three forms:

Strategy For Solving a System (continued) 3. Once you have your zeros, you can get your 1 s by dividing each row by it s leading nonzero number: 1 2 R 1 R 1 1 4 2 1 8 1 R 2 R 2 1 0 4 1 13 1 5 R 3 R 1 /2 4 1 /2 3 0 1 1 /4 13 /4 0 0 5 10 0 0 1 2 4. You should end up with one of three forms: When you have exactly one solution: Row Echelon Form: Reduced Row Echelon Form: 1 # # # 0 1 # # 1 0 0 # 0 1 0 # 0 0 1 # 0 0 1 #

Strategy For Solving a System (continued)

Strategy For Solving a System (continued) When you have no solution (if you see a row with all zeros except for the last entry at any point, simply stop because there is no solution): # # # # # # # # 0 0 0 a where a is any number except zero.

Strategy For Solving a System (continued) When you have no solution (if you see a row with all zeros except for the last entry at any point, simply stop because there is no solution): # # # # # # # # 0 0 0 a where a is any number except zero. When you have infinitely many solutions: # # # # # # # # 0 0 0 0

Strategy For Solving a System (continued) When you have no solution (if you see a row with all zeros except for the last entry at any point, simply stop because there is no solution): # # # # # # # # 0 0 0 a where a is any number except zero. When you have infinitely many solutions: # # # # # # # # 0 0 0 0 5. If you have a solution/solutions, write the matrices back in equation form, and if needed, back substitute to solve for the variables.

Examples 1. x + 4y = 4 2x 6y = 10

Examples 1. x + 4y = 4 2x 6y = 10 2. 2a + b 2c = 12 a 1 2 b + c = 6 3a + 3 2b 3c = 18

Examples 1. x + 4y = 4 2x 6y = 10 2. 2a + b 2c = 12 a 1 2 b + c = 6 3a + 3 2b 3c = 18 no solution

Examples 1. 3. 2. x + 4y = 4 2x 6y = 10 2a + b 2c = 12 a 1 2 b + c = 6 3a + 3 2b 3c = 18 2x 1 + x 2 = 7 2x 1 x 2 + x 3 = 6 3x 1 2x 2 + 4x 3 = 11 no solution

Examples 1. 3. 2. x + 4y = 4 2x 6y = 10 2a + b 2c = 12 a 1 2 b + c = 6 3a + 3 2b 3c = 18 2x 1 + x 2 = 7 2x 1 x 2 + x 3 = 6 3x 1 2x 2 + 4x 3 = 11 (3, 1, 1) no solution

Examples 1. 3. 2. x + 4y = 4 2x 6y = 10 2x 1 + x 2 = 7 2x 1 x 2 + x 3 = 6 3x 1 2x 2 + 4x 3 = 11 2a + b 2c = 12 a 1 2 b + c = 6 3a + 3 2b 3c = 18 no solution 4. (3, 1, 1) 3r + 2s 3t = 10 r s t = 5 r + 4s t = 20

Examples 1. 3. 2. x + 4y = 4 2x 6y = 10 2x 1 + x 2 = 7 2x 1 x 2 + x 3 = 6 3x 1 2x 2 + 4x 3 = 11 2a + b 2c = 12 a 1 2 b + c = 6 3a + 3 2b 3c = 18 no solution 4. (3, 1, 1) 3r + 2s 3t = 10 r s t = 5 r + 4s t = 20 (t, 5, t)

Examples (continued) 5. The Patel s pay their babysitter $11 per hour before 11 pm and $14.50 after 11 pm. One evening, they went out for 6 hours and paid the sitter $73. What time did they return?

Examples (continued) 5. The Patel s pay their babysitter $11 per hour before 11 pm and $14.50 after 11 pm. One evening, they went out for 6 hours and paid the sitter $73. What time did they return? 1 am

Examples (continued) 5. The Patel s pay their babysitter $11 per hour before 11 pm and $14.50 after 11 pm. One evening, they went out for 6 hours and paid the sitter $73. What time did they return? 1 am 6. A student takes out $30,000 in loans to pay for school. Part was borrowed at 8% interest, part was borrowed at 10% interest, and part at 12%. The loans gained $2800 in interest after 1 year, and the amount borrowed at the 10% rate was three times the amount borrowed at the 12% rate. How much was borrowed at each rate?

Examples (continued) 5. The Patel s pay their babysitter $11 per hour before 11 pm and $14.50 after 11 pm. One evening, they went out for 6 hours and paid the sitter $73. What time did they return? 1 am 6. A student takes out $30,000 in loans to pay for school. Part was borrowed at 8% interest, part was borrowed at 10% interest, and part at 12%. The loans gained $2800 in interest after 1 year, and the amount borrowed at the 10% rate was three times the amount borrowed at the 12% rate. How much was borrowed at each rate? 8%: $14,000; 10%: $12,000; 12%: $4000