Systems of Equations

Similar documents
Lecture 12: Solving Systems of Linear Equations by Gaussian Elimination

Math 1314 Week #14 Notes

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

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

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

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

Finite Mathematics Chapter 2. where a, b, c, d, h, and k are real numbers and neither a and b nor c and d are both zero.

CHAPTER 1 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

4 Elementary matrices, continued

4 Elementary matrices, continued

Chapter 4. Solving Systems of Equations. Chapter 4

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

Linear System Equations

Solving Linear Systems Using Gaussian Elimination

System of Linear Equations

MTH 306 Spring Term 2007

Section Gaussian Elimination

System of Linear Equations. Slide for MA1203 Business Mathematics II Week 1 & 2

POLI270 - Linear Algebra

Section 6.2 Larger Systems of Linear Equations

System of Linear Equations

1 - Systems of Linear Equations

Gauss-Jordan Row Reduction and Reduced Row Echelon Form

Matrices and RRE Form

Relationships Between Planes

9.1 - Systems of Linear Equations: Two Variables

Matrices. A matrix is a method of writing a set of numbers using rows and columns. Cells in a matrix can be referenced in the form.

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

Unit 1 Matrices Notes Packet Period: Matrices

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

Methods for Solving Linear Systems Part 2

Exercise Sketch these lines and find their intersection.

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

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

Systems of Linear Equations

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

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

March 19 - Solving Linear Systems

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

Lecture 1 Systems of Linear Equations and Matrices

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

Linear Algebra I Lecture 8

Chapter 1. Vectors, Matrices, and Linear Spaces

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

Math Studio College Algebra

Notes on Row Reduction

Solving Systems of Linear Equations

1300 Linear Algebra and Vector Geometry

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

PH1105 Lecture Notes on Linear Algebra.

Chapter 1 Matrices and Systems of Equations

Solving Systems of Linear Equations Using Matrices

Lecture Notes: Solving Linear Systems with Gauss Elimination

Section 5.3 Systems of Linear Equations: Determinants

MTH 2530: Linear Algebra. Sec 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

Elementary maths for GMT

Lecture 2 Systems of Linear Equations and Matrices, Continued

CONSISTENCY OF EQUATIONS

6.3. MULTIVARIABLE LINEAR SYSTEMS

Math 2331 Linear Algebra

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

Section 1.1: Systems of Linear Equations

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

Chapter 9: Systems of Equations and Inequalities

Linear Algebra I Lecture 10

Chapter 1: Systems of Linear Equations

Pair of Linear Equations in Two Variables

Lectures on Linear Algebra for IT

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

MAC Module 1 Systems of Linear Equations and Matrices I

7.6 The Inverse of a Square Matrix

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

Dependent ( ) Independent (1 or Ø) These lines coincide so they are a.k.a coincident.

Some Notes on Linear Algebra

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

MATH10212 Linear Algebra B Homework Week 3. Be prepared to answer the following oral questions if asked in the supervision class

Lecture Notes in Mathematics. Arkansas Tech University Department of Mathematics. The Basics of Linear Algebra

Chapter 4: Linear Equations

Examples of linear systems and explanation of the term linear. is also a solution to this equation.

Matrices and Systems of Equations

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:

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

Chapter 7 Linear Systems

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

Chapter 8: Linear Algebraic Equations

3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions

x y = 1, 2x y + z = 2, and 3w + x + y + 2z = 0

Lecture 4: Gaussian Elimination and Homogeneous Equations

Solutions of Linear system, vector and matrix equation

Lecture 1: Systems of linear equations and their solutions

MATH 225 Summer 2005 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 2005

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

10.3 Matrices and Systems Of

MIDTERM 1 - SOLUTIONS

Problem Sheet 1 with Solutions GRA 6035 Mathematics

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

Lecture 7: Introduction to linear systems

1 Last time: linear systems and row operations

Transcription:

