Suggested problems solutions

Similar documents
1. Solve each linear system using Gaussian elimination or Gauss-Jordan reduction. The augmented matrix of this linear system is

Solving a system of linear equations Let A be a matrix, X a column vector, B a column vector then the system of linear equations is denoted by AX=B.

Solving Systems of Linear Equations Using Matrices

7.5 Operations with Matrices. Copyright Cengage Learning. All rights reserved.

Tutorial 4 (week 4) Solutions

Chapter 2 Notes, Linear Algebra 5e Lay

SOLVING Ax = b: GAUSS-JORDAN ELIMINATION [LARSON 1.2]

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

Matrices and Determinants

Section Gaussian Elimination

Chapter 6. Linear Independence. Chapter 6

Solutions to Homework 5 - Math 3410

CHAPTER 9: Systems of Equations and Matrices

HOW TO FACTOR. Next you reason that if it factors, then the factorization will look something like,

Lecture 1 Systems of Linear Equations and Matrices

LECTURES 4/5: SYSTEMS OF LINEAR EQUATIONS

Chapter Practice Test Name: Period: Date:

MODEL ANSWERS TO THE THIRD HOMEWORK

The matrix will only be consistent if the last entry of row three is 0, meaning 2b 3 + b 2 b 1 = 0.

Linear Algebra I Lecture 8

Chapter 4. Solving Systems of Equations. Chapter 4

Lecture 2 Systems of Linear Equations and Matrices, Continued

CHAPTER 9: Systems of Equations and Matrices

Solving Consistent Linear Systems

Number of solutions of a system

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

Updated: January 16, 2016 Calculus II 7.4. Math 230. Calculus II. Brian Veitch Fall 2015 Northern Illinois University

Methods for Solving Linear Systems Part 2

Objective. The student will be able to: solve systems of equations using elimination with multiplication. SOL: A.9

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

TMA4125 Matematikk 4N Spring 2017

MATH 15a: Applied Linear Algebra Practice Exam 1

System of Linear Equations

Matrix Solutions to Linear Equations

Inverting Matrices. 1 Properties of Transpose. 2 Matrix Algebra. P. Danziger 3.2, 3.3

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

Mathematics 1350H Linear Algebra I: Matrix Algebra Trent University, Summer 2017 Solutions to the Quizzes

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

Chapter 1. Vectors, Matrices, and Linear Spaces

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Math x + 3y 5z = 14 3x 2y + 3z = 17 4x + 3y 2z = 1

7.6 The Inverse of a Square Matrix

1111: Linear Algebra I

Partial Fraction Decomposition

The Gauss-Jordan Elimination Algorithm

Linear Algebra I Lecture 10

A quadratic expression is a mathematical expression that can be written in the form 2

INVERSE OF A MATRIX [2.2]

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

Math 1314 Week #14 Notes

Chapter 3. Linear Equations. Josef Leydold Mathematical Methods WS 2018/19 3 Linear Equations 1 / 33

Exercise Sketch these lines and find their intersection.

Numerical Methods for Chemical Engineers

Exam. Name. Domain: (0, ) Range: (-, ) Domain: (0, ) Range: (-, ) Domain: (-, ) Range: (0, ) Domain: (-, ) Range: (0, ) y

Linear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4

22A-2 SUMMER 2014 LECTURE 5

1111: Linear Algebra I

Linear Equations in Linear Algebra

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

6.4 Dividing Polynomials: Long Division and Synthetic Division

CSE 160 Lecture 13. Numerical Linear Algebra

Numerical Methods Lecture 2 Simultaneous Equations

4.4 Solving Systems of Equations by Matrices

Linear System Equations

Section 4.3. Polynomial Division; The Remainder Theorem and the Factor Theorem

Numerical Methods Lecture 2 Simultaneous Equations

Systems of Equations Homework Solutions

4 Elementary matrices, continued

Chapter 1 Linear Equations. 1.1 Systems of Linear Equations

Elementary Matrices. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Chapter 6 Page 1 of 10. Lecture Guide. Math College Algebra Chapter 6. to accompany. College Algebra by Julie Miller

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

4.5 Integration of Rational Functions by Partial Fractions

1111: Linear Algebra I

Matrices and systems of linear equations

Section Matrices and Systems of Linear Eqns.

Math Computation Test 1 September 26 th, 2016 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge!

Math Fall 2012 Exam 1 UMKC. Name. Student ID. Instructions: (a) The use of laptop or computer is prohibited.

CHAPTER 8: Matrices and Determinants

MAC Module 1 Systems of Linear Equations and Matrices I

Row Reduced Echelon Form

6-1 Study Guide and Intervention Multivariable Linear Systems and Row Operations

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

March 19 - Solving Linear Systems

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

Lectures on Linear Algebra for IT

MathQuest: Linear Algebra. 1. Which of the following operations on an augmented matrix could change the solution set of a system?

Lesson 3. Inverse of Matrices by Determinants and Gauss-Jordan Method

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

18.06 Problem Set 3 Due Wednesday, 27 February 2008 at 4 pm in

Matrix notation. A nm : n m : size of the matrix. m : no of columns, n: no of rows. Row matrix n=1 [b 1, b 2, b 3,. b m ] Column matrix m=1

10. Rank-nullity Definition Let A M m,n (F ). The row space of A is the span of the rows. The column space of A is the span of the columns.

