Linear Algebra. Solving Linear Systems. Copyright 2005, W.R. Winfrey
|
|
- Corey Underwood
- 5 years ago
- Views:
Transcription
1 Copyright 2005, W.R. Winfrey
2 Topics Preliminaries Echelon Form of a Matrix Elementary Matrices; Finding A -1 Equivalent Matrices LU-Factorization
3 Topics Preliminaries Echelon Form of a Matrix Elementary Matrices; Finding A -1 Equivalent Matrices LU-Factorization
4 Preliminaries The primary goal is to deal with loose ends from the first set of lectures Develop systematic procedure for solving linear systems that works directly with the matrix form Establish conditions for a solution to a linear system to exist Establish conditions for a unique solution to a linear system Re-examine solutions to homogeneous systems Develop a systematic procedure for computing A 1 Discover equivalent conditions to nonsingularity Will also examine a special technique for solving linear systems: LU decomposition
5 Topics Preliminaries Echelon Form of a Matrix Elementary Matrices; Finding A -1 Equivalent Matrices LU-Factorization
6 Echelon Form of a Matrix Solve a system using elimination of variables x 1 x 2 2x 3-1 x 1 x 2 2x 3-1 x 1-2x 2 x x 2 - x 3-4 3x 1 x 2 x x 2-5x 3 6 x 1 x 2 2x x 2 x x 2 5x 3-6 x 1 x 2 2x x 2 2x x 2 15x 3-18 x 1 x 2 2x x 2 2x x 3-26 x 1 x 2 2x x 2 2x x 3-2
7 Echelon Form of a Matrix Continuing the process on the previous slide gives x 1 1, x 2 2 and x 3-2 In matrix form, started with and transformed it into x x x x x x x x x Row echelon form Reduced row echelon form
8 Echelon Form of a Matrix Soon, will express the process as Pivot Columns Pivots
9 Echelon Form of a Matrix Defn - An mxn matrix A is said to be in reduced row echelon form if it has the following properties a) If any rows consist of entirely zeros, they are at the bottom of the matrix b)if a row does not consist entirely of zeros, the first nonzero entry in that row is 1 c) If rows i and i + 1 are two successive rows which do not consist entirely of zeros, then the first nonzero entry of row i + 1 is to the right of the first nonzero entry of row i d)if a column contains the first nonzero entry of some row, then all the other entries in that column are zero Defn - If an mxn matrix A satisfies properties (a), (b) and (c), it is said to be in row echelon form
10 Echelon Form of a Matrix Examples - Row Echelon Form
11 Echelon Form of a Matrix Examples - Reduced Row Echelon Form
12 Echelon Form of a Matrix Examples - Not Reduced Row Echelon Form
13 Echelon Form of a Matrix Comments - Row Echelon Form Can define column echelon form and reduced column echelon form in a similar manner. Basically, they are just the transpose of the corresponding row forms Close connection between echelon forms and the solution of linear equations
14 Echelon Form of a Matrix Defn - An elementary row operation on a matrix A is any one of the following operations a) Interchange rows i and j of matrix A b)multiply row i of A by c 0 c) Add c times row i of A to row j of A, i j
15 Echelon Form of a Matrix Comment The first elementary row operation, exchange two rows, is needed to deal with zeros in the pivot positions. For example, consider 2x x x14 x x No multiple of the first row will remove the 3 in the second row. The solution with equations is just to exchange the equations. The solution with matrices is just to exchange the rows. 3x14 x x x x This problem can also occur as an intermediate step in solving a larger system and has the same fix
16 Echelon Form of a Matrix Comment - The elementary row operations on an mxn matrix A can be accomplished by multiplying A by a specially chosen mxm matrix. This is useful for proofs, but not for practical computations since too many operations are required.
17 Echelon Form of a Matrix Elementary Row Operations Interchange rows i and j of matrix A a a a a a a a a a a a a a a a a a a a a a a a a In general, rows i and j of A can be interchanged by multiplying A by the mxm matrix E defined as 1 if k i and k j epq 0 except for ekk 0 if k i or k j and e 1, e 1 E is a special case of a permutation matrix ij ji
18 Echelon Form of a Matrix Elementary Row Operations Multiply row i of A by c c 0 a21 a22 a23 a24 ca21 ca22 ca23 ca a a a a a a a a a a a a a a a a In general, row i of A can be multiplied by c by multiplying A by the mxm matrix E defined as 0 if p q epq 1 if p q i c if p q i
19 Echelon Form of a Matrix Elementary Row Operations Add c times row i of A to row j of A, i j 1 0 0a11 a12 a13 a a21 a22 a23 a24 0 c 1 a a a a a11 a12 a13 a 14 a21 a22 a23 a24 ca21 a31 ca22 a32 ca23 a33 ca24 a 34 In general, can add c times row c p j and q i i to row j of A by multiplying epq 1 p q A by the mxm matrix E defined as 0 otherwise
20 Echelon Form of a Matrix Comments The appropriate elementary matrix E may be obtained by performing the desired operation on the rows of the mxm identity matrix I m Can define elementary matrices F to perform elementary column operations by doing the corresponding operations on the columns of the identity matrix. The matrices F are applied by post multiplying, i.e. AF
21 Echelon Form of a Matrix Defn - An mxn matrix A is row equivalent to an mxn matrix A if A can be obtained by applying a finite sequence of elementary row operations to A The basic method for solving the system AX B is to apply elementary row operations to the augmented matrix [A:B] to get a new augmented matrix [C:D] such that the CX D is easy to solve If [C:D] is in row echelon form, the method is called Gaussian Elimination If [C:D] is in reduced row echelon form, the method is called Gauss-Jordan Elimination
22 Echelon Form of a Matrix Comments In first set of lectures, we argued that the solution to a system of linear equations is unchanged if we do any of the following a) Interchange two equations b)multiply a given equation by a nonzero constant c) Add a constant times one equation to another equation When the system is viewed in terms of matrices, the above operations become elementary row operations on the augmented matrix.
23 Echelon Form of a Matrix Theorem - Every nonzero mxn matrix A is row equivalent to a matrix in row echelon form Proof Let A = [ a ij ] be a nonzero mxn matrix. Find the first (from the left) nonzero column, s, then find the row, r, containing the first (from the top) nonzero entry in column s. Define a matrix B = [ b ij ] as follows. If r = 1, B = A. If r 1, interchange rows 1 and r of A to get B. Then b 1s 0. Multiply the first row of B by 1/b 1s to get a matrix C = [ c ij ] such that c 1s = 1. Consider the other entries in column s. If c hs 0, 2 h m, add -c hs times the first row to row h.
24 Echelon Form of a Matrix Proof (continued) - The elements of column s in rows 2, 3,, m of C are now zero. Call the resulting matrix D. Consider the (m-1)xn submatrix A 1 of D obtained by deleting the first row of D. Repeat the above process with A 1 in place of A. Continuing this process yields a matrix in row echelon form that is row equivalent to A. QED
25 Echelon Form of a Matrix Theorem - Every nonzero mxn matrix A is row equivalent to a matrix in reduced row echelon form Proof - Let A be a nonzero mxn matrix. Apply the method of the preceding theorem to obtain a matrix H in row echelon form that is row equivalent to A. Suppose that rows 1, 2,, r of H are nonzero and that the leading ones in these rows occur in columns c 1, c 2,, c r, where c 1 < c 2 < L < c r.
26 Echelon Form of a Matrix Proof (continued) - Starting with the last nonzero row of H, add suitable multiples of this row to all rows above it to create zeros in column c r above the one in row r. Repeat this process with rows r 1, r 2,, 2 to make all entries above a leading one equal to zero. This gives a matrix in reduced row echelon form that is row equivalent to H, which is row equivalent to A. QED Note: Can show that the reduced row echelon matrix is unique
27 Echelon Form of a Matrix Theorem - Let A and C be mxn matrices. If the system AX b has an augmented matrix [A:b] which is row equivalent to an augmented matrix [C:d], then the systems AX b and CX d have the same solution. Proof - The elementary row operations on the augmented matrices correspond to the following operations on the equations, which leave the solution unchanged. a) Interchange two equations b) Multiply a given equation by a nonzero constant c) Add a constant times one equation to another equation So, the two systems have the same solution QED
28 Echelon Form of a Matrix Corollary - If A and C are row equivalent mxn matrices, then the homogeneous systems AX 0 and CX 0 are equivalent. Proof - Form the augmented matrices [A:0] and [C:0]. Since A and C are row equivalent, [A:0] and [C:0] are row equivalent. By the preceding theorem, AX 0 and CX 0 have the same solution. QED
29 Echelon Form of a Matrix Comments If Gauss-Jordan reduction is used, the solution is just read off. If Gaussian elimination is used, the solution must be found by back substitution Although we have talked about the solution, we have not established any conditions that ensure that a solution will exist or that it will be unique
30 Echelon Form of a Matrix Example : CD x1 2x2 3x3 4x4 5x5 6 x2 2x3 3x4 - x5 7 x3 2x4 3x5 7 x 2x Set x 5 = r and backsolve x1-1-10r x2 25r x3-11 r x4 9-2r Infinite number of solutions
31 Echelon Form of a Matrix Example CD : The last equation is 0x 1 +0x 2 +0x 3 +0x 4 1, which cannot be satisfied Clearly, several things can happen and a careful and organized analysis of the problem is required
32 Echelon Form of a Matrix Homogeneous Systems Homogeneous system, AX 0, of m equations in n unknowns occurs often applications Example Set x 5 r, then determine x 4-4r, x 3-3r and x 1-2r. There is no equation determining x 2, so set x 2 = s. Note that the set of solutions is determined/controlled by the pair of independent parameters r and s. More about this later
33 Homogeneous Systems Theorem - A homogeneous system of m linear equations in n unknowns always has a nontrivial solution if m < n, i.e. if the number of unknowns exceeds the number of equations Proof - Let B be a matrix in reduced row echelon form that is row equivalent to A. The homogeneous systems AX 0 and BX 0 are equivalent. Let l be the number of nonzero rows of B. Then l m. Since m < n, then l < n. So, we are solving l equations in n unknowns and can solve for l of the unknowns in terms of the remaining n - l unknowns, which can take any values. So, BX 0 and thus AX 0 have nontrivial solutions QED Linear Algebra Echelon Form of a Matrix
34 Topics Preliminaries Echelon Form of a Matrix Elementary Matrices; Finding A -1 Equivalent Matrices LU-Factorization
35 Elementary Matrices; Finding A -1 Preliminaries Earlier, concept of nonsingular, or invertible, nxn matrix A was introduced. For an invertible matrix A, there is a matrix A -1 such that A A -1 = I and A - 1 A = I. However, at this point, there is no way to compute A -1 Have defined three elementary row operations Type I - exchange two rows Type II - multiply a row by a nonzero constant Type III - add a multiple of one row to another Each elementary row operation can be performed on a matrix A by multiplying A by an appropriate elementary matrix E
36 Elementary Matrices; Finding A -1 Defn - An nxn elementary matrix of Type I, Type II or Type III is a matrix obtained from the identity matrix I n by performing a single elementary row operation of Type I, Type II or Type III, respectively Theorem - Let A be an mxn matrix and let an elementary row operation of Type I, Type II or Type III be performed on A to yield matrix B. Let E be the elementary matrix obtained from I m by performing on it the same elementary row operation that was performed on A. Then B = EA
37 Elementary Matrices; Finding A -1 Theorem - If A and B are mxn matrices, then A is row equivalent to B if and only if B EkEk-1 E2E1A k where are mxm elementary matrices. E i i 1 Proof - Suppose A is row equivalent to B. By definition, B can be obtained by applying a finite number of elementary row operations to A. Each elementary row operation can be accomplished by multiplying by an appropriate elementary matrix. So the transformation from A to B can be accomplished by multiplying by a sequence of k elementary matrices. So B E E E E A E k k i i 1
38 Elementary Matrices; Finding A -1 Proof (continued) Now suppose that we have B EkEk-1 E2E1A where each E i is an elementary matrix. Since B is obtained by applying a sequence of elementary row operations to A, then A is row equivalent to B. QED
39 Elementary Matrices; Finding A -1 Theorem - An elementary matrix is nonsingular and its inverse is an elementary matrix of the same type Proof - Will use the definition of nonsingularity, i.e. find a matrix that serves as an inverse. Type I - Let E switch rows i and j. Then the effects of E may be undone by applying E again, i.e. EE = I. So, E is invertible and E -1 = E Type II - Let E multiply the ith row by c 0. Let F multiply the ith row by 1/c. Then EF = FE = I. So, E is invertible and E -1 = F
40 Elementary Matrices; Finding A -1 Proof (continued) Type III - Let E add c times the ith row to the jth row. Let F add (-c) times the ith row to the jth row. Then EF = FE = I. So, E is invertible and E -1 = F QED
41 Elementary Matrices; Finding A -1 Theorem - Let A be a an nxn matrix and let the homogeneous system AX 0 have only the trivial solution X 0. Then A is row equivalent to I n. Proof - Let B be the matrix in reduced row echelon form that is row equivalent to A. The systems AX 0 and BX 0 are equivalent, so BX 0 has the trivial solution only. Now examine the structure of B. Since B is in reduced row echelon form, it has a similar appearance to I n. Let r n be the number of nonzero rows of B. If r < n, we have proved that BX 0 has a nontrivial solution. So, r = n, i.e. every row of B is nonzero. The first nonzero entry in each row appears to the right of the first one in the previous row, so B = I n QED
42 Elementary Matrices; Finding A -1 Theorem - A is nonsingular if and only if A is a product of elementary matrices Proof - Let A be nonsingular and consider the system AX 0. Then A -1 ( AX ) A -1 0 X 0. So, AX 0 has the trivial solution only. By the theorem on the the previous slide, A is row equivalent to I n. So, there exist elementary k matrices E i such that 1 I i n EkEk-1 E2E1A Then A EkEk- 1 E2E1 E1 E2 Ek- 1Ek 1 Each E ī is an elementary matrix. Let A E Each E i is nonsingular 1E2 El- 1El and A is nonsingular since it is the product of nonsingular matrices QED
43 Elementary Matrices; Finding A -1 Theorem - A is nonsingular if and only if A is row equivalent to I n Proof - Let A be nonsingular. By the previous theorem, A can be expressed as the product of elementary row matrices. A EkEk-1 E2E1 Then A AInE so A is row kek-1 E2E1I n equivalent to I n Let A be row equivalent to I n. Then In E Each E i has an inverse. kek-1 E2E1A Operate on each side with inverses A E E E E I E E E E E ī k-1 k n 1 2 k-1 k each 1is an elementary matrix, so A is nonsingular QED
44 Theorem - The homogeneous system of n linear equations in n unknowns, AX 0, has a nontrivial solution if and only if A is singular Proof - Let AX 0 have a nontrivial solution. Suppose A is nonsingular. Then A -1 exists. So A -1 ( AX ) A -1 0 X 0, i.e. the trivial solution. This is a contradiction since we know that AX 0 has a nontrivial solution. So, A is singular. Let A be singular. If the system AX 0 has the trivial solution only, then A is row equivalent to I n. By the previous theorem, A is nonsingular, which is a contradiction. So, AX 0 has a nontrivial solution QED Linear Algebra Elementary Matrices; Finding A -1
45 Elementary Matrices; Finding A -1 Equivalent statements for nxn matrix A A is nonsingular AX 0 has the trivial solution only A is row equivalent to I n The system AX B has a unique solution for every nx1 matrix B A is a product of elementary matrices
46 Elementary Matrices; Finding A -1 Computing A -1 Have shown that if A is nonsingular, then it is row equivalent to I n. Also, have shown that it can be expressed as the product of elementary matrices. I E E E E A A E E E E n k k k-1 k - 1 Then A E E E So, A -1 k-1e k EkEk- 1 E E can be represented as the product of the elementary matrices that reduce A to I n Create the partitioned matrix n A I and apply the operations that reduce A to I n k E E E E A I I A -1 k n n
47 Elementary Matrices; Finding A -1 Computing A -1 - Example Compute inverse of A A
48 Elementary Matrices; Finding A -1 Theorem - An nxn matrix A is singular if and only if A is row equivalent to a matrix B that has a row of zeros Proof - Let A be singular. Apply Gauss-Jordan reduction to A to get a matrix B in reduced row echelon form which is row equivalent to A. B cannot be I n since if it were, A would be nonsingular. Since B is in reduced row echelon form, B must have at least one row of zeros at the bottom. Let a A be row equivalent to a matrix B that has a row of all zeros.
49 Elementary Matrices; Finding A -1 Proof (continued) - The matrix B is singular since there does not exist a matrix C such that BC = CB = I n. (To see this, let the ith row of B consist of all zeros. The ith row of BC is generated by taking the ith row of B and multiplying each column of C by it. So, the ith row of BC is all zeros, but BC = I n. So, B must be singular.) A is row equivalent to B, so B E k E k-1 E 2 E 1 A If A is nonsingular then so is B since it is the product of nonsingular matrices. Since we know B is singular, then A must be singular. QED
50 Elementary Matrices; Finding A -1 The preceding theorem gives a way to determine if A is singular. Also, the determination of singularity/nonsingularity can be made in the process of computing A -1 Form the augmented matrix A I n, then put it into reduced row echelon form to get. C D If C = I n then A is nonsingular and D = A -1 If C I n then C has a row of zeros and thus is singular. So, A is singular and A -1 does not exist
51 Elementary Matrices; Finding A -1 Theorem - If A and B are nxn matrices such that AB = I n, then BA = I n. Thus A is nonsingular and B = A -1 Proof - First show that if AB = I n then A is nonsingular. Suppose that A is singular. Then A is row equivalent to a matrix C that has a row of zeros, i.e. C E, where is a kek-1 E2E1A k E i i 1 set of elementary matrices. CB EkEk-1 E2E1AB so CB is row equivalent to AB. Since C has a row of zeros, so does CB. AB is singular since it is row equivalent to a matrix with a row of zeros. However AB = I n, which is nonsingular. Contradiction. So, A is nonsingular and A -1 exists. A -1 ( AB ) = A -1 I n so B = A -1 QED
52 Topics Preliminaries Echelon Form of a Matrix Elementary Matrices; Finding A -1 Equivalent Matrices LU-Factorization
53 Equivalent Matrices Comments Have looked at elementary row operations, classified them as Type I, Type II and Type III, and argued that for a given row operation there is an elementary matrix E such that EA performs the operation on A Can also define elementary column operations and classify them as Type I, Type II and Type III. For a given elementary column operation, can find a matrix E such that AE performs the operation on A
54 Equivalent Matrices Defn - If A and B are two mxn matrices, then A is equivalent to B if B is obtained from A by a finite sequence of elementary row or elementary column operations Theorem - If A is any nonzero mxn matrix, then A is equivalent to a partitioned matrix of the form I r r n-r m-r r m-r n-r Proof - By elementary row operations, transform A into a matrix B in reduced row echelon form.
55 Equivalent Matrices Proof (continued) - Interchange columns of B (Type I operations) to transform B into a matrix of the form Ir run-r m-r0r m-r0n-r where r is the number of nonzero rows in B. The only difference between this matrix and the desired form is the matrix r U n-r. The entries may be cleared by elementary column operations subtracting appropriate multiples of columns of Ir from run-r I giving r r0n-r m-r0r m-r0n-r m-r0r m-r0n-r which is equivalent to A QED
56 Equivalent Matrices Theorem - Two mxn matrices A and B are equivalent if and only if B = PAQ for some nonsingular matrices P and Q Proof - Let A and B be equivalent. Then B can be obtained from A by a sequence of elementary k row operations performed by E i and a i 1 sequence of column operations performed by Then B EkEk- 1 E2E1AF 1F2 Fl -1F l The matrices P EkEk-1 E2E1and Q F1F 2 Fl- 1Fl are nonsingular since they are products of nonsingular matrices. l F i i 1
57 Equivalent Matrices Proof (continued) Let B = PAQ where P and Q are nonsingular. Since P is nonsingular, it can be represented as a product of elementary row matrices, i.e. P EkEk-1 E2E1 Similarly, Q can be represented as the product of elementary column matrices Q F1F 2 Fl- 1Fl So, B E Thus B is kek-1 E2E1AF 1F2 Fl -1F l equivalent to A. QED
58 Equivalent Matrices Theorem - An nxn matrix A is nonsingular if and only if A is equivalent to I n Proof - Let A be nonsingular. Then A is row equivalent to I n and, thus, A is equivalent to I n Let A be equivalent to I n. Then by the previous theorem, there exist nonsingular matrices P and Q such that I n = PAQ. Since P and Q are nonsingular, P -1 and Q -1 exist. So A = P -1 I n Q -1. Since A is the product of nonsingular matrices, then A is nonsingular. QED
59 Topics Preliminaries Echelon Form of a Matrix Elementary Matrices; Finding A -1 Equivalent Matrices LU-Factorization
60 LU-Factorization Comments Current method of solving linear equations, Gauss-Jordan reduction, consists of forming the augmented matrix A B and applying Gauss- Jordan reduction to it to obtain a matrix n I C where C is the solution. Works fine for small systems. For large systems, there are more efficient methods that do not require getting the reduced row echelon form, or even the row echelon method
61 LU-Factorization Observations Upper triangular system AX = B a11 a12 a13 a1n b1 0 a22 a23 a2n b a33 a3n b3 aii 0 for 1 i n ann bn System may be solved by back substitution a nn x n b n x n b n a nn n - n a x a x b x b a x a n-1, n-1 n-1 n-1, n n-1 n-1 n-1 n-1, n n-1, n-1 n x b - a x a j n -1, n - 2,,1 j j jk k jj kj1
62 LU-Factorization Observations Lower triangular system AX = B a b 1 a21 a b2 a a a 0 b a 0 for 1 i n an1 an2 an3 ann b a x b x b a a x a x b x b -a x a j-1 x b -a x a j 2,3,, n j j jk k jj k1 n ii System may be solved by forward substitution
63 LU-Factorization Comments If the coefficient matrix has either of the triangular forms, the system is easy to solve Will develop a method for solving a general system AX = B by a method based on these observations
64 LU-Factorization Defn - An nxn matrix A is said to be in triangular form when it satisfies the following properties a) A is either an upper or lower triangular matrix b)all of the diagonal entries of A are nonzero If the coefficient matrix A of the system AX = B is of triangular form, then the system is said to be of triangular form
65 LU-Factorization Defn - Let A be a nonsingular matrix and suppose that there is a lower triangular matrix L and an upper triangular matrix U such that A = LU. Then A is said to have an LU factorization or an LU decomposition Method - To solve AX = B where A = LU, express the system as LUX = B. Let UX = Z, then LZ = B. Solve this system by forward substitution to get Z, then solve UX = Z by back substitution to get X.
66 LU-Factorization Comments If we need to solve AX = B 1, AX = B 2,, AX = B k where { B 1, B 2,, B k } are not all known at the same time, it does not make sense to do the same Gaussian Elimination steps k times, needing about n 3 /3 operations each time Options are Compute A -1 and compute X = A -1 B i, 1 i k Compute LU = A and solve the two triangular systems each time.
67 LU-Factorization Comments Computing A -1 requires about n 3 operations and solving each system requires about n 2 operations Computing the factorization LU requires about n 3 /3 operations and solving each system requires about n 2 operations If A has a special structure, e.g. if A is tridiagonal, that structure may be partially reflected in L and U, but not necessarily in A -1
68 LU-Factorization Example A A L Forward solving and back solving can be done very efficiently since the lower triangular zeros of L and the upper triangular zeros of U are in known locations. The cost of solving a tridiagonal system is proportional to n U
69 LU-Factorization Comments A band matrix has a ij = 0 except in the band i - j w The half bandwidth is w = 1 for diagonal matrix, w = 2 for a tridiagonal matrix, and w = n for a full matrix. Solving a band system requires about w 2 n operations A w w w w L U
70 LU-Factorization Example - Consider AX = B x x x x Can show A has an LU factorization L U
71 LU-Factorization Example (continued) A = LU, let Z = UX and solve LZ = B z z z z 4-43 z1 2, 1 z1 z2-4 z z1-2z2 z3 8 z3 2 -z z - 2z z -43 z
72 LU-Factorization Example (continued) Solve UX = Z by back substitution x x x x x4-32 x4-4 5x3-2x4 2 x x2-4x3 - x4-5 x x - 2x - 4x 4x 2 x
73 LU-Factorization Questions How do we find L and U? Are L and U unique? Are there other computational issues?
74 LU-Factorization Computing L and U Initialize L with the identity (leave the entries below the diagonal blank) and initialize U with A L U Will clear the entries below the diagonal of U, a column at a time, by subtracting multiples of rows of U from rows below them. The multipliers used are recorded in L in the location corresponding to position in U being cleared
75 LU-Factorization Computing L and U (continued) Clear u L U Clear u L U
76 LU-Factorization Computing L and U (continued) Clear u L U Clear u L U
77 LU-Factorization Computing L and U (continued) Clear u L U Clear u L U
78 LU-Factorization Computing L and U (continued) When doing this on a computer with a large matrix A, can return the results in the space allocated to A. L always has ones on its diagonal, so it is not necessary to store them. Also, it is not necessary to store the lower triangular part of U since it always consists of zeros. For our example, results could be returned as
79 LU-Factorization Uniqueness Can also express as the product L * U * of * * L U So lower and upper triangular matrices are not unique
80 LU-Factorization Uniqueness (continued) Note that U So A
81 LU-Factorization L * Uniqueness (continued) Also note that U *
82 LU-Factorization Uniqueness (continued) Finally, LU * *
83 LU-Factorization Uniqueness (continued) Theorem - If A = L 1 D 1 U 1 and also A = L 2 D 2 U 2 where the Ls are lower triangular with unit diagonal, the Us are upper triangular with unit diagonal, and the Ds are diagonal matrices with no zeros on the diagonal, then L 1 = L 2, D 1 = D 2, and U 1 = U 2. That is, the LDU factorization of A is unique.
84 LU-Factorization Other Computational Issues Compute the LU factorization of L 1 0 U L U L U A Can t continue. Go back and fix A
85 LU-Factorization Other Computational Issues (continued) Problem is that rows of A are in the wrong order PA Permutation Matrix
86 LU-Factorization Other Computational Issues (continued) L 1 0 U L L U U
87 LU-Factorization Other Computational Issues (continued) PA LU Comments This has to be done often in practical problems The matrices L and U may be used directly to solve AX = B without considering permutations Need to consider P only when trying to reconstruct A. Then A = P 1 LU
GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511)
GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511) D. ARAPURA Gaussian elimination is the go to method for all basic linear classes including this one. We go summarize the main ideas. 1.
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 informationLinear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4
Linear Algebra Section. : LU Decomposition Section. : Permutations and transposes Wednesday, February 1th Math 01 Week # 1 The LU Decomposition We learned last time that we can factor a invertible matrix
More informationLinear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey
Copyright 2005, W.R. Winfrey Topics Preliminaries Systems of Linear Equations Matrices Algebraic Properties of Matrix Operations Special Types of Matrices and Partitioned Matrices Matrix Transformations
More informationMath 313 Chapter 1 Review
Math 313 Chapter 1 Review Howard Anton, 9th Edition May 2010 Do NOT write on me! Contents 1 1.1 Introduction to Systems of Linear Equations 2 2 1.2 Gaussian Elimination 3 3 1.3 Matrices and Matrix Operations
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 informationLinear Algebra: Lecture notes from Kolman and Hill 9th edition.
Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices
More informationLinear Algebra and Matrix Inversion
Jim Lambers MAT 46/56 Spring Semester 29- Lecture 2 Notes These notes correspond to Section 63 in the text Linear Algebra and Matrix Inversion Vector Spaces and Linear Transformations Matrices are much
More informationExtra Problems: Chapter 1
MA131 (Section 750002): Prepared by Asst.Prof.Dr.Archara Pacheenburawana 1 Extra Problems: Chapter 1 1. In each of the following answer true if the statement is always true and false otherwise in the space
More informationLinear Equations and Matrix
1/60 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Gaussian Elimination 2/60 Alpha Go Linear algebra begins with a system of linear
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 information7.6 The Inverse of a Square Matrix
7.6 The Inverse of a Square Matrix Copyright Cengage Learning. All rights reserved. What You Should Learn Verify that two matrices are inverses of each other. Use Gauss-Jordan elimination to find inverses
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 informationGaussian Elimination and Back Substitution
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 4 Notes These notes correspond to Sections 31 and 32 in the text Gaussian Elimination and Back Substitution The basic idea behind methods for solving
More informationMAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to :
MAC 0 Module Systems of Linear Equations and Matrices II Learning Objectives Upon completing this module, you should be able to :. Find the inverse of a square matrix.. Determine whether a matrix is invertible..
More informationMATH2210 Notebook 2 Spring 2018
MATH2210 Notebook 2 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 2 MATH2210 Notebook 2 3 2.1 Matrices and Their Operations................................
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationMAT 2037 LINEAR ALGEBRA I web:
MAT 237 LINEAR ALGEBRA I 2625 Dokuz Eylül University, Faculty of Science, Department of Mathematics web: Instructor: Engin Mermut http://kisideuedutr/enginmermut/ HOMEWORK 2 MATRIX ALGEBRA Textbook: Linear
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationThe Solution of Linear Systems AX = B
Chapter 2 The Solution of Linear Systems AX = B 21 Upper-triangular Linear Systems We will now develop the back-substitution algorithm, which is useful for solving a linear system of equations that has
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 1 Matrices and Systems of Equations
Chapter 1 Matrices and Systems of Equations System of Linear Equations 1. A linear equation in n unknowns is an equation of the form n i=1 a i x i = b where a 1,..., a n, b R and x 1,..., x n are variables.
More information. =. a i1 x 1 + a i2 x 2 + a in x n = b i. a 11 a 12 a 1n a 21 a 22 a 1n. i1 a i2 a in
Vectors and Matrices Continued Remember that our goal is to write a system of algebraic equations as a matrix equation. Suppose we have the n linear algebraic equations a x + a 2 x 2 + a n x n = b a 2
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 informationMatrix Algebra. Matrix Algebra. Chapter 8 - S&B
Chapter 8 - S&B Algebraic operations Matrix: The size of a matrix is indicated by the number of its rows and the number of its columns. A matrix with k rows and n columns is called a k n matrix. The number
More informationDirect Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationMODEL ANSWERS TO THE THIRD HOMEWORK
MODEL ANSWERS TO THE THIRD HOMEWORK 1 (i) We apply Gaussian elimination to A First note that the second row is a multiple of the first row So we need to swap the second and third rows 1 3 2 1 2 6 5 7 3
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 informationDirect Methods for Solving Linear Systems. Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le
Direct Methods for Solving Linear Systems Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le 1 Overview General Linear Systems Gaussian Elimination Triangular Systems The LU Factorization
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) 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.......
More informationMatrix & Linear Algebra
Matrix & Linear Algebra Jamie Monogan University of Georgia For more information: http://monogan.myweb.uga.edu/teaching/mm/ Jamie Monogan (UGA) Matrix & Linear Algebra 1 / 84 Vectors Vectors Vector: A
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 13
STAT 309: MATHEMATICAL COMPUTATIONS I FALL 208 LECTURE 3 need for pivoting we saw that under proper circumstances, we can write A LU where 0 0 0 u u 2 u n l 2 0 0 0 u 22 u 2n L l 3 l 32, U 0 0 0 l n l
More informationChapter 7. Tridiagonal linear systems. Solving tridiagonal systems of equations. and subdiagonal. E.g. a 21 a 22 a A =
Chapter 7 Tridiagonal linear systems The solution of linear systems of equations is one of the most important areas of computational mathematics. A complete treatment is impossible here but we will discuss
More informationMATH 2030: MATRICES. Example 0.2. Q:Define A 1 =, A. 3 4 A: We wish to find c 1, c 2, and c 3 such that. c 1 + c c
MATH 2030: MATRICES Matrix Algebra As with vectors, we may use the algebra of matrices to simplify calculations. However, matrices have operations that vectors do not possess, and so it will be of interest
More informationNumerical Linear Algebra
Numerical Linear Algebra Direct Methods Philippe B. Laval KSU Fall 2017 Philippe B. Laval (KSU) Linear Systems: Direct Solution Methods Fall 2017 1 / 14 Introduction The solution of linear systems is one
More informationElementary Row Operations on Matrices
King Saud University September 17, 018 Table of contents 1 Definition A real matrix is a rectangular array whose entries are real numbers. These numbers are organized on rows and columns. An m n matrix
More informationLemma 8: Suppose the N by N matrix A has the following block upper triangular form:
17 4 Determinants and the Inverse of a Square Matrix In this section, we are going to use our knowledge of determinants and their properties to derive an explicit formula for the inverse of a square matrix
More information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More informationExample: 2x y + 3z = 1 5y 6z = 0 x + 4z = 7. Definition: Elementary Row Operations. Example: Type I swap rows 1 and 3
Linear Algebra 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
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 informationFundamentals of Engineering Analysis (650163)
Philadelphia University Faculty of Engineering Communications and Electronics Engineering Fundamentals of Engineering Analysis (6563) Part Dr. Omar R Daoud Matrices: Introduction DEFINITION A matrix is
More informationMIDTERM 1 - SOLUTIONS
MIDTERM - SOLUTIONS MATH 254 - SUMMER 2002 - KUNIYUKI CHAPTERS, 2, GRADED OUT OF 75 POINTS 2 50 POINTS TOTAL ) Use either Gaussian elimination with back-substitution or Gauss-Jordan elimination to solve
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 informationSection 5.6. LU and LDU Factorizations
5.6. LU and LDU Factorizations Section 5.6. LU and LDU Factorizations Note. We largely follow Fraleigh and Beauregard s approach to this topic from Linear Algebra, 3rd Edition, Addison-Wesley (995). See
More informationA Review of Matrix Analysis
Matrix Notation Part Matrix Operations Matrices are simply rectangular arrays of quantities Each quantity in the array is called an element of the matrix and an element can be either a numerical value
More information22A-2 SUMMER 2014 LECTURE 5
A- SUMMER 0 LECTURE 5 NATHANIEL GALLUP Agenda Elimination to the identity matrix Inverse matrices LU factorization Elimination to the identity matrix Previously, we have used elimination to get a system
More informationReview Questions REVIEW QUESTIONS 71
REVIEW QUESTIONS 71 MATLAB, is [42]. For a comprehensive treatment of error analysis and perturbation theory for linear systems and many other problems in linear algebra, see [126, 241]. An overview of
More informationLecture Notes in Linear Algebra
Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................
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 informationINVERSE OF A MATRIX [2.2]
INVERSE OF A MATRIX [2.2] The inverse of a matrix: Introduction We have a mapping from R n to R n represented by a matrix A. Can we invert this mapping? i.e. can we find a matrix (call it B for now) such
More informationIntroduction to Matrices and Linear Systems Ch. 3
Introduction to Matrices and Linear Systems Ch. 3 Doreen De Leon Department of Mathematics, California State University, Fresno June, 5 Basic Matrix Concepts and Operations Section 3.4. Basic Matrix Concepts
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 informationLecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013
Lecture 6 & 7 Shuanglin Shao September 16th and 18th, 2013 1 Elementary matrices 2 Equivalence Theorem 3 A method of inverting matrices Def An n n matrice is called an elementary matrix if it can be obtained
More informationSystems of Linear Equations and Matrices
Chapter 1 Systems of Linear Equations and Matrices System of linear algebraic equations and their solution constitute one of the major topics studied in the course known as linear algebra. In the first
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 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 informationChapter 2 Notes, Linear Algebra 5e Lay
Contents.1 Operations with Matrices..................................1.1 Addition and Subtraction.............................1. Multiplication by a scalar............................ 3.1.3 Multiplication
More informationChapter 7. Linear Algebra: Matrices, Vectors,
Chapter 7. Linear Algebra: Matrices, Vectors, Determinants. Linear Systems Linear algebra includes the theory and application of linear systems of equations, linear transformations, and eigenvalue problems.
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 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 informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 12: Gaussian Elimination and LU Factorization Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 10 Gaussian Elimination
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 informationGraduate Mathematical Economics Lecture 1
Graduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 23, 2012 Outline 1 2 Course Outline ematical techniques used in graduate level economics courses Mathematics for Economists
More informationReview of Vectors and Matrices
A P P E N D I X D Review of Vectors and Matrices D. VECTORS D.. Definition of a Vector Let p, p, Á, p n be any n real numbers and P an ordered set of these real numbers that is, P = p, p, Á, p n Then P
More informationSystems of Linear Equations and Matrices
Chapter 1 Systems of Linear Equations and Matrices System of linear algebraic equations and their solution constitute one of the major topics studied in the course known as linear algebra. In the first
More informationAPPENDIX: MATHEMATICAL INDUCTION AND OTHER FORMS OF PROOF
ELEMENTARY LINEAR ALGEBRA WORKBOOK/FOR USE WITH RON LARSON S TEXTBOOK ELEMENTARY LINEAR ALGEBRA CREATED BY SHANNON MARTIN MYERS APPENDIX: MATHEMATICAL INDUCTION AND OTHER FORMS OF PROOF When you are done
More informationThe following steps will help you to record your work and save and submit it successfully.
MATH 22AL Lab # 4 1 Objectives In this LAB you will explore the following topics using MATLAB. Properties of invertible matrices. Inverse of a Matrix Explore LU Factorization 2 Recording and submitting
More informationEquality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.
Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read
More informationMATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.
MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:
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 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 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 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 informationMath113: Linear Algebra. Beifang Chen
Math3: Linear Algebra Beifang Chen Spring 26 Contents Systems of Linear Equations 3 Systems of Linear Equations 3 Linear Systems 3 2 Geometric Interpretation 3 3 Matrices of Linear Systems 4 4 Elementary
More informationLINEAR SYSTEMS AND MATRICES
CHAPTER 3 LINEAR SYSTEMS AND MATRICES SECTION 3. INTRODUCTION TO LINEAR SYSTEMS This initial section takes account of the fact that some students remember only hazily the method of elimination for and
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 informationScientific Computing
Scientific Computing Direct solution methods Martin van Gijzen Delft University of Technology October 3, 2018 1 Program October 3 Matrix norms LU decomposition Basic algorithm Cost Stability Pivoting Pivoting
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
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 informationII. Determinant Functions
Supplemental Materials for EE203001 Students II Determinant Functions Chung-Chin Lu Department of Electrical Engineering National Tsing Hua University May 22, 2003 1 Three Axioms for a Determinant Function
More informationDigital Workbook for GRA 6035 Mathematics
Eivind Eriksen Digital Workbook for GRA 6035 Mathematics November 10, 2014 BI Norwegian Business School Contents Part I Lectures in GRA6035 Mathematics 1 Linear Systems and Gaussian Elimination........................
More informationLU Factorization. Marco Chiarandini. DM559 Linear and Integer Programming. Department of Mathematics & Computer Science University of Southern Denmark
DM559 Linear and Integer Programming LU Factorization Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark [Based on slides by Lieven Vandenberghe, UCLA] Outline
More informationMath 60. Rumbos Spring Solutions to Assignment #17
Math 60. Rumbos Spring 2009 1 Solutions to Assignment #17 a b 1. Prove that if ad bc 0 then the matrix A = is invertible and c d compute A 1. a b Solution: Let A = and assume that ad bc 0. c d First consider
More informationUndergraduate Mathematical Economics Lecture 1
Undergraduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 15, 2014 Outline 1 Courses Description and Requirement 2 Course Outline ematical techniques used in economics courses
More informationMatrix operations Linear Algebra with Computer Science Application
Linear Algebra with Computer Science Application February 14, 2018 1 Matrix operations 11 Matrix operations If A is an m n matrix that is, a matrix with m rows and n columns then the scalar entry in the
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
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 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 informationMatrices and Matrix Algebra.
Matrices and Matrix Algebra 3.1. Operations on Matrices Matrix Notation and Terminology Matrix: a rectangular array of numbers, called entries. A matrix with m rows and n columns m n A n n matrix : a square
More informationChapter 2: Matrices and Linear Systems
Chapter 2: Matrices and Linear Systems Paul Pearson Outline Matrices Linear systems Row operations Inverses Determinants Matrices Definition An m n matrix A = (a ij ) is a rectangular array of real numbers
More informationMath 22AL Lab #4. 1 Objectives. 2 Header. 0.1 Notes
Math 22AL Lab #4 0.1 Notes Green typewriter text represents comments you must type. Each comment is worth one point. Blue typewriter text represents commands you must type. Each command is worth one point.
More informationMTH 102A - Linear Algebra II Semester
MTH 0A - Linear Algebra - 05-6-II Semester Arbind Kumar Lal P Field A field F is a set from which we choose our coefficients and scalars Expected properties are ) a+b and a b should be defined in it )
More information3.4 Elementary Matrices and Matrix Inverse
Math 220: Summer 2015 3.4 Elementary Matrices and Matrix Inverse A n n elementary matrix is a matrix which is obtained from the n n identity matrix I n n by a single elementary row operation. Elementary
More informationMATRICES AND MATRIX OPERATIONS
SIZE OF THE MATRIX is defined by number of rows and columns in the matrix. For the matrix that have m rows and n columns we say the size of the matrix is m x n. If matrix have the same number of rows (n)
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.7 LINEAR INDEPENDENCE LINEAR INDEPENDENCE Definition: An indexed set of vectors {v 1,, v p } in n is said to be linearly independent if the vector equation x x x
More informationChapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in
Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column
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 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 informationMATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics
MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam This study sheet will not be allowed during the test Books and notes will not be allowed during the test Calculators and cell phones
More information