Prerequisites: Solving simultaneous equations in 2 variables; equation and graph of a straight line. Maths Applications: Finding circle equations; finding matrix inverses; intersections of lines and planes. Real-World Applications: Finding currents and voltages in electrical circuits; chemical reactions. Linear Systems and the Augmented Matrix Linear equations are very important objects of study in maths (and outside of it). A linear equation in n variables (aka unknowns) is an equation of the form, a 1 x 1 + a 2 x 2 + + a x = b n n where a i, b R. The next definition extends the concept of simultaneous equations to more than 2 equations in 2 unknowns. A system of m linear equations in n unknowns is a collection of linear equations, a x + a x + + a x = b 11 1 12 2 1n n 1 a x + a x + + a x = b 21 1 22 2 2n n 2 a x + a x + + a x = b m1 1 m2 2 mn n m where a ij, b i R. M Patel (April 2012) 1 St. Machar Academy

Sometimes a system of m linear in n unknowns is referred to as an m n system. In this course, we will study the case of (at most) systems. The problem is to solve for the unknowns (if possible). There are possibilities. Unique solution. Infinitely many solutions. No solution. A consistent system of linear equations is one that has a unique solution or infinitely many solutions. An inconsistent system of linear equations is one that has no solutions. Example 1 The 2 2 system, + y = 6 x + y = 2 has the unique solution x = 4, y = 2. Example 2 The 2 2 system, + 2y = 10 x + y = 5 has infinitely many solutions; for example, (x, y) = (0, 5), (1, 4), (2, ), M Patel (April 2012) 2 St. Machar Academy

(1 6, 4), (π, 1 π), or more generally, (x, y) = (t, 1 t) ( t R). Example The 2 2 system, + y = + y = 4 has no solutions, as equating the 2 equations leads to the absurd conclusion that = 4. An underdetermined system of linear equations is one with fewer equations than unknowns. Note that underdetermined systems may be consistent or inconsistent (in the consistent case, there must be infinitely many solutions). Example 4 The 1 2 system, + y = which is clearly underdetermined, has infinitely many solutions (similar to Example 2). Example 5 The 2 system, + y + z = 4x + 2y + 2z = 7 which is obviously underdetermined, has no solutions (similar to Example ). M Patel (April 2012) St. Machar Academy

An overdetermined system of linear equations is one with more equations than unknowns. Note that overdetermined systems may be consistent or inconsistent. Example 6 The 2 system, + 4y = 14 x + 2y = 7 x + 2y = is clearly overdetermined and inconsistent (7 = ). Example 7 The 2 system, + 4y = 14 x + 2y = 7 x + 6y = 21 is clearly overdetermined and has infinitely many solutions of the form (x, y) = (7 2t, t) ( t R). Example 8 The 2 system, + 4y = 14 x + 2y = 7 x + y = 10 is clearly overdetermined and has a unique solution x = 1, y =. M Patel (April 2012) 4 St. Machar Academy

With systems greater than 2 2, solving linear equations through traditional approaches such as substitution or elimination becomes very lengthy. However, a technique discovered in ancient China (about 200 B.C.E.) and independently in Europe by Isaac Newton can be used to solve linear systems in a much slicker manner. The technique is named after Carl Friedrich Gauss who used the technique to solve a problem in astronomy involving a 6 6 system. Gaussian Elimination The technique involves picking out all the numbers in the system of equations and writing them in the same arrangement as given in the equations. Although we mainly study systems, the following definitions apply in more general cases. The Coefficient Matrix of the system, ax + by + cz = j dx + ey + fz = k gx + hy + iz = l is the arrangement (aka matrix), a b c d e f g h i whereas the Augmented Matrix is, a b c j d e f k g h i l Gaussian Elimination works by considering the rows of the Augmented Matrix and applying some operations to the rows. These operations are M Patel (April 2012) 5 St. Machar Academy

called Elementary Row Operations (EROs). Elementary Row Operations are of types. Multiply a row by a non-zero scalar. Add or subtract 2 rows. Interchange 2 or more rows. Each time an ERO is applied, the system changes. The EROs are designed to make the new system have the same solution (if it exists) of the original system. Quite often, the first 2 row operations are combined into the following operation. Add/subtract a multiple of one row to/from another row. Applying an ERO is called row reduction or row reducing the Augmented Matrix. The Augmented Matrix is row-reduced into the following form. A matrix is in echelon form if (i) all non-zero rows are above any rows of zeros (ii) each non-zero row has more leading zeros than the previous row. An example is, a b c 0 e f 0 0 i Gaussian Elimination involves transforming the Coefficient Matrix to echelon form. The existence and type of solution of the system essentially depends on the last row of the transformed Augmented Matrix. Once the solution for one of the variables is obtained, the other solutions are obtained by back-substitution into the remaining equations. M Patel (April 2012) 6 St. Machar Academy

