# Linear Equations ! \$ & " % & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development

Save this PDF as:

Size: px
Start display at page:

Download "Linear Equations ! 25 30 35\$ & " 350 150% & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development"

## Transcription

1 MathsTrack (NOTE Feb 2013: This is the old version of MathsTrack. New books will be created during 2013 and 2014) Topic 4 Module 9 Introduction Systems of to Matrices Linear Equations Income = Tickets! Price = =! \$! \$ # &# & " % " %! 8,250 9,000 9,750\$ # & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development MATHS LEARNING CENTRE Level 1, Schulz Building (G3 on campus map) TEL FAX Level 3, Hub Central, North Terrace Campus, The University of Adelaide TEL FAX

2 This Topic... Many practical problems in economics, engineering, biology, electronics, communication, etc can be reduced to solving a system of linear equations. These equations may contain thousands of variables, so it is important to solve them as efficiently as possible. The Gauss-Jordan method is the most efficient way for solving large linear systems on a computer, and is used in specialist mathematical software packages such as MATLAB. The Gauss-Jordan method can also be used to find the complete solution of a system of equations when there infinitely many solutions. This topic introduces the Gauss and Gauss-Jordan methods. For convenience, the examples and exercises in this module use small systems of equations, however the methods are applicable to systems of any size. The topic has 3 chapters: Chapter 1 introduces systems of linear equations and elementary row operations. It begins by showing how solving a pair of simultaneous equations in two variables using algebra is related to Gauss s method for solving a large system of linear equations, and then explains the difference between the Gauss and the Gauss-Jordan methods. After reading this chapter, you will have a good understanding of how to solve a large system of linear equations using elementary row transformations. Chapter 2 examines systems of linear equations that do not have a unique solution 1. The chapter shows how to recognise when systems have no solutions or have infinitely many solutions, and how to describe the solutions when there are infinitely many. Chapter 3 explains how to use Gauss-Jordan elimination to find the inverse of a matrix. Auhor: Dr Paul Andrew Printed: February 24, A system of linear equations can have one solution, no solutions or infinitely many solutions. When it has exactly one solution, it is said to have a unique solution. i

3 Contents 1 Systems of Linear Equations Linear Equations Elementary Row Operations Echelon Form Consistent and Inconsistent systems The Geometry of Linear Systems Systems Without Unique Solutions Matrix Inverses 21 A Simultaneous Equations in Two Unknowns 24 B Answers 26 ii

4 Chapter 1 Systems of Linear Equations 1.1 Linear Equations If a, b, c are numbers, the graph of an equation of the form ax + by = c is a straight line. Accordingly this equation is called a linear equation in the variables x and y. When an equation has only 2 or 3 variables, we usually denote the variables by the letters x, y and z, but when there are more it is often convenient to denote the variables by x 1, x 2,..., x n. In general, a linear equation in variables x 1, x 2,..., x n is one that can be put in the form (1.1) a 1 x 1 + a 2 x a n x n = b, where a 1, a 2,..., a n are the coefficients of the variables. Notice that the variables occur only to the first power in the equation, that they do not appear in the arguement of any function such as a logarithm or exponential or any other sort of function, and that the variables are not multiplied together. linear & nonlinear equations The equations 2x + y = 7 z = 2x 6y 3x 1 2x 2 + 5x 3 + x 4 = 4 are all linear equations as they can be put in the form (1.1) above, whereas 2x 2 + y = 7 z = 2 ln x 6 exp y 3x 1 2x 2 + 5x 3 x 4 = 4 are not linear equations. 1

