Matrix Algebra and Applications
|
|
- Marylou Owen
- 7 years ago
- Views:
Transcription
1 Matrix Algebra and Applications Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 1 / 49
2 EC2040 Topic 2 - Matrices and Matrix Algebra Reading 1 Chapters 4 and 5 of CW 2 Chapters 11, 12 and 13 of PR Plan 1 Matrices and Matrix Algebra 2 Transpose, Inverse, and Determinant of a Matrix 3 Solutions to Systems of Linear Equations Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 2 / 49
3 Matrices and System of Equations A matrix is an array of numbers. Some examples are, [ ] A =, B = 5 10, C = Notation: We shall use a capital letter to denote a matrix and the corresponding small letter to denote individual elements of a matrix. The element in the (2, 1) position (2nd [ row, 1st column) ] of A will be a11 a denoted as a 21. So, from above, A = 12. a 21 a 22 The number of rows and columns in a matrix is also called its order or dimension. For instance, the matrix A has order Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 3 / 49
4 Special Types of Matrices Square matrix which has the same number of rows as columns (order n n) Row matrix (order 1 n) Column matrix (order n 1). A vector is a matrix having either a single row or a single column. Two special types of square matrices are the null matrix (all entries zero) and the identity matrix which has 1 along the diagonal and zeros everywhere else: A square matrix where the only non-zero entries are on the diagonal is also called a diagonal matrix. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 4 / 49
5 Matrices in Economics One example of a matrix in economics is the IS-LM macro model. 1 Y = C + I + Ḡ C = a + b(1 t)y I = e lr M = ky hr (resource constraint) (consumption function) (investment function) (money demand) We can write the above system in matrix notation as: Y b(1 t) C l I = k 0 0 h R Question: what happens to consumption when we increase the money supply (expansionary monetary policy). 1 Recall, IS (the first three equations) and LM gives AD, where Ḡ and M are government policies. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 5 / 49 Ḡ a e M
6 Arithmetical Operations on Matrices Addition and Subtraction of matrices is very easy but can be done only when all the matrices have the same dimension. Thus, A m n + B p q is defined only when m = p and n = q. Example: [ ] =A [ ] =B 2 2 = [ ] = [ That is, m = p = n = q = 2. [ ] c a11 a 11 Clearly, 12 and c a 21 a 12 cannot be added together. 22 c =A =C 3 1 ] Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 6 / 49
7 Arithmetical Operations on Matrices Formal Definition: Suppose that we have two matrices A = [a ij ] m n and B = [b ij ] m n. Then, the matrix A + B is simply [a ij + b ij ] m n. E.g., for the m = n = 2 case, [ ] [ ] [ ] a11 a 12 b11 b 12 a11 + b 11 a 12 + b 12 a 21 a 22 =A b 21 b 22 B 2 2 = Similarly, the matrix A B is simply [a ij b ij ] m n. a 21 + b 21 a 22 + b 22 This process easily extends to the case when we have many matrices. For instance - if we have three matrices A, B, C of the same dimension - then A + B + C is the matrix formed by adding the corresponding (i, j)th entries of A, B and C. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 7 / 49
8 Scalar Multiplication Scalar Multiplication by a number c is just multiplying each element of the matrix by the number c. 2 1 For instance if A = and c = 5/2 then c A is the 2 2 matrix 5 5/2 15/2 45/ / Note that scalar multiplication applies to any matrix. We can combine the operations of scalar multiplication and addition: for instance, you should be able to say what 5A + 3B means if A and B have the same dimension. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 8 / 49
9 Matrix Multiplication Matrix Multiplication is somewhat more complicated (but all it really requires is concentration). Suppose that we have two matrices A m n and B p q. The product AB is defined only when n = p, that is when the number of columns in A equals the number of rows in B. 1 This means that the product BA is defined only when q = m. 2 It is possible that AB is defined but BA is not defined. 3 Furthermore, even if AB and BA are both defined it is possible that they do not give the same matrix. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 9 / 49
10 Matrix Multiplication The bottom line is, the order of operation is important in matrix multiplication. Mathematically, we say that matrix multiplication is not commutative (whereas the scalar case is). All this is very different from ordinary multiplication. Take the previous example: [ ] 4 3 A 2 2 = and B = What are AB and BA? [ ] Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 10 / 49
11 Matrix Multiplication for the 2 by 2 case First, AB is, [ ] [ ] AB = [ ] 4 (1) + 3 (5) 4 (2) + 3 (6) = = 1 (1) + 2 (5) 1 (2) + 2 (6) However, BA is, [ ] [ ] BA = [ ] 1 (4) + 2 (1) 1 (3) + 2 (2) = = 5 (4) + 6 (1) 5 (3) + 6 (2) So, AB is not BA. [ [ Again, think about this versus the scalar case. If a = 5 and b = 6, ab = ba = 30. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 11 / 49 ] ]
12 Formal Definition of Matrix Multiplication Suppose we have two matrices A = [a ij ] m n and B = [b ij ] n p. The product AB is a m p matrix [c ij ] m p where, c ij = a i1 b 1j + a i2 b 2j a in b nj. Loosely speaking, c ij is the product of the ith row of A and the jth column of B. Again, for the 2 by 2 case, we have: [ ] [ ] a11 a AB = 12 b11 b 12 a 21 a 22 b 21 b 22 [ ] a11 (b = 11 ) + a 12 (b 21 ) a 11 (b 11 ) + a 12 (b 21 ) a 21 (b 12 ) + a 22 (b 22 ) a 21 (b 12 ) + a 22 (b 22 ) [ ] c11 c = 12 C c 21 c 22 Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 12 / 49
13 Example Suppose A = possible and B = [ ] and AB = C, if Since A has order 3 2 and B has order 2 2, it follows that C = AB is defined and the product is a matrix of dimension 3 2. The individual elements of C (e.g., c 11 = a 11 b 11 + a 12 b 21 ) are: c 11 = (1 7) + (2 9) = 25, c 12 = (1 8) + (2 10) = 28, c 21 = (3 7) + (4 9) = 57, c 22 = (3 8) + (4 10) = 64, c 31 = (5 7) + (6 9) = 89, c 32 = = 100. Hence, C = c 11 c 12 c 21 c 22 c 31 c 32 = Note that BA is not defined as elements a 31 = 5 and a 32 = 6 cannot be matched with elements of B.. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 13 / 49
14 Null and Identity Matrix Multiplication The null and identity matrix cases are trivial. The identity matrix plays the role of 1 in the scalar case. Scalar case: Matrix case: [ ] [ ] = 3 1 = 3 [ 4 (1) + 3 (0) 4 (0) + 3 (1) 1 (1) + 2 (0) 1 (0) + 2 (1) ] = [ The null matrix plays the role of zero. As with 3 0 = 0, so, [ ] [ ] [ ] [ (0) + 3 (0) 4 (0) + 3 (0) 0 0 = = (0) + 2 (0) 1 (0) + 2 (0) 0 0 ] ] Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 14 / 49
15 Recap: Rules for Scalars versus Matrices Scalar cases: 1 Commutative; a + b = b + a 2 Associative; (a + b) + c = a + (b + c) and (ab) c = a (bc) 3 Distributive; a (b + c) = ab + ac and (b + c) a = ba + ca Matrix cases: 1 Addition Commutative law; A + B = B + A Associative law; (A + B) + C = A + (B + C ) 2 Multiplication Associative law; (AB) C = A (BC ) Distributive law; A (B + C ) = AB + AC and (B + C ) A = BA + CA Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 15 / 49
16 Transpose of a Matrix The transpose of a matrix A is formed by interchanging the rows and columns of A. If A has order m n, then it s transpose has dimension n m. The transpose of A is generally denoted as A T and sometimes A. If A = A T, then we say that A is a symmetric matrix. [ A ] symmetric 1 3 matrix must be a square matrix (e.g., A = A T = ). 3 1 Transpose of a square matrix: [ ] [ ] a11 a A = 12 A T a11 a = 21 a 21 a 22 a 12 a 22 Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 16 / 49
17 Properties of the Transpose The transpose operation has the following properties. 1 (A T ) T = A [ ] [ (A + B) T = A T + B T. Suppose A = A 1 2 T = 3 2 [ ] [ ] and B = B 5 6 T =. Try this at home (AB) T = B T A T More generally, if we have n-matrices A 1, A 2,..., A n then ] (A 1 A 2... A n ) T = A T n A T n 1... A T 2 A T 1 Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 17 / 49
18 The Inverse of a Square Matrix For a square matrix, A n n, the following is always true: AI n = I n A = A If we can find a matrix B n n satisfying AB = BA = I n, then we say that B is the inverse matrix of A. The inverse matrix of A is denoted A 1. Not all square matrices have inverses. 1 A matrix which has an inverse is called non-singular. 2 A matrix which does not have an inverse is called singular. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 18 / 49
19 The Determinant of a Square Matrix We denote the determinant of A, as A. The determinant of a 1 1 matrix is trivial: it is the number itself. [ ] a11 a The determinant of a 2 2 matrix A = 12 is, a 21 a 22 A = a 11 a 22 a 12 a 21 The procedure for bigger matrices is more complicated. Let A be a n n matrix. Let M ij denote the determinant of the matrix derived from A by deleting the ith row and jth column. Let C ij = ( 1) i+j M ij. We refer to M ij as a minor and C ij as a co-factor. Note: A square matrix A has an inverse if and only if its determinant is non-zero (is non-singular). Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 19 / 49
20 The Determinant of a Square matrix Pick any row or column in the matrix. Suppose we pick the ith row. Then, the determinant of the matrix A is: A = a i1 C i1 + a i2 C i a in C in If we pick the a column, say the jth one, then the determinant is computed as: A = a 1j C 1j + a 2j C 2j a nj C nj Observe that we could have picked any row or column: we will always get the same answer. For practical considerations, we try to pick out a row or column which has the maximum number of zeros. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 20 / 49
21 The Determinant of a Square matrix, 2 by 2 case Suppose we have the following matrix: A = A = (1 4) (2 3) = 2. [ ]. We know Although it s a little trivial, we can relate that to the technique for larger matrices, as a first step. We have, A = (a 11 C 11 ) + (a 12 C 12 ) = [ a 11 ( 1) 1+1 M 11 ] + [ a12 ( 1) 1+2 M 12 ] = a 11 M 11 a 12 M 12 ; M 11 = 4 and M 12 = 3 = a 11 4 a 12 3 = (1 4) (2 3) = 2 Why is this all so easy? In the 2 by 2 case, the M ij s are scalars. If we have a 3 by 3 case, the M ij are 2 by 2 matrices, which we have to work out the determinant of first etc... Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 21 / 49
22 3 by 3 Example Suppose we have the following 3 by 3 matrix, A = Let us compute the determinant by computing the co-factors of the first row. We have, C ij = ( 1) i+j M ij, so, C 11 = ( 1) 1+1 M 11 = ( 1) } {{ } M 11 But we know that M 11 = (8 6) (2 9) = = 30. We conclude that C 11 = 30.. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 22 / 49
23 3 by 3 Example Continued We can do this for the other 2 elements of the row. C 12 = ( 1) = 6 } {{ } =M 12 C 13 = ( 1) = 18 We find, Hence, the determinant, call it for short, is, = a 11 C 11 + a 12 C 12 + a 13 C 13 = a 11 M 11 a 21 M 21 + a 13 M 13 = [1 ( 30)] + (2 6) + (3 18) = 36 We could have chosen any other row or column. If we choose the third column, then we have: C 13 = 18, C 23 = 6, C 33 = 6 and therefore = (3 18) + (6 6) + [9 ( 6)] = 36. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 23 / 49
24 Properties of the Determinant There are some useful properties of determinants (that we won t prove) which can simplify the computation of the determinant significantly. 1 If a row or column of A is multiplied by c, then the determinant of the new matrix is c A. 2 Multiplying a row (column) by a non-zero constant and adding it to another row (column) has no effect on the determinant. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 24 / 49
25 Extended Example with Common Factors Common factors basically involves taking things outside the brackets, as we usually do, except we can use the properties of the determinant Consider the same matrix as before, A = Note that the second row can be written as 2 [ ] = [ ]. We know that multiplying a row by a constant leads the determinant to change by the same factor. It follows, A = Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 25 / 49
26 Example Continued Note that column three also has a common factor of 3, i.e., = It follows that, A = (2 3) = There are now no common factors; however we can now make use of the row and column operations. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 26 / 49
27 Example Continued Since the determinant is not changed by multiplying a row (column) by a constant and adding it to another row (column) we can use this to make some entries in a row or column zeros. Multiplying the first row by 1 and adding it to the second gives, A = What did we do? Well, we started with and we noted, T T T ( 1) = 1, which is the new middle row of A. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 27 / 49
28 Example Continued Similarly, multiplying the first row by 3 and adding it to the third row gives: A = Following the same idea as before, we start out with A = and we note, T T T ( 3) = 2, which is the new bottom row of A. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 28 / 49
29 Example Continued Why did we do all of this? Well, A = is not that easy to compute However, A = is easy to compute, as we can take the cofactors of the third column. In that case, we only have to compute one cofactor since two entries in the column are zero. Therefore, we have, A = 6 [ 1 ( 1) ] = 6 6 = 36 Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 29 / 49
30 Computing the inverse using the determinant We observed before that we can find the inverse of a square matrix A if and only if A = 0. When the determinant exists, it can be shown that the inverse is given by, A 1 = 1 A [c ij] T where [c ij ] is the matrix of cofactors of A. In words, what we do is the following: 1 Replace each element of A by its cofactor. 2 Take the transpose of the matrix. 3 Scalar multiply this matrix by 1/ A. Note: the following is also used, adj (A) [c ij ] T ; it is called the adjunct. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 30 / 49
31 A 2 by 2 Example of Matrix Inversion Consider the following 2 by 2 matrix A = [ We know that A = (3 0) (1 2) = 2. inverse must exist. ]. Since A = 0, an The cofactor matrix (notice how [ easy it is ] in this case, [ again due to ] zeros) is the following; c ij = [c 2 3 ij ] T = 1 3 [ ] [ ] Then, A 1 = 1 A [c ij] T = = Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 31 / 49
32 The Inverse of a Square Matrix Consider the following 2 by 2 matrix: A = matrix have an inverse? [ 1 λ 3 4 ]. Does this We know an inverse only exists if the matrix is non-singular. to hold, we require, A = 0. For this We know that if A = (1 4) (3 λ) = 0 the matrix is singular. That is, we can t find the inverse of A if λ = 4/3. Finding a singularity tends to become a problem is we have very big matrices (say we have a big model) which is relatively sparse (that is, has lots of zeros in it). Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 32 / 49
33 3 by 3 Example Let us compute the inverse of the matrix that we have seen before: A = We already know the following: C 11 = 30, C 12 = 6, C 13 = 18, C 23 = 6, C 33 = 6 A = 36 Recall we can use C 1j s or C i3 s to get here. The remaining cofactors are C 21 = 6, C 22 = 12, C 31 = 6, C 32 = 6. Try this at home. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 33 / 49
34 Matrix Inversion Example Continued Here the matrix of cofactors is, [c ij ] = The transpose is, [c ij ] T = The inverse matrix is, A 1 = 1 A [c ij] T = A = as Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 34 / 49
35 Cramer s Rule Now suppose we have a big linear model. In it s most general specification it is written as a system of linear equations: a 11 x 1 + a 12 x a 1n x n = b =. a n1 x 1 + a n2 x a nn x n = b n This is system of n linear equations in n unknowns. It can be represented compactly in matrix notation as Ax = b where, a a 1n x 1 b 1 A =..., x =., b =.. a n1... a nn x n b n Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 35 / 49
36 Cramer s Rule We note that providing A = 0 (that is, A has an inverse) we can solve for x by just multiplying both sides of the equation Ax = b by A 1 : (A 1 )Ax = (A 1 A)x = I n x = x = A 1 b Cramer s rule is just an alternative formula for this; the advantage of the rule is that we can find each x i individually; this may be useful if we don t want to find the value of all x i. Cramer s Rule states that: x i = A b,i A Here A b,i is the matrix where the ith column of A is replaced by the column vector b. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 36 / 49
37 Examples of solving for a specific variable Consider the system hence the system is solvable. A w y z x = We can compute w independently of y and z as, w = = 48 A 80 = 3 5 Computation of y and z is left as an exercise. b. Here, A = 80; Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 37 / 49
38 Why does Cramer s Rule work? Cramer s Rule is equivalent to finding the inverse of A. To see this more formally, consider the system, a 11 a 12 a 13 w b 1 a 21 a 22 a 33 y = b 2. a 31 a 32 a 33 z b 3 Now note that the inverse of A can be written as, A 1 = 1 A where C ij is the co-factor of a ij. C 11 C 21 C 31 C 12 C 22 C 32 C 13 C 23 C 33 Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 38 / 49
39 Why does Cramer s Rule work? Hence, we have, w y = A 1 b = 1 A z b 1 C 11 + b 2 C 21 + b 3 C 31 b 1 C 12 + b 2 C 22 + b 3 C 32 b 1 C 13 + b 2 C 23 + b 3 C 33 Now note that b 1 C 11 + b 2 C 21 + b 3 C 31 is nothing but the determinant of the matrix where the first column of A has been replaced by the vector b. Similarly, b 1 C 12 + b 2 C 22 + b 3 C 32 is the determinant of the matrix where the second column of A has been replaced by the vector b. You can check that a similar observation holds for b 1 C 13 + b 2 C 23 + b 3 C 33. This shows that the inverse approach and Cramer s rule are identical for a system of three linear equations but this approach can be easily extended. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 39 / 49
40 A Demand and Supply Example Consider a linear model of demand and supply (of ice-creams). 1 Demand for ice-creams depends on the price of ice-creams, the income of individuals and the temperature. 2 The supply of ice-creams also depends on how much the ice-cream company can charge for it s product and how hot it is. q d = γm bp + αt q s = δp ɛt + d If income goes up, demand goes up. If the temperature goes up, demand goes up but supply goes down (some of the ice-cream melts before it is sold). If price goes up, demand falls and supply rises. In equilibrium, q d = q s. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 40 / 49
41 A Demand and Supply Example It is very easy to solve this model. The solution for the price is, p γm+(α+ɛ)t d = δ+b. Higher temperatures result in higher prices as people eat more ice-creams and ice-creams melt, reducing supply. We can also draw the model in (p, q) space and shift the curves. More importantly, we can also represent the model in matrix form. [ ] [ ] [ ] b 1 p γm + αt = δ 1 q d ɛt A Now we need A = b + δ = 0. If we look at p, that makes a lot of economic sense. We can t have an infinite price for ice-cream. Again, we can also use Cramer s rule to solve for shocks to income or temperature. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 41 / 49
42 Demand and Supply The supply and demand example is trivial. However, we might imagine that the entire economy (not just one market) consists of many demand and supply schedules (what we called a big linear model). The demand and supply schedules will probably display some form of interdependence. That is, consider an economy with ice-creams and apples. If the temperature goes up, the demand for apples might drop. Why? Because, with given income, the demand for ice-cream rises. If this is the case, our economy consists of an entire vector of prices and a vector of quantities. We want to know the price and quantities in equilibrium. That turns out to be very complicated. Having a grasp of matrix algebra is then very useful as we want to know if an equilibrium exists. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 42 / 49
43 Returning to the example at the very beginning Consider the macroeconomic model we wrote down at the beginning. C = a + b(1 t)y I = e lr G = Ḡ L = ky hr M = M We want to solve this model to determine the endogenous variables (Y, C, I, R) in terms of the exogenous variables (Ḡ, a, b, t, e, k, h, l, M). We can use all the new tools we have developed to solve the model. We ll focus on solving for consumption as a function of monetary and fiscal policy. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 43 / 49
44 Macro Model Example The equilibrium in this system is determined by the conditions: Y = C + I + Ḡ C = a + b(1 t)y I = e lr M = ky hr We can write the above system in matrix notation as: Y b(1 t) C l I = k 0 0 h R The first thing to do is to compute A which is needed no matter which approach we use to solve this system. We choose one of the rows or columns with the maximum number of zeros since that will simplify the computation. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 44 / 49 Ḡ a e M
45 Example Continued Suppose we choose row 2. We know, = 4 j=1 a 2j C 2j. Then, = b(1 t) C 21 + C 22, as a 22 = 1 and a 23 = a 24 = 0. } {{ } =a21 Also C ij = ( 1) i+j M ij so = 4 j=1 a 2j ( 1) 2+j M 2j. However, it is not as easy as before because the M 2j s are 3 by 3 matrices. We only have two of them, in this case. C 21 = ( 1) l C 22 = ( 1) h l k 0 h Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 45 / 49
46 Example Continued Expanding the 3 3 determinant in the expression for C 21 about the first column (two zero elements), we get, C 21 = [( 1)(1 ( h) 0 l)] = h For C 22 we can expand the 3 3 determinant about the first column (one zero element): C 22 = ( 1) l 0 h + ( 1)3+1 k l = h kl Hence the determinant of the original 4 4 is, = bh(1 t) h kl = h(1 b(1 t)) kl Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 46 / 49
47 Example Continued We can now compute the value of any of the endogenous variables using Cramer s Rule. Suppose we want to compute C. We replace the second column with [ Ḡ a e M ] T. Then, C = 1 A 1 Ḡ 1 0 b(1 t) a e 1 l k M 0 h Computing the determinant of the 4 4 matrix by expanding around the second row, we have = b(1 t) ( 1) 2+1 Ḡ 1 0 e 1 l M 0 h + a ( 1) l k 0 h Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 47 / 49
48 Example Continued The second 3 3 determinant above has already been found. Expanding this about the first 3 3 around the first row, we have, Ḡ 1 0 e 1 l M 0 h = Ḡ ( 1)2 [1 ( h) 0 l] + ( 1) This is (hḡ + he + Ml). ( 1) 3 [e ( h) M l] Hence, = b(1 t) (hḡ + he + Ml) + a (h + kl) = [b(1 t)(hḡ + he + Ml) + a(h + kl)]. It follows that C = b(1 t)(hḡ + he + Ml) + a(h + kl) h(1 b(1 t)) + kl This is all exogenous; and Ḡ, M are policy variables. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 48 / 49
49 Roundup You should now be able to do the following: 1 Add/subtract/multiply matrices. 2 Find the inverse of a matrix and it s determinant (which is basically matrix manipulation). 3 Apply these techniques to standard models and use Cramer s rule to solve for endogenous variables as functions of exogenous variables. Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 49 / 49
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationLecture 2 Matrix Operations
Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or
More informationMulti-variable Calculus and Optimization
Multi-variable Calculus and Optimization Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Multi-variable Calculus and Optimization 1 / 51 EC2040 Topic 3 - Multi-variable Calculus
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationSolution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
More informationSYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms
More informationIntroduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationTypical Linear Equation Set and Corresponding Matrices
EWE: Engineering With Excel Larsen Page 1 4. Matrix Operations in Excel. Matrix Manipulations: Vectors, Matrices, and Arrays. How Excel Handles Matrix Math. Basic Matrix Operations. Solving Systems of
More informationChapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. ( 1 1 5 2 0 6
Chapter 7 Matrices Definition An m n matrix is an array of numbers set out in m rows and n columns Examples (i ( 1 1 5 2 0 6 has 2 rows and 3 columns and so it is a 2 3 matrix (ii 1 0 7 1 2 3 3 1 is a
More informationUnit 18 Determinants
Unit 18 Determinants Every square matrix has a number associated with it, called its determinant. In this section, we determine how to calculate this number, and also look at some of the properties of
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More informationMatrix Differentiation
1 Introduction Matrix Differentiation ( and some other stuff ) Randal J. Barnes Department of Civil Engineering, University of Minnesota Minneapolis, Minnesota, USA Throughout this presentation I have
More informationMatrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
More informationIntroduction to Matrices for Engineers
Introduction to Matrices for Engineers C.T.J. Dodson, School of Mathematics, Manchester Universit 1 What is a Matrix? A matrix is a rectangular arra of elements, usuall numbers, e.g. 1 0-8 4 0-1 1 0 11
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationMATHEMATICS FOR ENGINEERS BASIC MATRIX THEORY TUTORIAL 2
MATHEMATICS FO ENGINEES BASIC MATIX THEOY TUTOIAL This is the second of two tutorials on matrix theory. On completion you should be able to do the following. Explain the general method for solving simultaneous
More information15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More information1.2 Solving a System of Linear Equations
1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables
More informationSolving simultaneous equations using the inverse matrix
Solving simultaneous equations using the inverse matrix 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix
More information7.4. The Inverse of a Matrix. Introduction. Prerequisites. Learning Style. Learning Outcomes
The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a 0 has a reciprocal b written as a or such that a ba = ab =. Similarly a square matrix A may have an inverse B = A where AB =
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationMAT188H1S Lec0101 Burbulla
Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More informationMA106 Linear Algebra lecture notes
MA106 Linear Algebra lecture notes Lecturers: Martin Bright and Daan Krammer Warwick, January 2011 Contents 1 Number systems and fields 3 1.1 Axioms for number systems......................... 3 2 Vector
More information8.2. Solution by Inverse Matrix Method. Introduction. Prerequisites. Learning Outcomes
Solution by Inverse Matrix Method 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix algebra allows us
More information6. Cholesky factorization
6. Cholesky factorization EE103 (Fall 2011-12) triangular matrices forward and backward substitution the Cholesky factorization solving Ax = b with A positive definite inverse of a positive definite matrix
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationMatrices 2. Solving Square Systems of Linear Equations; Inverse Matrices
Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices Solving square systems of linear equations; inverse matrices. Linear algebra is essentially about solving systems of linear equations,
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More information1 Determinants and the Solvability of Linear Systems
1 Determinants and the Solvability of Linear Systems In the last section we learned how to use Gaussian elimination to solve linear systems of n equations in n unknowns The section completely side-stepped
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 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 informationUsing row reduction to calculate the inverse and the determinant of a square matrix
Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More information9 MATRICES AND TRANSFORMATIONS
9 MATRICES AND TRANSFORMATIONS Chapter 9 Matrices and Transformations Objectives After studying this chapter you should be able to handle matrix (and vector) algebra with confidence, and understand the
More informationLecture 4: Partitioned Matrices and Determinants
Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying
More information2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
More informationLinear Algebra Review. Vectors
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length
More information[1] Diagonal factorization
8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:
More informationTo give it a definition, an implicit function of x and y is simply any relationship that takes the form:
2 Implicit function theorems and applications 21 Implicit functions The implicit function theorem is one of the most useful single tools you ll meet this year After a while, it will be second nature to
More informationChapter 19. General Matrices. An n m matrix is an array. a 11 a 12 a 1m a 21 a 22 a 2m A = a n1 a n2 a nm. The matrix A has n row vectors
Chapter 9. General Matrices An n m matrix is an array a a a m a a a m... = [a ij]. a n a n a nm The matrix A has n row vectors and m column vectors row i (A) = [a i, a i,..., a im ] R m a j a j a nj col
More informationEigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
More informationNotes on Orthogonal and Symmetric Matrices MENU, Winter 2013
Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,
More informationLinear Algebra Notes
Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note
More information8.1. Cramer s Rule for Solving Simultaneous Linear Equations. Introduction. Prerequisites. Learning Outcomes. Learning Style
Cramer s Rule for Solving Simultaneous Linear Equations 8.1 Introduction The need to solve systems of linear equations arises frequently in engineering. The analysis of electric circuits and the control
More information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationA linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form
Section 1.3 Matrix Products A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form (scalar #1)(quantity #1) + (scalar #2)(quantity #2) +...
More informationLecture 5: Singular Value Decomposition SVD (1)
EEM3L1: Numerical and Analytical Techniques Lecture 5: Singular Value Decomposition SVD (1) EE3L1, slide 1, Version 4: 25-Sep-02 Motivation for SVD (1) SVD = Singular Value Decomposition Consider the system
More informationLinear Algebra: Determinants, Inverses, Rank
D Linear Algebra: Determinants, Inverses, Rank D 1 Appendix D: LINEAR ALGEBRA: DETERMINANTS, INVERSES, RANK TABLE OF CONTENTS Page D.1. Introduction D 3 D.2. Determinants D 3 D.2.1. Some Properties of
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More information3.1. Solving linear equations. Introduction. Prerequisites. Learning Outcomes. Learning Style
Solving linear equations 3.1 Introduction Many problems in engineering reduce to the solution of an equation or a set of equations. An equation is a type of mathematical expression which contains one or
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More informationSimilar matrices and Jordan form
Similar matrices and Jordan form We ve nearly covered the entire heart of linear algebra once we ve finished singular value decompositions we ll have seen all the most central topics. A T A is positive
More informationBrief Introduction to Vectors and Matrices
CHAPTER 1 Brief Introduction to Vectors and Matrices In this chapter, we will discuss some needed concepts found in introductory course in linear algebra. We will introduce matrix, vector, vector-valued
More informationv w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors.
3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with
More informationCS3220 Lecture Notes: QR factorization and orthogonal transformations
CS3220 Lecture Notes: QR factorization and orthogonal transformations Steve Marschner Cornell University 11 March 2009 In this lecture I ll talk about orthogonal matrices and their properties, discuss
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationChapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
More informationLecture Notes 2: Matrices as Systems of Linear Equations
2: Matrices as Systems of Linear Equations 33A Linear Algebra, Puck Rombach Last updated: April 13, 2016 Systems of Linear Equations Systems of linear equations can represent many things You have probably
More information5 Homogeneous systems
5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m
More informationAbstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).
MAT 2 (Badger, Spring 202) LU Factorization Selected Notes September 2, 202 Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix
More informationMatrix algebra for beginners, Part I matrices, determinants, inverses
Matrix algebra for beginners, Part I matrices, determinants, inverses Jeremy Gunawardena Department of Systems Biology Harvard Medical School 200 Longwood Avenue, Cambridge, MA 02115, USA jeremy@hmsharvardedu
More informationMATH 551 - APPLIED MATRIX THEORY
MATH 55 - APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationEquations, Inequalities & Partial Fractions
Contents Equations, Inequalities & Partial Fractions.1 Solving Linear Equations 2.2 Solving Quadratic Equations 1. Solving Polynomial Equations 1.4 Solving Simultaneous Linear Equations 42.5 Solving Inequalities
More informationCURVE FITTING LEAST SQUARES APPROXIMATION
CURVE FITTING LEAST SQUARES APPROXIMATION Data analysis and curve fitting: Imagine that we are studying a physical system involving two quantities: x and y Also suppose that we expect a linear relationship
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationOperation Count; Numerical Linear Algebra
10 Operation Count; Numerical Linear Algebra 10.1 Introduction Many computations are limited simply by the sheer number of required additions, multiplications, or function evaluations. If floating-point
More informationProperties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More information26. Determinants I. 1. Prehistory
26. Determinants I 26.1 Prehistory 26.2 Definitions 26.3 Uniqueness and other properties 26.4 Existence Both as a careful review of a more pedestrian viewpoint, and as a transition to a coordinate-independent
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationSOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
More informationA Primer on Index Notation
A Primer on John Crimaldi August 28, 2006 1. Index versus Index notation (a.k.a. Cartesian notation) is a powerful tool for manipulating multidimensional equations. However, there are times when the more
More informationF Matrix Calculus F 1
F Matrix Calculus F 1 Appendix F: MATRIX CALCULUS TABLE OF CONTENTS Page F1 Introduction F 3 F2 The Derivatives of Vector Functions F 3 F21 Derivative of Vector with Respect to Vector F 3 F22 Derivative
More information9.4. The Scalar Product. Introduction. Prerequisites. Learning Style. Learning Outcomes
The Scalar Product 9.4 Introduction There are two kinds of multiplication involving vectors. The first is known as the scalar product or dot product. This is so-called because when the scalar product of
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationLecture notes on linear algebra
Lecture notes on linear algebra David Lerner Department of Mathematics University of Kansas These are notes of a course given in Fall, 2007 and 2008 to the Honors sections of our elementary linear algebra
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationChapter 2 Determinants, and Linear Independence
Chapter 2 Determinants, and Linear Independence 2.1 Introduction to Determinants and Systems of Equations Determinants can be defined and studied independently of matrices, though when square matrices
More informationQuestion 2: How do you solve a matrix equation using the matrix inverse?
Question : How do you solve a matrix equation using the matrix inverse? In the previous question, we wrote systems of equations as a matrix equation AX B. In this format, the matrix A contains the coefficients
More informationInner products on R n, and more
Inner products on R n, and more Peyam Ryan Tabrizian Friday, April 12th, 2013 1 Introduction You might be wondering: Are there inner products on R n that are not the usual dot product x y = x 1 y 1 + +
More informationAu = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
More information