No Solution Theorem: A system is inconsistent if the Augmented Matrix is transformed into, a b c j 0 e f k (l 0) 0 0 0 l Example 9 Show that the system of equations, has no solution. x + y + z = 150 x + 2y + z = 100 + y + 4z = 200 The Augmented Matrix is, 1 1 1 150 1 2 100 2 4 200 R R R 2 2 1 R R 2R 1 R R R 2 1 1 1 150 0 1 2 50 0 1 2 100 1 1 1 150 0 1 2 50 0 0 0 50 Hence, as the LHS is 0 but the RHS in non-zero, there is no solution. M Patel (April 2012) 7 St. Machar Academy

Infinitely Many Solutions Theorem: A system has infinitely many solutions if the Augmented Matrix is transformed into, a b c j 0 e f k 0 0 0 0 Example 10 Find the value of k for which the following system has infinitely many solutions, and find the solutions. x + 2y + 2z = 11 x y + z = 8 4x y + kz = 5 The Augmented Matrix is, 1 2 2 11 1 1 8 4 1 k 5 R R R 2 2 1 R R 4R 1 R R R 2 1 2 2 11 0 1 0 9 k 8 9 1 2 2 11 0 1 0 0 k 11 0 M Patel (April 2012) 8 St. Machar Academy

For there to be infinitely many solutions, the last row must consist entirely of zeros; hence, k 11 = 0 k = 11. The remaining 2 equations can be translated into x, y and z form as, x + 2y + 2z = 11 y + z = t + Putting z = t into the second equation gives y = and the first 2( t + ) equation then gives, x = 11 2t x = 27 8 t. Hence, the solutions are, x = 27 8 t t +, y =, z = t ( t R) Unique Solution Theorem: A system has a unique solution if the Augmented Matrix is transformed into, a b c j 0 e f k (i 0) 0 0 i l Example 11 Find the solution to the system, x + y + z = 2 4x + 2y + z = 4 x y + z = 4 The Augmented Matrix is, M Patel (April 2012) 9 St. Machar Academy

1 1 1 2 4 2 1 4 1 1 1 4 R R 4R 2 2 1 R R R 1 R R 2 R R R 2 1 1 1 2 0 2 4 0 2 0 2 1 1 1 2 0 2 0 2 0 2 4 1 1 1 2 0 2 0 2 0 0 6 In terms of the unknowns, this is, x + y + z = 2 2y = 2 z = 6 The third and second equations respectively give z = 2 and y = 1. Back-substitution into the first equation then gives x = 2 2 + 1 = 1. Hence, the unique solution is x = 1, y = 1, z = 2. Ill-Conditioned Systems A system is ill-conditioned when changing the entries of the Augmented Matrix by a small amount induces a large change in the solution of the system. M Patel (April 2012) 10 St. Machar Academy

In this course, ill-conditioning will be studied only for 2 2 systems. Example 12 The system, + y = 4 + 1 01y = 4 02 has solution x = 1, y = 2. Changing the coefficients slightly thus, + y = 8 2 0 + y = 4 02 yields a system which has solution x = 11, y = 18 2. So, a small change in the coefficients leads to a large change in the solution. This system is ill-conditioned. Notice that in either system, the equations represent lines whose gradients are almost equal (the lines are almost parallel). In fact, this is the best way to think about ill-conditioned systems. 2 lines that are almost parallel will intersect at a given point; if the gradients of the lines are changed by a small amount, then the intersection point can be very different. Example 1 The system, + 9y = 17 x 5y = 4 is not ill-conditioned, as the gradients of the lines are not very similar (one is negative and the other is positive). M Patel (April 2012) 11 St. Machar Academy