5 2 CHAPTER 1. SYSTEMS OF LINEAR EQUATIONS A solution of an equation is a set of numerical values for the variable which satisfies the equation. solution of linear equation Two solutions of 2x + y = 7 are x = 3, y = 1 and x = 1, y = 5. One solution of 3x 1 2x 2 + 5x 3 + x 4 = 4 is (x 1, x 2, x 3, x 4 ) = (1, 1, 1, 1). We often need to solve a number of linear equations at the same time. A collection of linear equations is called a system of linear equations or a linear system. The linear system below has n variables (or unknowns) x 1, x 2,..., x n in m equations. (1.2) a 11 x 1 + a 12 x a 1n x n = b 1n a 21 x 1 + a 22 x a 2n x n = b 2n.. a m1 x 1 + a m2 x a mn x n = b mn A solution of a linear system is a set of numbers which satisfies each of the equations simultaneously. A linear system has either one solution, no solutions, or infinitely many solutions. 1 solution of linear system The only solution of the system of equations 2x + y = 7 x y = 2 is (x, y) = (3, 1). [Check by substitution. The system of equations 2x + y = 7 2x + y = 6 has no solution as the left sides are equal but the right sides are not. The system of equations 2x + y = 7 2x + y = 7 has infinitely many solutions - all number pairs (x, y) satisfying 2x + y = 7. A system of equations with at least one solution is called consistent and a system with no solutions is called inconsistent. 1 If a linear system has two solutions then it must have infinitely many solutions.

6 1.2. ELEMENTARY ROW OPERATIONS Elementary Row Operations Appendix A revises how to solve pairs of simultaneous equations. These methods are not easy to use on larger systems of equations so another method is needed. This is called Gaussian elimination. 2 Gauss s method is to transform the original system of equations into another system of equations which have the same solution but which is easier to solve. The method is efficient, simple and easy to program on a computer. Two systems of linear equations are called equivalent if they have the same solutions. equivalent linear system The system of linear equations x + 4y = 17 2x + 3y = 9 has the same solutions as the system x + 4y = 17 y = 5, so they are equivalent systems of equations. However, the second system is much easier to solve. Using back-substitution: y = 5 x = 17 4y = = 3. The first system of equations in this example can be written as a matrix equation AX = B where A is the coefficient matrix, i.e. [ [ 1 4 x 2 3 y = [ 17 9 (Verify by matrix multiplication that this represents the same pair of equations.) In Gauss s method this matrix equation is represented in the form of a table [ [A B = Carl Freidrich Gauss ( ) is considered to be one of the three greatest mathematicians of all time (the others being Archimedes and Newton). He is said to have been the last mathematician to know everything in mathematics..

7 4 CHAPTER 1. SYSTEMS OF LINEAR EQUATIONS which is called an augmented matrix. 3 An augmented matrix is a shorthand way of writing a linear system without using variables, and corresponds to the way information about the system is entered into a computer. Augmented matrices are called equivalent when the corresponding linear systems are equivalent. equivalent augmented matrix The second linear system in the previous example x + 4y = 17 y = 5 is represented by the equivalent augmented matrix [ The augmented matrix for the general linear system in (1.2) is a 11 a a 1n b 1n a 21 a a 2n b 2n (1.3) [A B =... a m1 a m2... a mn b mn In Gauss s method we apply elementary row operations (see below) to rows of an augmented matrix. Each row corresponds to an equation in a system of equations, and the new system of equations formed after application of the elemenatry row operations is equivalent to the original system. Elementary Row Operations (EROs) 1. Interchange two rows (equations). 2. Add a multiple of one row (equation) to another. 3. Multiply a row (equation) by a nonzero number. The system of equations 2x + 3y = 9 x + 4y = 17 is solved below by using elementary row operations to transform it into a simpler equivalent system. 3 Augmented means enlarged.

8 1.2. ELEMENTARY ROW OPERATIONS 5 Step 1: Represent the system of equations as an augmented matrix. [ Step 2: Interchange row 1 and row 2. [ [ 2x + 3y = 9 x + 4y = 17 [ x + 4y = 17 2x + 3y = 9 Step 3: Add 2 row 1 to row 2 to create a zero in the (1, 2) position. 4 [ [ x + 4y = 17 5y = 25 Step 4: Multiply row 2 by 1 5. [ [ x + 4y = 17 y = 5 The solution can now be found from the last equivalent system of equations by using back substitution: y = 5 x = 17 4 y = 3 The most efficient way of solving a system of linear equations is to transform the associated augmented matrix into an equivalent matrix having only zeros below the leading diagonal. When an augmented matrix is in this form the corresponding system of equations can be solved by back substitution The most systematic way of performing this transformation is to first obtain zeros in the first column below the leading diagonal, then obtain zeros in the second column, etc. If you are working by hand then it is best to avoid introducing fractions until the final stages. Note. It is good practice to record each row operation so you can retrace your steps if there is a mistake. 4 This is an example of the second ERO. It just means that we subtract 2 row 1 from row 2

9 6 CHAPTER 1. SYSTEMS OF LINEAR EQUATIONS Solve x 1 + 4x 2 + x 3 = 3 2x 1 3x 2 2x 3 = 5 2x 1 + 4x 2 + 2x 3 = 6 Answer Step 1: Represent linear system as an augmented matrix (*) Step 2: Add 2 row 1 to row 2, then add 2 row 1 to row R2 = R2 2 R1 5 R3 = R3 2 R If we next divide row 2 by 11, then we will introduce the fractions 4 and 11. It is better to interchange rows 2 and Step 3: Interchange rows 2 and 3, then divide the new row 2 by R2, R3 = R3, R2 R2 = R2 ( 4) Step 4: Multiply row 2 by 11 and add it to row R3 = R R Step 5: Divide row 3 by ( 4) R3 = R3 ( 4) Step 6: Solve by back substitution x 3 = 1/4 x 2 = 0 x 1 = 3 4x 2 x 3 = 5 5 This records that the new row 2 is obtained from (*) by subtracting 2 row 1 from row 2. 6 This is an ERO as it is the same as multiplying by 1 4.

10 1.2. ELEMENTARY ROW OPERATIONS 7 Exercise Represent the following systems of equations as augmented matrices. (a) 2x 3y + 2z = 4 x + 5y + 4z = 1 7x + 2y 3z = 3 (b) 3x 2 + 2x 3 = 7 x 1 + 4x 2 = 3 3x 1 + 3x 2 + 8x 3 = 1 2. Write down the system of equations in unknowns p, q which has augmented matrix [ (a) Which of the following operations are elementary row operations? i. Multiply row 2 by 2. ii. Multply row 1 by 3 and add it to row 2. iii. Multply row 2 by -3 and add it to row 1. iv. Replace row 2 by the sum of row 1 and row 2. v. Subtract row 2 from row 1. vi. Add 5 to each element in row 1. vii. Interchange column 1 and column 2. (b) Perform operations i-v on the augmented matrix [ Use back-substitution to solve x 1 + 4x 2 x 3 = 3 x 2 + 2x 3 = 1 x 3 = Solve each of the linear systems below by using EROs. (a) x 2y = 1 2x + y = 7 (b) 2r 3s = 6 r 7s = 25 (c) x 1 2x 2 3x 3 = 7 2x 1 + 3x 2 5x 3 = 13 3x 1 4x 2 7x 3 = 15 (d) 2x + y + 3z = 11 4x + 3y 2z = 1 6x + 5y 4z = 4

11 8 CHAPTER 1. SYSTEMS OF LINEAR EQUATIONS 1.3 Echelon Form It is useful to have a standard method for solving to all linear systems. This will allow us to systematically describe and solve systems of equations, and interpret the solutions. A standard procedure is also better for computer computation. There are two standard methods for solving linear systems: Gaussian elimination and Gauss-Jordan 7 elimination. In each method it is the final augmented matrix that is important rather than the sequence of EROs leading to it. Gaussian elimination consists of transforming an augmented matrix into row-echelon form, and Gauss-Jordan elimination consists of transforming an augmented matrix into reduced row-echelon form. Definition A matrix is said to have row-echelon form 8 if 1. All rows that contain only zeros (called zero rows) are at the bottom of the matrix. 2. The first nonzero element in each nonzero row is a 1 (called the leading 1 or pivot). 3. The leading 1 in any nonzero row is to the right of the leading 1 in any row above it. Row-echelon matrices have a staircase appearance, e.g Here the astrisks stand for numbers, the leading 1 s proceed downward and to the right, and all elements below and to the left of the leading ones are zero. row-echelon form (a) The following matrices are in row-echelon form: [ (b) The matrices below are not in row-echelon form: [ [ [ Camille Jordan ( ) was an eminent French mathematician 8 Echelon comes from the French word echelle meaning ladder. Solving a set of equations by back-substitution is like climbing up a ladder.

12 1.3. ECHELON FORM 9 Definition An augmented matrix has reduced row-echelon form if it has row-echelon form and if 4. Each leading 1 is the only nonzero entry in its column. reduced row-echelon form (a) The following matrices are in reduced row-echelon form: [ (b) The matrices below are not in reduced row-echelon form: [ [ [ Gaussian and Gauss-Jordan elimination are both important and you will need to know understand each method. One difference between the two methods is that when an augmented matrix is transformed into row-echelon form, it is possible to arrive at different row-echelon forms by choosing different sequences of EROs, in other words the row-echelon form is not unique. In contrast, when an augmented matrix is transformed into reduced row-echelon form, the final matrix is always the same no matter what sequence of EROs was used, in other words the reduced row-echelon form of a matrix is unique. Every row-echelon matrix can be transformed into a reduced row-echelon matrix by applying more EROs. In pen and paper calculations it is best to transform matrices into row-echelon form first and then, if required, into reduced row-echelon form by eliminating the zeros above the leading ones in a column-by-column fashion. Appendix C describes further refinements. Exercise Which of the following matrices are in (i) row-echelon form (but not reduced row-echelon form), (ii) reduced row-echelon form, or (iii) neither? (a) (d) (g) (b) (e) (h) (c) (f) (i) [

13 10 CHAPTER 1. SYSTEMS OF LINEAR EQUATIONS 2. Use elementary row operations to reduce the following matrices to row-echelon form and reduced row-echelon form. [ [ (a) (b) (c) Use Gaussian elimination to solve (a) 2x 3y = 1 x 2y = 2 (b) 2x 1 x 2 x 3 = 2 x 1 + x 2 x 3 = 3 x 1 + x 2 + x 3 = 1 4. Use Gauss-Jordan elimination to solve (a) 2p + 3q = 3 p + 2q = 3 (b) x 1 x 2 x 3 = 1 x 1 + x 2 x 3 = 3 x 1 + x 2 + x 3 = 1

14 Chapter 2 Consistent and Inconsistent systems 2.1 The Geometry of Linear Systems Systems of linear equations can have one solution, no solutions or infinitely many solutions. It is important to understand the reason for this. The system of two linear equations in two unknowns in (2.1) can be thought of geometrically as a pair of straight lines. This helps us interpret the solutions. (2.1) a 1 x + b 1 y = c 1 a 2 x + b 2 y = c 2, There are three ways in which two lines can meet (or not meet). (i) The lines could intersect in a single point. system with a unique solution... the simultaneous equations x y = 1 x + y = 3 have the unique solution (x, y) = (2, 1). 11

15 12 CHAPTER 2. CONSISTENT AND INCONSISTENT SYSTEMS (ii) The lines could be parallel. system with no solutions... the system of equations x + y = 4 x + y = 2 has no solutions as the lines never meet. (iii) The lines could coincide. infinitely many solutions... the pair of equations 2x y = 1 4x + 2y = 1 has infinitely many solutions - every point on the line gives a solution. The geometric interpretations above allow us to understand why some systems can have no solutions and others have infinitely many solutions. Systems of linear equations in three variables are more complex: (2.2) a 11 x 1 + a 12 x 2 + a 13 x 3 = b 1 a 21 x 1 + a 22 x 2 + a 23 x 3 = b 2 a 31 x 1 + a 32 x 2 + a 33 x 3 = b 3. We can think of a linear equation in three variables as the equation of a plane in three dimensional geometry (each variable representing a co-ordinate). The plane x 1 + x 2 + x 3 = 3 is shown below. Each variable represents a coordinate. The plane extends in all directions (this is diffcult to represent in a diagram).

16 2.1. THE GEOMETRY OF LINEAR SYSTEMS 13 If we just consider the first two linear equations in (2.2) (2.3) a 11 x 1 + a 12 x 2 + a 13 x 3 = b 1 a 21 x 1 + a 22 x 2 + a 23 x 3 = b 2, then the corresponding planes may: (i) intersect in a line, (ii) be parallel, or (iii) coincide.

17 14 CHAPTER 2. CONSISTENT AND INCONSISTENT SYSTEMS Each of the equations in (2.3) is a constraint on the values that (x 1, x 2, x 3 ) can take. When the planes meet in a straight line in (i), the values of (x 1, x 2, x 3 ) that satisfy both constraints correspond to the points on the line of intersection, and when the planes are parallel in (ii), there are no values of (x 1, x 2, x 3 ) that satisfy both constraints. If a third constraint is added, as in (2.2), then the linear system may have (a) a unique solution, (b) no solutions or (c) infinitely many solutions, according to whether the three planes (a) intersect in a point, (b) don t intersect at all or (c) either intersect in a line or coincide. The diagrams below show some of these possibilities. (a) Three planes meeting in a single point. (b) Three planes without a common point. (This can happen in multiple ways.) (c) Three planes meeting in a line.

18 2.1. THE GEOMETRY OF LINEAR SYSTEMS 15 A system of linear equations has either a unique solution, no solutions or infinitely many solutions Exercise The linear system below has a unique solution. Interpret this geometrically. 2x 3y = 1 x + y = 3 x + 6y = 8 2. For any numbers a, b 0, the line a(2x 3y 1) + b(x + y 3) = 0 passes through the intersection of the lines 2x 3y 1 = 0 and x + y 3 = 0. Find the values of a, b that give the third equation in exercise Sketch all the ways three planes can be arranged so that: i. the planes have no point that is common to all. ii. the planes have at least two points common to all.

19 16 CHAPTER 2. CONSISTENT AND INCONSISTENT SYSTEMS 2.2 Systems Without Unique Solutions A system of linear equations is said to be consistent if it has at least one solution and inconsistent if it has no solutions. We can tell if a system of linear equations is consistent or inconsistent by transforming its augmented matrix into either row elechon or reduced-row form. A system is inconsistent if any row has a leading one in the last column: This is because this row is equivalent to the equation 0x x n = 1 which has no solution. Note that when doing row operations, it is possible to tell if the system is inconsistent before getting to row echelon form. In particular, if the final row contains all zeros except for the final entry, then this final entry does not have to be a 1 in order for the system to be inconsistent it could be any nonzero number. inconsistent system The linear system has augmented matrix x 1 + x 2 x 3 = 2 x 1 x 2 + x 3 = 2 x 1 x 2 + x 3 = , and this can be transformed into row echelon form As there is a leading 1 in the last column, the system is inconsistent. Note. A system is consistent when it is not inconsistent. consistent or inconsistent?

20 2.2. SYSTEMS WITHOUT UNIQUE SOLUTIONS 17 For what value of k is the following linear system consistent? x 1 + x 2 x 3 = 2 x 1 x 2 + x 3 = 2 x 1 x 2 + kx 3 = 4 Answer. The system has augmented matrix , 1 1 k 4 and this can be transformed into echelon form k 1 6 The system is inconsistent when k = 1, and is consistent when k 1. If a linear system is consistent, then it may have a unique solution or may have infinitely may solutions. Definition In a linear system, the variables that correspond to columns with leading 1 s are called basic variables. Any remaining variables are called free variables. If a linear system is consistent, and: if every variable is a basic variable, for example , then the system has a one unique solution and this can be found by backsubstitution. if there is at least one free variable, for example , then the system has infinitely many solutions.

21 18 CHAPTER 2. CONSISTENT AND INCONSISTENT SYSTEMS inconsistent system The system of linear equations x 1 x 2 + x 3 = 3 2x 1 x 2 + 4x 3 = 7 3x 1 5x 2 x 3 = 7 has augmented matrix , and this can be transformed into reduced echelon form This shows that: i. the system is consistent as there is no leading 1 in the last column. ii. there are infinitely many solutions as x 3 is a free variable. The original linear system has the same solutions as x 1 + 3x 3 = 4 x 2 + 2x 3 = 1,... and solutions can be found by giving values to the free variable x 3 then evaluating the basic variables x 1 and x 2. Back- To describe the general solution, assign the arbitrary value t to x 3. substitution now shows that x 2 = 1 2x 3 = 2t + 1 and x 1 = 4 3x 3 = 3t + 4. So the general solution to this system of equations is (x 1, x 2, x 3 ) = ( 2t + 1, 3t + 4, t) where t R 1 can have any value, and the set of all solutions is {( 2t + 1, 3t + 4, t) t R} In this example the arbitary value t R is called a parameter, and the general solution ( 2t + 1, 3t + 4, t) is called a parametric solution. 1 R is the set of all real numbers

22 2.2. SYSTEMS WITHOUT UNIQUE SOLUTIONS 19 Exercise Find all solutions (x, y, z) of the linear systems that have been transformed into the row echelon forms below. (a) (c) 2. The two planes intersect in a straight line. (a) Find the points on this line. (b) (d) x + y + z = 1 x y + 3z = (b) Where does the line meet the the xy-plane (z = 0). 3. For what value of k does the linear system x 1 + 2x 2 + x 3 = 4 5x 1 + 2x 2 3x 3 = k x 1 + 2x 2 + 3x 3 = 4 have a solution. Find all solutions for this value of k. 4. Show that the system of linear equations 2x + 3y + 4z = 3 x + y 8z = 1 5x + 6y 20z = u can be solved if and only if u = 6. Intepret this fact geometrically. 5. Find a condition on b 1, b 2 and b 3 for system of equations u + 2v + 3w = b 1 2u + v w = b 2 4u + 5v + 5w = b 3 to have a solution in u, v and w.

23 20 CHAPTER 2. CONSISTENT AND INCONSISTENT SYSTEMS 6. Consider the system of linear equations where k is a real constant. x 1 2x 2 + 3x 3 = 1 x 1 + kx 2 + 2x 3 = 2 2x 1 + k 2 x 2 4x 3 = 3k 4 (a) Write the system of equations in augmented matrix form. (b) Use row operations to transform the augmented matrix into the form k k 2k (c) State the value of k for which the system has an infinite number of solutions. Represent these solutions in parametric form and give a geometric interpretation. (d) State the values of k for which the system has no solution. (e) For what values of k does the system have a unique solution?

24 Chapter 3 Matrix Inverses Gauss-Jordan elimination can be used to find the inverse of a square matrix. If A is a square matrix of order n and I n is the identity matrix of order n, then: 1. form the augmented matrix [A I n, 2. use EROs to transform [A I n to reduced row echelon form. If the transformed matrix has the form [I n B, then B = A 1. If the first n n submatrix is not I n, then A does not have an inverse. invertible 3 3 matrix Find the inverse of A = Answer. The augmented matrix is [A I n = Transformation to reduced row echelon form gives = [I n B, where B is the inverse of A. 21

25 22 CHAPTER 3. MATRIX INVERSES uninvertible matrix Is the matrix invertible? H = [ Answer. The augmented matrix is [H I = [ This is equivalent to [ so H does not have an inverse., Note. The 2 2 matrix has inverse matrix if and only if its determinant is not zero. [ a b A = c d A 1 = 1 [ A A = a c d c b a b d = ad bc There are similar formulas for the inverse of a general n n matrix, but its usually more efficient to use Gauss-Jordan elimination. Exercise 3 1. Use Gauss-Jordan elimination to calculate the inverses of the following matrices (if possible). (a) [ (b) [ (c) (d)

26 23 2. Find the values of u for which is invertible. A = [ u 2 1 u 1

27 Appendix A Simultaneous Equations in Two Unknowns A pair of linear quations in two unknowns is usually solved by (i) eliminating one of the unknowns from an equation, then (ii) solving for the other unknown. substitution method Solve the simultaneous equations 2x + y = 7... (1) x y = 2... (2) Answer. Equation (2) shows that x = 2 + y... (3)... we can use this to eliminate x from equation (1). Substitute x = 2 + y into (1): 2x + y = 7 2(2 + y) + y = y + y = 7 3y = 3 y = 1 To find x, substitute y = 1 into equation (3): x = 2 + y = = 3 24

28 A second method for solving pairs of equations is to combine the left and right sides of the equations. 25 elimination method Solve the simultaneous equations 2x + y = 7... (1) x y = 2... (2) Answer. The unknown y can be eliminated by adding the left and right sides of the equations together. 2x + y = 7... (1) x y = 2... (2) (1) + (2) (2x + y) + (x y) = x = 9 x = 3 To find y, we can substitute x = 3 into equation (1). 2x + y = y = 7 y = 1 Alternatively, we could have eliminated the unknown x first by subtracting twice equation (2) from equation (1). 2x + y = 7... (1) x y = 2... (2) (1) 2 (2) (2x + y) 2 (x y) = y = 3 y = 1... and then find x by substituting y = 1 into equation (2). x y = 2 x 1 = 2 x = 3 These methods are not very efficient for solving larger systems of equations.

29 Appendix B Answers Exercise (a) p 2q = 8 2p + 5q = 1 1(b) (a) The elementary row operations are i, ii, iii, iv and v. [ [ (b) i. = [ [ iii. = [ [ v. = (43, 9, 4) ii. [ [ = [ [ iv. = (a) (3, 1) 5(b) ( 3, 4) 5(c) (2, 4, 1) 5(d) ( 1, 1, 3) 2 Exercise 1.3 1(i) row-echelon: a, g 1(ii) row-reduced: c, d, f 1(iii) neither: b, e, h, i 2(a) 1 [ (b) [ (c) Only the reduced row echelon form answer is given as it is unique. 26

30 27 3(a) ( 4, 3) 3(b) (1, 1, 1) 4(a) ( 3, 3) 4(b) (1, 1, 1) Exercise The three lines all pass through the point (2, 1). 2. a = 1, b = 3 Exercise 2.2 1(a) {( t 4, t, 3) t R} 1(b) no solution 1(c) (9, 4, 0) 1(d) {(18s 7, 4s + 3, s) s R} 2(a) {( 2r + 4, r 3, r) r R} 2(b) (4, 3, 0) 3 k = 4, {(t, t + 2, t) t R} 4. The plane 5x + 6y 20z = u is parallel to the line of intersection of the other two planes when u 6, and meets the other two planes in this line when u = b 1 + b 2 b 3 = 0 6(c) The system has infinitely many solutions when k = 0. The parametric form of the solutions is (2 2t, t, t), t R. The three planes intersect in a straight line 2 2 and the solutions correspond to the points on this line. 6(d) The system has no solutions if k = 2. 6(e) The system has a unique solution when k 0 and k 2. Exercise 3 [ 3/2 2 1(a) 1/2 1 [ (b) not invertible (c) not invertible

31 28 APPENDIX B. ANSWERS 1(d) A is invertible if and only if det A = u(u 1) 2 = u 2 u 2 0, i.e. if and only if u 1, 2.

### Chapter 4: Systems of Equations and Ineq. Lecture notes Math 1010

Section 4.1: Systems of Equations Systems of equations A system of equations consists of two or more equations involving two or more variables { ax + by = c dx + ey = f A solution of such a system is an

### Systems of Linear Equations

A FIRST COURSE IN LINEAR ALGEBRA An Open Text by Ken Kuttler Systems of Linear Equations Lecture Notes by Karen Seyffarth Adapted by LYRYX SERVICE COURSE SOLUTION Attribution-NonCommercial-ShareAlike (CC

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### Solving Systems of Linear Equations; Row Reduction

Harvey Mudd College Math Tutorial: Solving Systems of Linear Equations; Row Reduction Systems of linear equations arise in all sorts of applications in many different fields of study The method reviewed

### 2.5 Gaussian Elimination

page 150 150 CHAPTER 2 Matrices and Systems of Linear Equations 37 10 the linear algebra package of Maple, the three elementary 20 23 1 row operations are 12 1 swaprow(a,i,j): permute rows i and j 3 3

### December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

### Section 8.2 Solving a System of Equations Using Matrices (Guassian Elimination)

Section 8. Solving a System of Equations Using Matrices (Guassian Elimination) x + y + z = x y + 4z = x 4y + z = System of Equations x 4 y = 4 z A System in matrix form x A x = b b 4 4 Augmented Matrix

### 1 Gaussian Elimination

Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 Gauss-Jordan reduction and the Reduced

### 5.1. Systems of Linear Equations. Linear Systems Substitution Method Elimination Method Special Systems

5.1 Systems of Linear Equations Linear Systems Substitution Method Elimination Method Special Systems 5.1-1 Linear Systems The possible graphs of a linear system in two unknowns are as follows. 1. The

### MAT Solving Linear Systems Using Matrices and Row Operations

MAT 171 8.5 Solving Linear Systems Using Matrices and Row Operations A. Introduction to Matrices Identifying the Size and Entries of a Matrix B. The Augmented Matrix of a System of Equations Forming Augmented

### 4 Solving Systems of Equations by Reducing Matrices

Math 15 Sec S0601/S060 4 Solving Systems of Equations by Reducing Matrices 4.1 Introduction One of the main applications of matrix methods is the solution of systems of linear equations. Consider for example

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### Solving Systems of Linear Equations Using Matrices

Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.

### ( % . This matrix consists of \$ 4 5 " 5' the coefficients of the variables as they appear in the original system. The augmented 3 " 2 2 # 2 " 3 4&

Matrices define matrix We will use matrices to help us solve systems of equations. A matrix is a rectangular array of numbers enclosed in parentheses or brackets. In linear algebra, matrices are important

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### MATH 2030: SYSTEMS OF LINEAR EQUATIONS. ax + by + cz = d. )z = e. while these equations are not linear: xy z = 2, x x = 0,

MATH 23: SYSTEMS OF LINEAR EQUATIONS Systems of Linear Equations In the plane R 2 the general form of the equation of a line is ax + by = c and that the general equation of a plane in R 3 will be we call

### Systems of Linear Equations

Chapter 1 Systems of Linear Equations 1.1 Intro. to systems of linear equations Homework: [Textbook, Ex. 13, 15, 41, 47, 49, 51, 65, 73; page 11-]. Main points in this section: 1. Definition of Linear

### 1.2 Solving a System of Linear Equations

1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### Section 6.2 Larger Systems of Linear Equations

Section 6.2 Larger Systems of Linear Equations EXAMPLE: Solve the system of linear equations. Solution: From Equation 3, you know the value z. To solve for y, substitute z = 2 into Equation 2 to obtain

### Chapter 2. Linear Equations

Chapter 2. Linear Equations We ll start our study of linear algebra with linear equations. Lots of parts of mathematics arose first out of trying to understand the solutions of different types of equations.

### MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted

### Linear Systems and Gaussian Elimination

Eivind Eriksen Linear Systems and Gaussian Elimination September 2, 2011 BI Norwegian Business School Contents 1 Linear Systems................................................ 1 1.1 Linear Equations...........................................

### Solutions to Linear Algebra Practice Problems 1. form (because the leading 1 in the third row is not to the right of the

Solutions to Linear Algebra Practice Problems. Determine which of the following augmented matrices are in row echelon from, row reduced echelon form or neither. Also determine which variables are free

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### 8.3. Gauss elimination. Introduction. Prerequisites. Learning Outcomes

Gauss elimination 8.3 Introduction Engineers often need to solve large systems of linear equations; for example in determining the forces in a large framework or finding currents in a complicated electrical

### Situation 23: Simultaneous Equations Prepared at the University of Georgia EMAT 6500 class Date last revised: July 22 nd, 2013 Nicolina Scarpelli

Situation 23: Simultaneous Equations Prepared at the University of Georgia EMAT 6500 class Date last revised: July 22 nd, 2013 Nicolina Scarpelli Prompt: A mentor teacher and student teacher are discussing

### e-issn: p-issn: X Page 67

International Journal of Computer & Communication Engineering Research (IJCCER) Volume 2 - Issue 2 March 2014 Performance Comparison of Gauss and Gauss-Jordan Yadanar Mon 1, Lai Lai Win Kyi 2 1,2 Information

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### Chapter 4 - Systems of Equations and Inequalities

Math 233 - Spring 2009 Chapter 4 - Systems of Equations and Inequalities 4.1 Solving Systems of equations in Two Variables Definition 1. A system of linear equations is two or more linear equations to

### 2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system

1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables

### Systems of Linear Equations

Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

### 2. Perform elementary row operations to get zeros below the diagonal.

Gaussian Elimination We list the basic steps of Gaussian Elimination, a method to solve a system of linear equations. Except for certain special cases, Gaussian Elimination is still state of the art. After

### SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections

### 5.5. Solving linear systems by the elimination method

55 Solving linear systems by the elimination method Equivalent systems The major technique of solving systems of equations is changing the original problem into another one which is of an easier to solve

### 8.3. Solution by Gauss Elimination. Introduction. Prerequisites. Learning Outcomes

Solution by Gauss Elimination 8.3 Introduction Engineers often need to solve large systems of linear equations; for example in determining the forces in a large framework or finding currents in a complicated

### Linear Equations in Linear Algebra

1 Linear Equations in Linear Algebra 1.2 Row Reduction and Echelon Forms ECHELON FORM A rectangular matrix is in echelon form (or row echelon form) if it has the following three properties: 1. All nonzero

### Images and Kernels in Linear Algebra By Kristi Hoshibata Mathematics 232

Images and Kernels in Linear Algebra By Kristi Hoshibata Mathematics 232 In mathematics, there are many different fields of study, including calculus, geometry, algebra and others. Mathematics has been

### 3.4. Solving Simultaneous Linear Equations. Introduction. Prerequisites. Learning Outcomes

Solving Simultaneous Linear Equations 3.4 Introduction Equations often arise in which there is more than one unknown quantity. When this is the case there will usually be more than one equation involved.

### Math 240: Linear Systems and Rank of a Matrix

Math 240: Linear Systems and Rank of a Matrix Ryan Blair University of Pennsylvania Thursday January 20, 2011 Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011

### Math 018 Review Sheet v.3

Math 018 Review Sheet v.3 Tyrone Crisp Spring 007 1.1 - Slopes and Equations of Lines Slopes: Find slopes of lines using the slope formula m y y 1 x x 1. Positive slope the line slopes up to the right.

### Arithmetic and Algebra of Matrices

Arithmetic and Algebra of Matrices Math 572: Algebra for Middle School Teachers The University of Montana 1 The Real Numbers 2 Classroom Connection: Systems of Linear Equations 3 Rational Numbers 4 Irrational

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### Row Echelon Form and Reduced Row Echelon Form

These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

### Ordered Pairs. Graphing Lines and Linear Inequalities, Solving System of Linear Equations. Cartesian Coordinates System.

Ordered Pairs Graphing Lines and Linear Inequalities, Solving System of Linear Equations Peter Lo All equations in two variables, such as y = mx + c, is satisfied only if we find a value of x and a value

### Jones and Bartlett Publishers, LLC. NOT FOR SALE OR DISTRIBUTION

8498_CH08_WilliamsA.qxd 11/13/09 10:35 AM Page 347 Jones and Bartlett Publishers, LLC. NOT FOR SALE OR DISTRIBUTION C H A P T E R Numerical Methods 8 I n this chapter we look at numerical techniques for

### Solving Linear Systems, Continued and The Inverse of a Matrix

, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

### SECTION 8.3: THE INVERSE OF A SQUARE MATRIX

(Section 8.3: The Inverse of a Square Matrix) 8.47 SECTION 8.3: THE INVERSE OF A SQUARE MATRIX PART A: (REVIEW) THE INVERSE OF A REAL NUMBER If a is a nonzero real number, then aa 1 = a 1 a = 1. a 1, or

### Using row reduction to calculate the inverse and the determinant of a square matrix

Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible

### Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M 1 such that

0. Inverse Matrix Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M such that M M = I = M M. Inverse of a 2 2 Matrix Let M and N be the matrices: a b d b M =, N = c

### Chapter 1 - Matrices & Determinants

Chapter 1 - Matrices & Determinants Arthur Cayley (August 16, 1821 - January 26, 1895) was a British Mathematician and Founder of the Modern British School of Pure Mathematics. As a child, Cayley enjoyed

### The Inverse of a Matrix

The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a ( 0) has a reciprocal b written as a or such that a ba = ab =. Some, but not all, square matrices have inverses. If a square

### Topic 1: Matrices and Systems of Linear Equations.

Topic 1: Matrices and Systems of Linear Equations Let us start with a review of some linear algebra concepts we have already learned, such as matrices, determinants, etc Also, we shall review the method

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### Lecture 23: The Inverse of a Matrix

Lecture 23: The Inverse of a Matrix Winfried Just, Ohio University March 9, 2016 The definition of the matrix inverse Let A be an n n square matrix. The inverse of A is an n n matrix A 1 such that A 1

### Solving a System of Equations

11 Solving a System of Equations 11-1 Introduction The previous chapter has shown how to solve an algebraic equation with one variable. However, sometimes there is more than one unknown that must be determined

### A general system of m equations in n unknowns. a 11 x 1 + a 12 x a 1n x n = a 21 x 1 + a 22 x a 2n x n =

A general system of m equations in n unknowns MathsTrack (NOTE Feb 2013: This is the old version of MathsTrack. New books will be created during 2013 and 2014) a 11 x 1 + a 12 x 2 + + a 1n x n a 21 x 1

### 1.5 Elementary Matrices and a Method for Finding the Inverse

.5 Elementary Matrices and a Method for Finding the Inverse Definition A n n matrix is called an elementary matrix if it can be obtained from I n by performing a single elementary row operation Reminder:

### Reduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:

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. 2. Each leading entry (i.e. left most nonzero entry) of a row is in

### 3.4. Solving simultaneous linear equations. Introduction. Prerequisites. Learning Outcomes

Solving simultaneous linear equations 3.4 Introduction Equations often arise in which there is more than one unknown quantity. When this is the case there will usually be more than one equation involved.

### Lecture 1: Systems of Linear Equations

MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables

### Matrix Algebra LECTURE 1. Simultaneous Equations Consider a system of m linear equations in n unknowns: y 1 = a 11 x 1 + a 12 x 2 + +a 1n x n,

LECTURE 1 Matrix Algebra Simultaneous Equations Consider a system of m linear equations in n unknowns: y 1 a 11 x 1 + a 12 x 2 + +a 1n x n, (1) y 2 a 21 x 1 + a 22 x 2 + +a 2n x n, y m a m1 x 1 +a m2 x

### Definition: Group A group is a set G together with a binary operation on G, satisfying the following axioms: a (b c) = (a b) c.

Algebraic Structures Abstract algebra is the study of algebraic structures. Such a structure consists of a set together with one or more binary operations, which are required to satisfy certain axioms.

### Question 2: How do you solve a matrix equation using the matrix inverse?

Question : How do you solve a matrix equation using the matrix inverse? In the previous question, we wrote systems of equations as a matrix equation AX B. In this format, the matrix A contains the coefficients

### Row Operations and Inverse Matrices on the TI-83

Row Operations and Inverse Matrices on the TI-83 I. Elementary Row Operations 2 8 A. Let A =. 2 7 B. To interchange rows and 2 of matrix A: MATRIX MATH C:rowSwap( MATRIX NAMES :[A],, 2 ) ENTER. 2 7 The

### (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.

Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product

### Cofactor Expansion: Cramer s Rule

Cofactor Expansion: Cramer s Rule MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Today we will focus on developing: an efficient method for calculating

### 10.1 Systems of Linear Equations: Substitution and Elimination

726 CHAPTER 10 Systems of Equations and Inequalities 10.1 Systems of Linear Equations: Sustitution and Elimination PREPARING FOR THIS SECTION Before getting started, review the following: Linear Equations

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### Advanced Higher Mathematics Course Assessment Specification (C747 77)

Advanced Higher Mathematics Course Assessment Specification (C747 77) Valid from August 2015 This edition: April 2016, version 2.4 This specification may be reproduced in whole or in part for educational

### Lecture 21: The Inverse of a Matrix

Lecture 21: The Inverse of a Matrix Winfried Just, Ohio University October 16, 2015 Review: Our chemical reaction system Recall our chemical reaction system A + 2B 2C A + B D A + 2C 2D B + D 2C If we write

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

### MATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3

MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright 009 07 by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations........................

### Further Maths Matrix Summary

Further Maths Matrix Summary A matrix is a rectangular array of numbers arranged in rows and columns. The numbers in a matrix are called the elements of the matrix. The order of a matrix is the number

### APPLICATIONS OF MATRICES. Adj A is nothing but the transpose of the co-factor matrix [A ij ] of A.

APPLICATIONS OF MATRICES ADJOINT: Let A = [a ij ] be a square matrix of order n. Let Aij be the co-factor of a ij. Then the n th order matrix [A ij ] T is called the adjoint of A. It is denoted by adj

### x y The matrix form, the vector form, and the augmented matrix form, respectively, for the system of equations are

Solving Sstems of Linear Equations in Matri Form with rref Learning Goals Determine the solution of a sstem of equations from the augmented matri Determine the reduced row echelon form of the augmented

### Chapter 8. Matrices II: inverses. 8.1 What is an inverse?

Chapter 8 Matrices II: inverses We have learnt how to add subtract and multiply matrices but we have not defined division. The reason is that in general it cannot always be defined. In this chapter, we

### Solving Systems of Linear Equations. Substitution

Solving Systems of Linear Equations There are two basic methods we will use to solve systems of linear equations: Substitution Elimination We will describe each for a system of two equations in two unknowns,

### Elementary Row Operations and Matrix Multiplication

Contents 1 Elementary Row Operations and Matrix Multiplication 1.1 Theorem (Row Operations using Matrix Multiplication) 2 Inverses of Elementary Row Operation Matrices 2.1 Theorem (Inverses of Elementary

### 1 Determinants. Definition 1

Determinants The determinant of a square matrix is a value in R assigned to the matrix, it characterizes matrices which are invertible (det 0) and is related to the volume of a parallelpiped described

### SECTION 8-1 Systems of Linear Equations and Augmented Matrices

86 8 Systems of Equations and Inequalities In this chapter we move from the standard methods of solving two linear equations with two variables to a method that can be used to solve linear systems with

### Math 54. Selected Solutions for Week Is u in the plane in R 3 spanned by the columns

Math 5. Selected Solutions for Week 2 Section. (Page 2). Let u = and A = 5 2 6. Is u in the plane in R spanned by the columns of A? (See the figure omitted].) Why or why not? First of all, the plane in

### Chapter 2: Systems of Linear Equations and Matrices:

At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,

### DETERMINANTS. b 2. x 2

DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in

### MAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =

MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the

### Numerical Methods for Civil Engineers. Linear Equations

Numerical Methods for Civil Engineers Lecture Notes CE 311K Daene C. McKinney Introduction to Computer Methods Department of Civil, Architectural and Environmental Engineering The University of Texas at

### 5 Homogeneous systems

5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m

### NUMERICAL METHODS C. Carl Gustav Jacob Jacobi 10.1 GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING

0. Gaussian Elimination with Partial Pivoting 0.2 Iterative Methods for Solving Linear Systems 0.3 Power Method for Approximating Eigenvalues 0.4 Applications of Numerical Methods Carl Gustav Jacob Jacobi

### 2.5 Elementary Row Operations and the Determinant

2.5 Elementary Row Operations and the Determinant Recall: Let A be a 2 2 matrtix : A = a b. The determinant of A, denoted by det(a) c d or A, is the number ad bc. So for example if A = 2 4, det(a) = 2(5)

### Solving Simultaneous Equations and Matrices

Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering

### 1 Determinants and the Solvability of Linear Systems

1 Determinants and the Solvability of Linear Systems In the last section we learned how to use Gaussian elimination to solve linear systems of n equations in n unknowns The section completely side-stepped

### Prerequisites: TSI Math Complete and high school Algebra II and geometry or MATH 0303.

Course Syllabus Math 1314 College Algebra Revision Date: 8-21-15 Catalog Description: In-depth study and applications of polynomial, rational, radical, exponential and logarithmic functions, and systems

### Systems of Equations There are 3 methods to solving a system of equations: Graphing Substitution Addition/Elimination Method

Systems of Equations There are 3 methods to solving a system of equations: Graphing Substitution Addition/Elimination Method Solving by Graphing: 1. Solve the first equation for y -> put it in the form

### 10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method

578 CHAPTER 1 NUMERICAL METHODS 1. ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS As a numerical technique, Gaussian elimination is rather unusual because it is direct. That is, a solution is obtained after

### Solution of Linear Systems

Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start

### B such that AB = I and BA = I. (We say B is an inverse of A.) Definition A square matrix A is invertible (or nonsingular) if matrix

Matrix inverses Recall... Definition A square matrix A is invertible (or nonsingular) if matrix B such that AB = and BA =. (We say B is an inverse of A.) Remark Not all square matrices are invertible.

### MATH10212 Linear Algebra B Homework 7

MATH22 Linear Algebra B Homework 7 Students are strongly advised to acquire a copy of the Textbook: D C Lay, Linear Algebra and its Applications Pearson, 26 (or other editions) Normally, homework assignments

### Basic Terminology for Systems of Equations in a Nutshell. E. L. Lady. 3x 1 7x 2 +4x 3 =0 5x 1 +8x 2 12x 3 =0.

Basic Terminology for Systems of Equations in a Nutshell E L Lady A system of linear equations is something like the following: x 7x +4x =0 5x +8x x = Note that the number of equations is not required