1 / 48

MATH 250 Linear Equations and Matrices

MATH 250 Linear Equations and Matrices. Topics. Preliminaries Systems of Linear Equations Matrices Algebraic Properties of Matrix Operations Special Types of Matrices and Partitioned Matrices Matrix Transformations. Systems of Linear Equations. System of m equations in n unknowns.

lweiss
Download Presentation

MATH 250 Linear Equations and Matrices

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. MATH 250Linear Equations and Matrices

  2. Topics • Preliminaries • Systems of Linear Equations • Matrices • Algebraic Properties of Matrix Operations • Special Types of Matrices and Partitioned Matrices • Matrix Transformations

  3. Systems of Linear Equations System of m equations in n unknowns

  4. Systems of Linear Equations Comments • If a system has a solution, call it consistent • If a system doesn’t have a solution, call it inconsistent • If , the system is called homogeneous. A homogeneous system always has the trivial solution • If two systems have the same solution, then they are called equivalent. The solution strategy for linear systems is to transform the system through a series of equivalent systems until the solution is obvious

  5. Matrices Systems of Equations • Consider • Define • Express system as AX=B

  6. Matrices Systems of Equations • Since the solution of the system involves the a and b values only, will often work with the augmented matrix

  7. Systems of Linear Equations Elementary Operations on Systems • Switch two equations • Multiply an equation by nonzero constant • Add multiple of one equation to another The application of any combination of elementary operations to a linear system yields a new linear system that is equivalent to the first

  8. Inverting a Matrix • Usually not a good idea to compute x=A-1b • Inefficient • Prone to roundoff error • In fact, compute inverse using linear solver • Solve Axi=bi where bi are columns of identity,xi are columns of inverse • Many solvers can solve several R.H.S. at once

  9. Solving Linear Systems Using Gaussian Elimination • Write the augmented matrix for the system • Use matrix row operations to simplify the matrix to one with 1s down the diagonal from upper left to lower right, and 0s below the 1s • Write the system of linear equations corresponding to the matrix in step 2, and use back-substitution to find the system’s solutions

  10. Theorem 1: Equivalent systems and equivalent matrices: If the augmented coefficient matrices of two linear systems are row equivalent, then the two systems have the same solution set. Definition: Echelon Matrix The matrix E is called an echelon matrix provided it has the following two properties: 1. Every row of E that consists entirely of zeros (if any) lies beneath every row that contains a nonzero element. 2. In each row of E that contains a nonzero element, the nonzero element lies strictly to the right of the first nonzero element in the preceding row (if there is a preceding row).

  11. 3x + y + 2z = 31 x + y + 2z = 19 x + 3y + 2z = 25 3x + y + 2z = 31 3 1 2 31 x + y + 2z = 19 1 1 2 19 x + 3y + 2z = 25 1 3 2 25 Use matrices to solve the system Example Solution Step 1Write the augmented matrix for the system. Linear System Augmented Matrix

  12. 1 a b c 0 1 d e 0 0 1 f 3 1 2 31 We want 1 in this position. 1 1 2 19 1 3 2 25 1 1 2 19 This was row 2; now it’s row 1. 3 1 2 31 This was row 1; now it’s row 2. 1 3 2 25 Solution Step 2Use matrix row operations to simplify the matrix to one with 1s down the diagonal from upper left to lower right, and 0s below the 1s. Our goal is to obtain a matrix of the form Example cont. . Our first step in achieving this goal is to get 1 in the top position of the first column. To get 1 in this position, we interchange rows 1 and 2. (We could also interchange rows 1 and 3 to attain our goal.)

  13. 1 1 2 19 3 1 2 31 We want 0 in these positions. 1 3 2 25 1 1 2 19 1 1 2 19 3 + (-3) 1 + (-3) 2 + (-3) 31 + (-3) 0 -2 -4 -26 1 3 2 25 1 3 2 25 We want 0 in this position. Solution Now we want to get 0s below the 1 in the first column. Example cont. Let’s first get a 0 where there is now a 3. If we multiply the top row of numbers by –3 and add these products to the second row of numbers, we will get 0 in this position. The top row of numbers multiplied by –3 gives -3(1) or –3, -3(1) or –3, -3(2) or –6, -3(19) or –57. Now add these products to the corresponding numbers in row 2. Notice that although we use row 1 to find the products, row 1 does not change. =

  14. 1 1 2 19 1 1 2 19 0 -2 -4 -26 0 -2 -4 -26 1 + (-1) 3 + (-1) 2 + (-2) 25+(-19) 0 2 0 6 1 1 2 19 We want 1 in this position. 0 -2 -4 -26 0 2 0 6 Solution We are not yet done with the first column. If we multiply the top row of numbers by –1 and add these products to the third row of numbers, we will get 0 in this position. The top row of numbers multiplied by –1 gives -1(1) or –1, -1(1) or –1, -1(2) or –2, -1(19) or –19. Example cont. Now add these products to the corresponding numbers in row 3. = We move on to the second column. We want 1 in the second row, second column.

  15. 1 1 2 19 1 1 2 19 › (0) › (-2) › (-4) › (-26) 0 1 2 13 0 2 0 6 0 2 0 6 We want 0 in this position. 1 1 2 19 1 1 2 19 0 1 2 13 0 1 2 13 0 + 0 2 + (-2) 0 + (-4) 6+(-26) 0 0 -4 -20 Solution To get 1 in the desired position, we multiply –2 by its reciprocal, -1/2. Therefore, we multiply all the numbers in the second row by –1/2 to get Example cont. = We are not yet done with the second column. If we multiply the top row of numbers by –2 and add these products to the third row of numbers, we will get 0 in this position. The second row of numbers multiplied by –2 gives -2(0) or 0, -2(1) or –2, -2(2) or –4, -2(13) or –26. Now add these products to the corresponding numbers in row 3. =

  16. 1 1 2 19 We want 1 in this position. 0 1 2 13 0 0 -4 -20 1 1 2 19 1 1 2 19 0 1 2 13 0 1 2 13 -1/4(0) -1/4(0) -1/4(-4) -1/4(-20) 0 0 1 5 Solution We move on to the third column. We want 1 in the third row, third column. Example cont. To get 1 in the desired position, we multiply –4 by its reciprocal, -1/4. Therefore, we multiply all the numbers in the third row by –1/4 to get = We now have the desired matrix with 1s down the diagonal and 0s below the 1s. Step 3Write the system of linear equations corresponding to the matrix in step 2, and use back-substitution to find the system’s solution. The system represented by the matrix in step 2 is

  17. 3 1 2 31 x + y + 2z = 19 1 1 2 19 y + 2z = 13 1 3 2 25 z = 5 Solution Example cont. We immediately see that the value for z is 5. To find y, we back-substitute 5 for z in the second equation. y + 2z = 13 Equation 2 y + 2(5) = 13 Substitute 5 for x. y = 3 Solve for y. Finally, back-substitute 3 for y and 5 for z in the first equation: x + y + 2z = 19 Equation 1 x + 3 + 2(5) = 19 Substitute 3 for y and 5 for x. x + 13 = 19 Multiply and add. x = 6 Subtract 13 from both sides. The solution set for the original system is {(6, 3, 5)}.

  18. Gaussian Elimination Definition • A matrix is in echelon form if • Any rows consisting entirely of zeros are grouped at the bottom of the matrix. • The first nonzero element of each row is 1. This element is called a leading 1. • The leading 1 of each row after the first is positioned to the right of the leading 1 of the previous row. • (This implies that all the elements below a leading 1 are zero.)

  19. Starting with the augmented matrix, create zeros below the pivot in the first column. At this stage, we create a zero only below the pivot. Echelon form Example 1 Solving the following system of linear equations using the method of Gaussian elimination. Solution We have arrived at the echelon form.

  20. We get Substitutingx4 = 2 and x3 = -5 into the first equation, Let x2 = r. The system has many solutions. The solutions are The corresponding system of equation is

  21. We arrive at the echelon form as in the previous example. Echelon form Example 2 Solving the following system of linear equations using the method of Gaussian elimination, performing back substitution using matrices. Solution This marks the end of the forward elimination of variables from equations. We now commence the back substitution using matrices.

  22. 3 This matrix is the reduced echelon form of the original augmented matrix. The corresponding system of equations is Let x2 = r. We get same solution as previously, 2

More Related