Chapter 1: System of Linear Equations 1.3 Application of Li. (Read Only) Satya Mandal, KU. Summer 2017: Fall 18 Update

ORIE 6300 Mathematical Programming I August 25, Recitation 1

MATH 54 - WORKSHEET 1 MONDAY 6/22

MATH 2050 Assignment 6 Fall 2018 Due: Thursday, November 1. x + y + 2z = 2 x + y + z = c 4x + 2z = 2

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

Review Solutions, Exam 2, Operations Research

Solving Systems of Linear Equations

2 Systems of Linear Equations

Transcription:

Suggested problems solutions Solving systems using Gauss-Jordan elimination P: Whih of the matries below are in redued row ehelon form? If a matrix is not in redued row ehelon form, explain where it fails, and use Gauss Jordan elimination to transform it to redued row ehelon form. (a) 0 3 0 4 0 0 5 Not in redued row ehelon form - the leading one in the seond row needs a zero below it. Perform R2 + R3 R3: 0 3 0 4 0 0 9 Now the third row needs a leading. Perform R3 R3: 0 3 0 4 0 0 9 And now that there s a leading one in the third row, there need to be zeros in the olumn above it. Perform R3 + R2 R2 and R3 + R R: 0 0 6 0 0 5 0 0 9 NOW, it s in redued row ehelon form.

(b) 2 4 0 Not in redued row ehelon form. First, every row should have a leading one, so perform 2 R2 R2: 2 2 2 5 The leading ones should progress inward from the top down; swap rows. R R2: 2 2 2 5 The leading one in the seond row needs a zero above it in the fourth olumn. 2R2 + R R: 2 2 0 9 NOW, it s in redued row ehelon form. () 0 0 0 7 0 0 0 0 0 0 0 This matrix is in redued row ehelon form - every row starts with a one, the ones progess inward, and every leading one has zeros above and below it. (d) 0 0 7 0 4 0 0 0 0 2 0 Not in redued row ehelon form; needs a leading one in the third row. 2 R3 R3: 0 0 7 0 4 0 0 0 0 0 And needs a zero above the leading one. 4R3 + R2 R2: 0 0 7 0 0 0 0 0 0 0 NOW, it s in redued row ehelon form.

P3: (Yes, P2 is missing) Solve using Gauss-Jordan elimination: Augmented matrix: x 2x 2 = 2x 3x 2 = 2 2 3 Leading one in the first row, get a zero below it. 2R + R2 R2: 2 0 5 Leading one in the seond row, get a zero above it. 2R2 + R R: And turn bak into a system. Instant solution: 0 2 0 5 x = 2 x 2 = 5

P4: Solve using Gauss-Jordan elimination: Augmented matrix: x 2 + 3x 3 = 2x + 2x 3 = 4 3x + x 2 2x 3 = 2 0 3 2 0 2 4 3 2 2 Divide down row two. 2 R2 R2: 0 3 0 2 3 2 2 And swap. R2 R: 0 2 0 3 3 2 2 Zero in the third row, first olumn. 3R + R3 R3: 0 2 0 3 0 5 4 Zero in third row, seond olumn. R2 + R3 R3: 0 2 0 3 0 0 5 Leading one in row 3. R3 R3: 0 2 0 3 0 0 5 Zeros above the leading one in the third olumn. 3R3 + R2 R2 and R3 + R R: 0 0 0 0 7 0 0 5 Solution: x = x 2 = 7 x 3 = 5

P5: Consider the system of equations ax + bx 2 = x + dx 2 = 0 (Assume a, b,, and d are all non-zero.) Use Gauss-Jordan elimination to transform the augmented matrix for the system to redued row ehelon form, and express the solutions for x and x 2 in terms of a, b,, and d. You have now obtained a formula that will produe solutions for all systems in this form. Augmented matrix: a b d 0 Get a one in the first row pivot position by dividing by a. Zero below the leading one. R + R2 R2: b a a d 0 a R R: For this one, I ll show the srath work (note the LCD... d = ad a... to ombine): b a a ad a 0 0 ad b a a b a a 0 ad b a a To get a leading one in the seond row, you need to multiply through by the reiproal. ( a )R2 R2 ad b (Note ( a ad b )( a ) = ad b ): b a a 0 ad b Almost there - need a zero above that one. a b R2 + R R: Srath: b a(ad b) + a = 0 b a b a(ad b) b a a 0??? b (ad b) b + ad b + = = a(ad b) a(ad b) a(ad b) 0 a b b a(ad b) b a a 0 d ad b ad a(ad b) = d ad b

0 d ad b 0 ad b Phew. Done. The solution is d x = ad b x 2 = ad b Test it out on the system x + 2x 2 = 3x + x 2 = 0 by obtaining x and x 2 from the formula, and plugging bak in to hek: x = 3 2 = 5 x 2 = 3 3 2 = 3 5 Chek: 5 + 2(3 5 ) = 5 5 = 3( 5 ) + 3 5 = 0 Yeah! Ideally, to derive a more general formula, I should have had you solve a b e d f The algebra on that would have been outrageous, though. The point here is that Gauss-Jordan is Gauss-Jordan in terms of the proess; you just get some nasty srath work if it s all symboli. Being able to solve these in the abstrat will allow us to drawn some onlusions about what it takes to have a solution. You ll notie I started by assuming none of the oeffiients were zero (to avoid potential divide by zero errors). The solution proess reveals that something else an t be zero - the quantity ad b. In other words, if ad = b, there s a problem with the solution.