Lectures on Linear Algebra for IT
|
|
- Anissa Wade
- 5 years ago
- Views:
Transcription
1 Lectures on Linear Algebra for IT by Mgr. Tereza Kovářová, Ph.D. following content of lectures by Ing. Petr Beremlijski, Ph.D. Department of Applied Mathematics, VSB - TU Ostrava Czech Republic
2 2. Systems o Linear Equations 1. Systems of Linear Equations 2. Matrix Notation 3. Elementary Row Operations 4. Echelon Forms 5. Pivots 6. Solutions of Linear System 7. Gaussian Elimination 8. Gauss-Jordan Elimination 9. Numerical Notes
3 2.1 System of Linear Equations Definition 1 A system of m linear equations with n variables x 1,..., x n is a set of equations of the form: a 11 x a 1n x n = b 1.. =. (S) a m1 x a mn x n = b m where a ij for i = 1,..., m, j = 1,..., n are coefficients and b i for i = 1,..., m are right sides of the system (S).
4 2.1 System of Linear Equations Example 1 System of linear equations from the Application III. 2u 1 u 2 = u 1 +2u 2 u 3 = u 2 +2u 3 u 4 = u 3 +2u 4 u 5 = u 4 +2u 5 = The system has 5 equations with 5 variables u 1,..., u 5...
5 2.1 System of Linear Equations A solution of the system is a list (s 1,..., s n ) of numbers that makes each equation a true statement when substituted for variables x 1,..., x n respectively. The set of all possible solutions is called the solution set of the linear system. Two linear systems are called equivalent if they have the same solution set. A system of linear equations has 1. no solution, or 2. exactly one solution, or 3. infinitely many solutions A linear system i said to be consistent if it has either one solution or infinitely many solutions. A system is inconsistent if it has no solution.
6 2.2 Matrix Notation The essential information of a linear system (S) can be recorded compactly in a rectangular array that is called the augmented matrix of the system. a a 1n b a m1... a mn b m. The matrix A and the vector b, a a 1n A =..... a m1... a mn, b = b 1. b m, are called the coefficient matrix and the right side of the system (S). If the vector of variables x 1,..., x n is denoted by x = [x 1,..., x n ] we can write the system as the matrix equation: Ax = b.
7 2.3 Elementary Row Operations Systematic procedure for solving linear system will be described next. The basic strategy is to replace one system with an equivalent system (i.e., one with the same solution set) that is easier to solve. Definition 2 By elementary row operations we understand the following basic operations on equations (rows) of the system: E1 (Interchange) Interchange two rows. E2 (Scaling) Multiply all entries in a row by a nonzero constant. E3 (Replacement) Replace one row by the sum of itself and a multiple of another row.
8 2.3 Elementary Row Operations Row operations can be applied to any matrix, not merely to one that corresponds to an augmented matrix of some linear system. Definition 3 Two matrices are called row equivalent if there is a sequence of elementary row operations that transforms one matrix into the other. Important is to mention that row operations are reversible. If two rows of the system (S) are interchanged, they can be returned to the original position by another interchange. If a row is scaled by a nonzero constant c, then multiplying the new row by 1/c produces the original row. If a row j is replaced by the sum of c-multiple of a row i with the row j, to reverse the operation, add c times the row i to a (new) row j and obtain the original row j.
9 Example Elementary Row Operations Elimination procedure with and without matrix notation: 2x 1 + x 2 = 0 [ x 1 3x 2 = ] r1 r 2 We keep x 1 in one of the equations and eliminate it from the other equation. To do so, interchange equation 1 with equation 2 (row operation E1) to obtain first equation with coefficient 1 for x 1. x 1 3x 2 = 10 2x 1 + x 2 = 0 [ ] r 2 + 2r 1 Now add 2 times equation 1 to equation 2 and write the result of this operation (row operation E3) in place of the second equation. [ ] x 1 3x 2 = x 2 = r 2 To simplify the system even more we can scale the second equation by the constant 1 (row operation E2). 5 [ ] x 1 3x 2 = x 2 = From the second equation x 2 = 4. After substituting for x 2 into the first equation we obtain x 1 = 2.
10 2.3 Elementary Row Operations Theorem 1 If the augmented matrices of two linear systems are row equivalent, then the two systems are equivalent (have the same solution set). Warning! If we apply an operation on a matrix that is not transformed properly, we can generate errors. For instance the following way of performing row operations does not produce equivalent system r 3 r r To avoid such mistakes when performing replacement operations, we select one row to be unchanged and add its multiples to another rows as convenient. In the next example row operations already yield the system that is equivalent r 1 2r r
11 2.3 Elementary Row Operations We will use the row operations on augmented matrix to determine the answer to the following two questions: Is the system consistent? (Does at least one solution exist?) If a solution exists, is it the only one? (Is the solution unique?)
12 2.4 Echelon Forms Definition 4 A matrix is in echelon form (or row echelon form) if: 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (the leftmost nonzero entry) of a nonzero row is strictly to the right of a leading entry of the row above it. These two conditions imply, that all entries in a column below a leading entry are zeros. A matrix in an echelon form is in the reduced row echelon form (or row canonical form) if: 3. The leading entry in each nonzero row is 1 and it is the only nonzero entry in it s column. Example 3 row echelon form 1 4 1/ /5 reduced row echelon form
13 Example Echelon Forms Given matrices are in echelon form. The leading entries ( ) have any nonzero value. The starred entries (*) may have any value (including zero) The next matrices are corresponding matrices in reduced echelon form Theorem 2 Any nonzero matrix can be row reduced (transformed by elementary row operations) into more than one matrix in echelon form. Uniqueness of the Reduced Echelon Form Each matrix is row equivalent to one and only one reduced echelon matrix.
14 2.5 Pivots Definition 5 A pivot position in a matrix A is a location in A that corresponds to a leading 1 in the reduced echelon form of A. A pivot column is a column of A that contains a pivot position. A pivot is a nonzero entry in a pivot position that is used as needed to create zeros via row operations. Example / /5
15 2.5 Pivots Definition 6 A pivot position in a matrix A is a location in A that corresponds to a leading 1 in the reduced echelon form of A. A pivot column is a column of A that contains a pivot position. A pivot is a nonzero entry in a pivot position that is used as needed to create zeros via row operations. Example / /5 }{{} pivot columns Pivots at pivot positions are displayed in red. Many fundamental concepts of basic LA can be connected with pivot positions in a matrix.
16 Example Pivots Location of pivot columns and pivot positions of A r r A = 5 2 r r r 1 +2r 1 r3 r 4 The left matrix is an echelon form of A, thus reveals all the pivots (in red) and pivot columns. Below are displayed the pivot positions (in blue) and pivot columns in A
17 2.6 Solutions of Linear System Theorem 3 A linear system is inconsistent if and only if the right most column of the augmented matrix is a pivot column - that is, if and only if an echelon form of the augmented matrix has a row of the form [ b ] with b nonzero. Example 8 (System with No Solution) An augmented matrix of a system was row reduced to the following echelon form: This matrix corresponds to the equivalent reduced system: x 1 + 2x 2 x 3 = 1 x 2 x 3 = 2 0 = 3 The last equation 0 = 3 can not be satisfied for any choice of numbers for x 1, x 2, x 3. The system has no solution (is inconsistent).
18 2.6 Solutions of Linear System Example 9 (System with Unique Solution) An augmented matrix of a system was row reduced to the following echelon form: The echelon form of an augmented matrix corresponds to the system: x 1 +2x 2 x 3 = 1 x 2 x 3 = 2 x 3 = 3 x 1 +2x 2 ( 3) = 1 x 2 ( 3) = 2 x 1 +2x 2 = 2 x 2 = 1 x 1 + 2( 1) = 2 x 1 = 0 The system has unique solution x 1 = 0, x 2 = 1, x 3 = 3. Notice: All the columns of the coefficient matrix are the pivot columns. This fact together with the consistency of the system implies that the solution is unique.
19 2.6 Solutions of Linear System Example 10 (System with Infinitely Many Solutions) An augmented matrix of a system was row reduced to the following echelon form: The echelon form of an augmented matrix corresponds to the system: x 1 +x 2 x 3 +x 4 = 1 x 3 x 4 = 2 x 1 = 1 x 2 + x 3 x 4 x 0 = 0 3 = 2 + x 4 x 1 = 1 x 2 + (2 + x 4 ) x 4 = 3 x 2 The system has infinitely many solutions x 1 = 3 x 2, x 3 = 2 + x 4, we may choose x 2, x 4 arbitrarily. The variables x 1 and x 3 corresponding to pivot columns are called basic variables. The other variables x 2, x 4 are called free variables. The system has infinitely many solutions if it is consistent and when there is at least one free variable.
20 2.7 Gaussian Elimination Gaussian Elimination (row reduction algorithm) 1. Forward Phase (Row reduction of augmented matrix into an echelon form.) 2. Back Substitution Example 11 (Inconsistent Linear System ) Solve the next linear system: 2x 1 + x 2 = 2 x 1 + 2x 2 x 3 = 1 4x 1 + 5x 2 2x 3 = 1 By a sequence of elementary row operations we obtain: r 1 2r r The last equation 0x 1 + 0x 2 + 0x 3 = 5 has no solution for any choice of numbers for variables x 1, x 2, x 3. Therefore the system is inconsistent.
21 2.7 Gaussian Elimination Example 12 (Consistent Linear System with Unique Solution) Solve the linear system: 2x 2 + 3x 3 = 2 x 2 + x 3 = 0 x 1 + x 3 = 4 By a sequence of elementary row operations we obtain: r 3 r r Last column of the augmented matrix is not a pivot column and so the system is consistent. Each column of the coefficient matrix is a pivot column (there are no free variables) and so the system has a unique solution. By back substitution we obtain the only solution: x 3 = 2 x 2 = x 3 = 2 x 1 = 4 x 3 = 2
22 2.7 Gaussian Elimination Example 13 (Consistent System with Infinitely Many Solutions) Solve the linear system: x 1 + x 2 + x 3 = 1 x 1 x 3 = 1 x 2 + 2x 3 = 0 By a sequaence of elementary row operations we obtain: r r Last column of the augmented matrix is not a pivot column and so the system is consistent. Only two from three columns of the coefficient matrix are pivot columns. Therefore there is one free variable and so the system has infinitely many solutions. The free variable corresponds to the no pivot column which is x 3. We can choose any value for x 3 and so we set x 3 = t, where t R is a parameter. Further we proceed by back substitution to obtain all the solutions.
23 Example 13 (continuation) 2.7 Gaussian Elimination The linear system corresponding to the echelon form of the augmented matrix of the original system is: x 1 + x 2 + x 3 = 1 (1) x 2 2x 3 = 0 (2) 0 = 0 (3) From the equation (2) we express x 2 in terms of x 3, it is x 2 = 2x 3. Then after substituing x 2 into equation (1) we obtain x 1 = 1 + x 3. The free variable x 3 acts as a parameter. We can set x 3 = t and write all the solutions as: x 1 = 1 + t x 2 = 2t x 3 = t Note: Whenever a system is consistent and has free variables, the solution set has many parametric descriptions. For inst. in previous system we could treat x 2 as a parameter and set x 2 = p. Then we obtain x 3 = 1 2 p, x 1 = 1 p + 1, which is 2 different parametric description of the same solution set.
24 Gauss Jordan Elimination 2.8 Gauss Jordan Elimination 1. Forward Phase (Row reduction of augmented matrix into an echelon form.) 2. Backward Phase (Row reduction of augmented matrix into reduced echelon form (canonical)) (a) scaling rows by reciprocal of leading entries (pivots become 1 s) (b) working upward to the left, creating zeros in columns above each pivot via elementary row operations Example 14 For instance we can continue with the Backward Phase from the echelon form of the augmented matrix from Example 12: r 3 r Solution of the system is in the last column. Corresponding equations are x 1 = 2, x 2 = 2 and x 3 = 2.
25 2.9 Numerical Notes Gaussian elimination is effective when solving small linear systems by hand, but also for computer programs solving systems of hundreds up to thousands of equations. The method is very effective also for solving systems of greater number of equations that have some special structure of nonzero elements. For linear systems with greater number of equations exist more effective methods which are developed currently. Gaussian elimination is not suitable for parallel computer implementation. Efficiency of an algorithm based on Gaussian Elimination (m = n): (It is usually measured in flops floating point operations) 1. Forward phase can take 1 6 (2n + 1)(n + 1)n multiplications, which is approximately 1 3 n3 for n moderately large say n Backward phase (or back substitution) can take 1 2 n(n 1) multiplications, it is approximately 1 2 n2 for n large.
Lectures on Linear Algebra for IT
Lectures on Linear Algebra for IT by Mgr Tereza Kovářová, PhD following content of lectures by Ing Petr Beremlijski, PhD Department of Applied Mathematics, VSB - TU Ostrava Czech Republic 3 Inverse Matrix
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.1 SYSTEMS OF LINEAR EQUATIONS LINEAR EQUATION x 1,, x n A linear equation in the variables equation that can be written in the form a 1 x 1 + a 2 x 2 + + a n x n
More informationLectures on Linear Algebra for IT
Lectures on Linear Algebra for IT by Mgr. Tereza Kovářová, Ph.D. following content of lectures by Ing. Petr Beremlijski, Ph.D. Department of Applied Mathematics, VSB - TU Ostrava Czech Republic 5. Linear
More information1 - Systems of Linear Equations
1 - Systems of Linear Equations 1.1 Introduction to Systems of Linear Equations Almost every problem in linear algebra will involve solving a system of equations. ü LINEAR EQUATIONS IN n VARIABLES We are
More informationSection Gaussian Elimination
Section. - Gaussian Elimination A matrix is said to be in row echelon form (REF) if it has the following properties:. The first nonzero entry in any row is a. We call this a leading one or pivot one..
More informationLinear Algebra I Lecture 8
Linear Algebra I Lecture 8 Xi Chen 1 1 University of Alberta January 25, 2019 Outline 1 2 Gauss-Jordan Elimination Given a system of linear equations f 1 (x 1, x 2,..., x n ) = 0 f 2 (x 1, x 2,..., x n
More informationMethods for Solving Linear Systems Part 2
Methods for Solving Linear Systems Part 2 We have studied the properties of matrices and found out that there are more ways that we can solve Linear Systems. In Section 7.3, we learned that we can use
More informationMath 1314 Week #14 Notes
Math 3 Week # Notes Section 5.: A system of equations consists of two or more equations. A solution to a system of equations is a point that satisfies all the equations in the system. In this chapter,
More informationLinear equations in linear algebra
Linear equations in linear algebra Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra Pearson Collections Samy T. Linear
More informationMAC1105-College Algebra. Chapter 5-Systems of Equations & Matrices
MAC05-College Algebra Chapter 5-Systems of Equations & Matrices 5. Systems of Equations in Two Variables Solving Systems of Two Linear Equations/ Two-Variable Linear Equations A system of equations is
More informationLecture 12: Solving Systems of Linear Equations by Gaussian Elimination
Lecture 12: Solving Systems of Linear Equations by Gaussian Elimination Winfried Just, Ohio University September 22, 2017 Review: The coefficient matrix Consider a system of m linear equations in n variables.
More informationSection 1.1: Systems of Linear Equations
Section 1.1: Systems of Linear Equations Two Linear Equations in Two Unknowns Recall that the equation of a line in 2D can be written in standard form: a 1 x 1 + a 2 x 2 = b. Definition. A 2 2 system of
More informationMath "Matrix Approach to Solving Systems" Bibiana Lopez. November Crafton Hills College. (CHC) 6.3 November / 25
Math 102 6.3 "Matrix Approach to Solving Systems" Bibiana Lopez Crafton Hills College November 2010 (CHC) 6.3 November 2010 1 / 25 Objectives: * Define a matrix and determine its order. * Write the augmented
More informationSystem of Linear Equations
Chapter 7 - S&B Gaussian and Gauss-Jordan Elimination We will study systems of linear equations by describing techniques for solving such systems. The preferred solution technique- Gaussian elimination-
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.1 SYSTEMS OF LINEAR EQUATIONS LINEAR EQUATION,, 1 n A linear equation in the variables equation that can be written in the form a a a b 1 1 2 2 n n a a is an where
More informationMatrices and systems of linear equations
Matrices and systems of linear equations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T.
More informationNotes on Row Reduction
Notes on Row Reduction Francis J. Narcowich Department of Mathematics Texas A&M University September The Row-Reduction Algorithm The row-reduced form of a matrix contains a great deal of information, both
More informationRow Reduction and Echelon Forms
Row Reduction and Echelon Forms 1 / 29 Key Concepts row echelon form, reduced row echelon form pivot position, pivot, pivot column basic variable, free variable general solution, parametric solution existence
More informationMarch 19 - Solving Linear Systems
March 19 - Solving Linear Systems Welcome to linear algebra! Linear algebra is the study of vectors, vector spaces, and maps between vector spaces. It has applications across data analysis, computer graphics,
More informationSolving Linear Systems Using Gaussian Elimination
Solving Linear Systems Using Gaussian Elimination DEFINITION: A linear equation in the variables x 1,..., x n is an equation that can be written in the form a 1 x 1 +...+a n x n = b, where a 1,...,a n
More information1 Last time: linear systems and row operations
1 Last time: linear systems and row operations Here s what we did last time: a system of linear equations or linear system is a list of equations a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22
More informationMidterm 1 Review. Written by Victoria Kala SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015
Midterm 1 Review Written by Victoria Kala vtkala@math.ucsb.edu SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015 Summary This Midterm Review contains notes on sections 1.1 1.5 and 1.7 in your
More informationLinear Algebra I Lecture 10
Linear Algebra I Lecture 10 Xi Chen 1 1 University of Alberta January 30, 2019 Outline 1 Gauss-Jordan Algorithm ] Let A = [a ij m n be an m n matrix. To reduce A to a reduced row echelon form using elementary
More information4 Elementary matrices, continued
4 Elementary matrices, continued We have identified 3 types of row operations and their corresponding elementary matrices. To repeat the recipe: These matrices are constructed by performing the given row
More informationChapter 2. Systems of Equations and Augmented Matrices. Creighton University
Chapter Section - Systems of Equations and Augmented Matrices D.S. Malik Creighton University Systems of Linear Equations Common ways to solve a system of equations: Eliminationi Substitution Elimination
More informationChapter 3. Linear Equations. Josef Leydold Mathematical Methods WS 2018/19 3 Linear Equations 1 / 33
Chapter 3 Linear Equations Josef Leydold Mathematical Methods WS 2018/19 3 Linear Equations 1 / 33 Lineares Gleichungssystem System of m linear equations in n unknowns: a 11 x 1 + a 12 x 2 + + a 1n x n
More information3. Replace any row by the sum of that row and a constant multiple of any other row.
Section. Solution of Linear Systems by Gauss-Jordan Method A matrix is an ordered rectangular array of numbers, letters, symbols or algebraic expressions. A matrix with m rows and n columns has size or
More informationSection 6.2 Larger Systems of Linear Equations
Section 6.2 Larger Systems of Linear Equations Gaussian Elimination In general, to solve a system of linear equations using its augmented matrix, we use elementary row operations to arrive at a matrix
More informationGauss-Jordan Row Reduction and Reduced Row Echelon Form
Gauss-Jordan Row Reduction and Reduced Row Echelon Form If we put the augmented matrix of a linear system in reduced row-echelon form, then we don t need to back-substitute to solve the system. To put
More informationChapter 1. Vectors, Matrices, and Linear Spaces
1.4 Solving Systems of Linear Equations 1 Chapter 1. Vectors, Matrices, and Linear Spaces 1.4. Solving Systems of Linear Equations Note. We give an algorithm for solving a system of linear equations (called
More information1300 Linear Algebra and Vector Geometry Week 2: Jan , Gauss-Jordan, homogeneous matrices, intro matrix arithmetic
1300 Linear Algebra and Vector Geometry Week 2: Jan 14 18 1.2, 1.3... Gauss-Jordan, homogeneous matrices, intro matrix arithmetic R. Craigen Office: MH 523 Email: craigenr@umanitoba.ca Winter 2019 What
More informationLECTURES 4/5: SYSTEMS OF LINEAR EQUATIONS
LECTURES 4/5: SYSTEMS OF LINEAR EQUATIONS MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1 Linear equations We now switch gears to discuss the topic of solving linear equations, and more interestingly, systems
More information4 Elementary matrices, continued
4 Elementary matrices, continued We have identified 3 types of row operations and their corresponding elementary matrices. If you check the previous examples, you ll find that these matrices are constructed
More informationExercise Sketch these lines and find their intersection.
These are brief notes for the lecture on Friday August 21, 2009: they are not complete, but they are a guide to what I want to say today. They are not guaranteed to be correct. 1. Solving systems of linear
More informationSection 1.1 System of Linear Equations. Dr. Abdulla Eid. College of Science. MATHS 211: Linear Algebra
Section 1.1 System of Linear Equations College of Science MATHS 211: Linear Algebra (University of Bahrain) Linear System 1 / 33 Goals:. 1 Define system of linear equations and their solutions. 2 To represent
More informationChapter 1: Systems of Linear Equations
Chapter : Systems of Linear Equations February, 9 Systems of linear equations Linear systems Lecture 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
More informationChapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form
Chapter 5. Linear Algebra Sections 5.1 5.3 A linear (algebraic) 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 and b are
More informationLectures on Linear Algebra for IT
Lectures on Linear Algebra for IT by Mgr. Tereza Kovářová, Ph.D. following content of lectures by Ing. Petr Beremlijski, Ph.D. Department of Applied Mathematics, VSB - TU Ostrava Czech Republic 11. Determinants
More informationPre-Calculus I. For example, the system. x y 2 z. may be represented by the augmented matrix
Pre-Calculus I 8.1 Matrix Solutions to Linear Systems A matrix is a rectangular array of elements. o An array is a systematic arrangement of numbers or symbols in rows and columns. Matrices (the plural
More informationChapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form
Chapter 5. Linear Algebra A linear (algebraic) 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 and b are real numbers. 1
More information0.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.
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. 2. Each leading entry (i.e. left most nonzero entry) of a row
More informationDM559 Linear and Integer Programming. Lecture 2 Systems of Linear Equations. Marco Chiarandini
DM559 Linear and Integer Programming Lecture Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. Outline 1. 3 A Motivating Example You are organizing
More informationRelationships Between Planes
Relationships Between Planes Definition: consistent (system of equations) A system of equations is consistent if there exists one (or more than one) solution that satisfies the system. System 1: {, System
More informationCHAPTER 9: Systems of Equations and Matrices
MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 9: Systems of Equations and Matrices 9.1 Systems of Equations in Two Variables 9.2 Systems of Equations in Three Variables
More informationElementary matrices, continued. To summarize, we have identified 3 types of row operations and their corresponding
Elementary matrices, continued To summarize, we have identified 3 types of row operations and their corresponding elementary matrices. If you check the previous examples, you ll find that these matrices
More informationMatrices and RRE Form
Matrices and RRE Form Notation R is the real numbers, C is the complex numbers (we will only consider complex numbers towards the end of the course) is read as an element of For instance, x R means that
More informationLecture 7: Introduction to linear systems
Lecture 7: Introduction to linear systems Two pictures of linear systems Consider the following system of linear algebraic equations { x 2y =, 2x+y = 7. (.) Note that it is a linear system with two unknowns
More informationis a 3 4 matrix. It has 3 rows and 4 columns. The first row is the horizontal row [ ]
Matrices: Definition: An m n matrix, A m n is a rectangular array of numbers with m rows and n columns: a, a, a,n a, a, a,n A m,n =...... a m, a m, a m,n Each a i,j is the entry at the i th row, j th column.
More information5x 2 = 10. x 1 + 7(2) = 4. x 1 3x 2 = 4. 3x 1 + 9x 2 = 8
1 To solve the system x 1 + x 2 = 4 2x 1 9x 2 = 2 we find an (easier to solve) equivalent system as follows: Replace equation 2 with (2 times equation 1 + equation 2): x 1 + x 2 = 4 Solve equation 2 for
More informationChapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form
Chapter 5. Linear Algebra Sections 5.1 5.3 A linear (algebraic) 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 and b are
More informationLecture 2 Systems of Linear Equations and Matrices, Continued
Lecture 2 Systems of Linear Equations and Matrices, Continued Math 19620 Outline of Lecture Algorithm for putting a matrix in row reduced echelon form - i.e. Gauss-Jordan Elimination Number of Solutions
More information9.1 - Systems of Linear Equations: Two Variables
9.1 - Systems of Linear Equations: Two Variables Recall that a system of equations consists of two or more equations each with two or more variables. A solution to a system in two variables is an ordered
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
More informationElementary Linear Algebra
Elementary Linear Algebra Linear algebra is the study of; linear sets of equations and their transformation properties. Linear algebra allows the analysis of; rotations in space, least squares fitting,
More information1300 Linear Algebra and Vector Geometry
1300 Linear Algebra and Vector Geometry R. Craigen Office: MH 523 Email: craigenr@umanitoba.ca May-June 2017 Introduction: linear equations Read 1.1 (in the text that is!) Go to course, class webpages.
More informationSystem of Linear Equations
Math 20F Linear Algebra Lecture 2 1 System of Linear Equations Slide 1 Definition 1 Fix a set of numbers a ij, b i, where i = 1,, m and j = 1,, n A system of m linear equations in n variables x j, is given
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
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
More informationSolving 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.
More informationLecture Notes: Solving Linear Systems with Gauss Elimination
Lecture Notes: Solving Linear Systems with Gauss Elimination Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Echelon Form and Elementary
More informationM 340L CS Homework Set 1
M 340L CS Homework Set 1 Solve each system in Problems 1 6 by using elementary row operations on the equations or on the augmented matri. Follow the systematic elimination procedure described in Lay, Section
More informationMAC Module 1 Systems of Linear Equations and Matrices I
MAC 2103 Module 1 Systems of Linear Equations and Matrices I 1 Learning Objectives Upon completing this module, you should be able to: 1. Represent a system of linear equations as an augmented matrix.
More informationRow Reduced Echelon Form
Math 40 Row Reduced Echelon Form Solving systems of linear equations lies at the heart of linear algebra. In high school we learn to solve systems in or variables using elimination and substitution of
More informationMath 2331 Linear Algebra
1.2 Echelon Forms Math 2331 Linear Algebra 1.2 Row Reduction and Echelon Forms Shang-Huan Chiu Department of Mathematics, University of Houston schiu@math.uh.edu math.uh.edu/ schiu/ January 22, 2018 Shang-Huan
More informationTopics. Vectors (column matrices): Vector addition and scalar multiplication The matrix of a linear function y Ax The elements of a matrix A : A ij
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 or a ij lives in row i and column j Definition of a matrix
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 6 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 6 1 / 14 Gauss Jordan elimination Last time we discussed bringing matrices to reduced
More informationProblem Sheet 1 with Solutions GRA 6035 Mathematics
Problem Sheet 1 with Solutions GRA 6035 Mathematics BI Norwegian Business School 2 Problems 1. From linear system to augmented matrix Write down the coefficient matrix and the augmented matrix of the following
More informationDefinition of Equality of Matrices. Example 1: Equality of Matrices. Consider the four matrices
IT 131: Mathematics for Science Lecture Notes 3 Source: Larson, Edwards, Falvo (2009): Elementary Linear Algebra, Sixth Edition. Matrices 2.1 Operations with Matrices This section and the next introduce
More informationFundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Fundamentals of Linear Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 PREFACE Linear algebra has evolved as a branch of mathematics with wide range of applications to the natural
More informationChapter 4. Solving Systems of Equations. Chapter 4
Solving Systems of Equations 3 Scenarios for Solutions There are three general situations we may find ourselves in when attempting to solve systems of equations: 1 The system could have one unique solution.
More informationSolving 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
More informationMatrices and Systems of Equations
M CHAPTER 3 3 4 3 F 2 2 4 C 4 4 Matrices and Systems of Equations Probably the most important problem in mathematics is that of solving a system of linear equations. Well over 75 percent of all mathematical
More informationAlgebra & Trig. I. For example, the system. x y 2 z. may be represented by the augmented matrix
Algebra & Trig. I 8.1 Matrix Solutions to Linear Systems A matrix is a rectangular array of elements. o An array is a systematic arrangement of numbers or symbols in rows and columns. Matrices (the plural
More information1.4 Gaussian Elimination Gaussian elimination: an algorithm for finding a (actually the ) reduced row echelon form of a matrix. A row echelon form
1. Gaussian Elimination Gaussian elimination: an algorithm for finding a (actually the ) reduced row echelon form of a matrix. Original augmented matrix A row echelon form 1 1 0 0 0 1!!!! The reduced row
More informationLinear System Equations
King Saud University September 24, 2018 Table of contents 1 2 3 4 Definition A linear system of equations with m equations and n unknowns is defined as follows: a 1,1 x 1 + a 1,2 x 2 + + a 1,n x n = b
More informationMATH 3511 Lecture 1. Solving Linear Systems 1
MATH 3511 Lecture 1 Solving Linear Systems 1 Dmitriy Leykekhman Spring 2012 Goals Review of basic linear algebra Solution of simple linear systems Gaussian elimination D Leykekhman - MATH 3511 Introduction
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Michaelmas Term 2015 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Michaelmas Term 2015 1 / 15 From equations to matrices For example, if we consider
More informationReview of matrices. Let m, n IN. A rectangle of numbers written like A =
Review of matrices Let m, n IN. A rectangle of numbers written like a 11 a 12... a 1n a 21 a 22... a 2n A =...... a m1 a m2... a mn where each a ij IR is called a matrix with m rows and n columns or an
More informationCHAPTER 9: Systems of Equations and Matrices
MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 9: Systems of Equations and Matrices 9.1 Systems of Equations in Two Variables 9.2 Systems of Equations in Three Variables
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 5 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 5 1 / 12 Systems of linear equations Geometrically, we are quite used to the fact
More informationSOLVING Ax = b: GAUSS-JORDAN ELIMINATION [LARSON 1.2]
SOLVING Ax = b: GAUSS-JORDAN ELIMINATION [LARSON.2 EQUIVALENT LINEAR SYSTEMS: Two m n linear systems are equivalent both systems have the exact same solution sets. When solving a linear system Ax = b,
More informationSystems of Linear Equations. By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University
Systems of Linear Equations By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University Standard of Competency: Understanding the properties of systems of linear equations, matrices,
More informationExample: 2x y + 3z = 1 5y 6z = 0 x + 4z = 7. Definition: Elementary Row Operations. Example: Type I swap rows 1 and 3
Math 0 Row Reduced Echelon Form Techniques for solving systems of linear equations lie at the heart of linear algebra. In high school we learn to solve systems with or variables using elimination and substitution
More informationElimination Method Streamlined
Elimination Method Streamlined There is a more streamlined version of elimination method where we do not have to write all of the steps in such an elaborate way. We use matrices. The system of n equations
More informationEBG # 3 Using Gaussian Elimination (Echelon Form) Gaussian Elimination: 0s below the main diagonal
EBG # 3 Using Gaussian Elimination (Echelon Form) Gaussian Elimination: 0s below the main diagonal [ x y Augmented matrix: 1 1 17 4 2 48 (Replacement) Replace a row by the sum of itself and a multiple
More informationMatrix Solutions to Linear Equations
Matrix Solutions to Linear Equations Augmented matrices can be used as a simplified way of writing a system of linear equations. In an augmented matrix, a vertical line is placed inside the matrix to represent
More information2.1 Gaussian Elimination
2. Gaussian Elimination A common problem encountered in numerical models is the one in which there are n equations and n unknowns. The following is a description of the Gaussian elimination method for
More informationSystem of Linear Equations. Slide for MA1203 Business Mathematics II Week 1 & 2
System of Linear Equations Slide for MA1203 Business Mathematics II Week 1 & 2 Function A manufacturer would like to know how his company s profit is related to its production level. How does one quantity
More informationFinite 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.
Finite Mathematics Chapter 2 Section 2.1 Systems of Linear Equations: An Introduction Systems of Equations Recall that a system of two linear equations in two variables may be written in the general form
More informationGaussian Elimination -(3.1) b 1. b 2., b. b n
Gaussian Elimination -() Consider solving a given system of n linear equations in n unknowns: (*) a x a x a n x n b where a ij and b i are constants and x i are unknowns Let a n x a n x a nn x n a a a
More information5.7 Cramer's Rule 1. Using Determinants to Solve Systems Assumes the system of two equations in two unknowns
5.7 Cramer's Rule 1. Using Determinants to Solve Systems Assumes the system of two equations in two unknowns (1) possesses the solution and provided that.. The numerators and denominators are recognized
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University February 6, 2018 Linear Algebra (MTH
More informationSection 5.3 Systems of Linear Equations: Determinants
Section 5. Systems of Linear Equations: Determinants In this section, we will explore another technique for solving systems called Cramer's Rule. Cramer's rule can only be used if the number of equations
More informationNext topics: Solving systems of linear equations
Next topics: Solving systems of linear equations 1 Gaussian elimination (today) 2 Gaussian elimination with partial pivoting (Week 9) 3 The method of LU-decomposition (Week 10) 4 Iterative techniques:
More informationMATH 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:
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: x x = 3 1 2 2x + 4x = 12 1 2 Geometric meaning: Do these
More informationMath 3C Lecture 20. John Douglas Moore
Math 3C Lecture 20 John Douglas Moore May 18, 2009 TENTATIVE FORMULA I Midterm I: 20% Midterm II: 20% Homework: 10% Quizzes: 10% Final: 40% TENTATIVE FORMULA II Higher of two midterms: 30% Homework: 10%
More informationMatrix Algebra Lecture Notes. 1 What is Matrix Algebra? Last change: 18 July Linear forms
Matrix Algebra Lecture Notes Last change: 18 July 2017 1 What is Matrix Algebra? 1.1 Linear forms It is well-known that the total cost of a purchase of amounts (in kilograms) g 1, g 2, g 3 of some goods
More informationMath 2331 Linear Algebra
1.1 Linear System Math 2331 Linear Algebra 1.1 Systems of Linear Equations Shang-Huan Chiu Department of Mathematics, University of Houston schiu@math.uh.edu math.uh.edu/ schiu/ Shang-Huan Chiu, University
More informationPH1105 Lecture Notes on Linear Algebra.
PH05 Lecture Notes on Linear Algebra Joe Ó hógáin E-mail: johog@mathstcdie Main Text: Calculus for the Life Sciences by Bittenger, Brand and Quintanilla Other Text: Linear Algebra by Anton and Rorres Matrices
More informationLinear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
More information