MATH2640 Introduction to Optimisation
|
|
- Gervase Sherman
- 7 years ago
- Views:
Transcription
1 MATH640 Introduction to Optimisation 3 Quadratic forms and Eigenvalues, Economic applications, Constrained Optimisation, Lagrange Multipliers, Bordered Hessians : summary 3(A Quadratic forms and eigenvalues (i Eigenvalues are the solutions, λ, of the matrix equation Ax = λx (31 In general, an n n matrix has n eigenvalues, though there may be less than n in special cases The vectors x satisfying this equation are called the eigenvectors For each eigenvalue λ there is a corresponding eigenvector x (ii case The quadratic form associated with the symmetric matrix ( a b is Q(x, y = (x y ( ( a b x = ax b c b c y + bxy + y To find the eigenvalues, we write equation (31 as (A λix = 0, where I is the unit (identity matrix Then for this to have nontrivial solutions, a λ b b c λ = 0, so λ (a + cλ + ac b = 0 is the quadratic equation whose solutions are the two eigenvalues of the matrix A These eigenvalues are always real for a symmetric matrix (iii The same methods work for an n n symmetric matrix A Quadratic forms are always associated with symmetric matrices, where A ij = A ji, and symmetric matrices always have real eigenvalues If there are n distinct eigenvalues then the eigenvectors of a symmetric matrix are always orthogonal to each other, x i x j = 0 for any i j, with i and j lying between 1 and n (iv Rules for classifying quadratic forms using the eigenvalue method If all eigenvalues are > 0, Q is positive definite (PD If all eigenvalues are < 0, Q is negative definite (ND If some eigenvalues are 0 and some are 0, Q is indefinite (I If all eigenvalues are 0, Q is positive semi-definite (PSD If all eigenvalues are 0, Q is negative semi-definite (NSD (v Normalising eigenvectors To find the eigenvector corresponding to a particular eigenvalue, solve (A λix = 0 for that value of λ You can only solve these equations up to an arbitrary constant k Example: ( has eigenvalues λ = and λ = 4 To find eigenvector corresponding to λ =, solve x 1 + x = 0 x 1 + x = 0 giving (k, k as the eigenvector To normalise this, choose k so that (k, k has unit length, k = 1, so the normalised eigenvector is (1/, 1/ The normalised eigenvector corresponding to λ = 4 is (1/, 1/ (vi Normal forms When the normalised eigenvectors corresponding to the n eigenvalues λ (1, λ (, λ (n, are found, (y (1 1, y(1, y(1 n ; (y ( 1, y(,, y( n, etc then the quadratic form Q can be written as a sum of squares, Q = λ (1 (x 1 y (1 1 + x y (1 + + λ ( (x 1 y ( 1 + x y ( + + which is said to be the normal form of the quadratic form Q For the above example, Q = 3x 1 + x 1 x + 3x = ( x 1 x + 4( x 1 + x Check this by multiplying it out Its now obvious that positive eigenvalues make Q positive definite
2 3(B Unconstrained Optimisation in Economics (i Production functions A firm produces Q items per year, which sell at a price p per item The Revenue, R = pq Q depends on quantities x 1, x, etc which are quantities such as the number of employees, amount spent on equipment, and so on The vector (x 1, x,, x n is called the input bundle vector The Cost function measures how much a firm spends on production, and this will also be a function of x 1, x and so on The profit, Π = R C = pq(x 1, x,, x n C(x 1, x,, x n To maximise the profit, we find the maximum of Π as a function of the inputs x 1,, x n, leading to p Q = C, i = 1, n Problems where a firm produces several different products can also lead to optimisation problems (ii The discriminating monopolist A monopolist produces two products at a rate Q 1 and Q The price obtained is not constant, but reduces if the monopolist floods the market, so p 1 = a 1 b 1 Q 1, and p = a b Q, are the prices for the two products The Cost function is taken as C = c 1 Q 1 + c Q, being simply proportional to the quantity produced The profit Π = R C = p 1 Q 1 + p Q c 1 Q 1 c Q = (a 1 c 1 Q 1 + (a c Q b 1 Q 1 b Q so there is a best choice of Q 1 and Q to maximise profit, when Π Q1 = (a 1 c 1 b 1 Q 1 = 0, and Π Q = (a c b Q = 0 Inspection of the Hessian shows that Π has a maximum here provided b 1 and b are positive We then also require a 1 c 1 and a c The monopolist then has a profit maximising strategy allowing discrimination between the amounts of the two products to be produced The same approach can be used when the cost function or the pricing is a more complicated function of the Q i (iii The Cobb-Douglas production function A commonly used model in microeconomics is the Cobb-Douglas production function Q(x 1, x = x a 1 xb, where a > 0, b > 0 The input bundle here is then just a two-dimensional vector, and we assume here the price p is independent of Q, unlike in the monopolist problem If the Cost is linear in the input bundle, C = w 1 x 1 + w x, then the Profit Π = px a 1x b w 1 x 1 w x and the conditions for a stationary point are apx a 1 1 x b = w 1, bpx a 1x b 1 = w giving positive critical values x 1 = apq /w 1 and x = bpq /w, where Q is the production function at the critical value We want to know when this stationary value is a maximum, so we must examine the Hessian ( a(a 1px a H = 1 x b abpx a 1 1 x b 1 abpx a 1 1 x b 1 b(b 1px a 1 xb which is negative definite provided LP M 1 = a(a 1px a 1 x b < 0 and LP M = ab(1 a bp x1 a x b > 0, which requires 0 < a < 1 and 0 < b < 1 and a + b < 1 If these conditions are satisfied, then the Cobb-Douglas production function gives a profit maximising strategy If they are not satisfied, the profit increases indefinitely as x 1 and x get very large This is possible economic behaviour: if there is no profit maximising strategy, all it means is that the bigger the firm the more profit it makes, which is of course entirely possible
3 3(C Constrained Optimisation: Lagrange multipliers Normally, economic activity is constrained, eg expenditure is constrained by available income The constraints are applied to the input bundle, and may take many different forms Often constraints are in the form of inequalities, eg we can spend up to so much on equipment but no more However, it is often simpler to solve problems with equality constraints, eg we are allowed to spend 1000 pounds on equipment, and we will spend it all, so the equipment expenditure x 1 = 1000 is an equality constraint In general, we are trying to maximise the objective function f(x 1, x,, x n subject to the k inequality constraints g i (x 1, x,, x n b i, 1 i k and subject to the M equality constraints h i (x 1, x,, x n c i, 1 i m (i Single Equality constraint Maximise f(x subject to h(x = c At a stationary point of this problem, the constraint surface must touch the level surfaces of f To see this, note that if dx is a small displacement from the critical point x, then if the small displacement lies in the constraint surface dx h = 0 But if this displacement is at a critical point, f must not change as we move from x to x + dx, so we must have dx f = 0 also Since this has to true for all small displacements on the constraint surface, h is parallel to f at x When two vectors are parallel, there is a constant λ such that f = λ h, or (f λh = 0 The constant λ is called the Lagrange multiplier L = f λh is called the Lagrangian To find the stationary (critical points of f(x subject to h(x c = 0, we solve the n + 1 equations f λ h = 0, i = 1, n h(x = c, for the n + 1 unknowns x 1, x x n, λ As usual, we must be very careful to get all the solutions of these n + 1 equations, and not to miss some (or include bogus solutions Example: Maximise f(x, y = xy subject to h(x, y = x + 4y 16 = 0 Solution: The Lagrangian L = f λh = xy λ(x + 4y 16 The equations we need are L x = 0, or y λ = 0 (A L y = 0, or x 4λ = 0 (B x + 4y = 16 The only critical point is x = 8, y = and λ = At this point, f = 16, and this is the maximum value of f subject to this constraint Strictly speaking, we don t yet know its a maximum, because we have not examined the Hessian (see the section on Bordered Hessians below However, if we look at other values of x and y that satisfy the constraint, such as x = 0, y = 4, we see they give lower values of f, which strongly suggests that the critical point is a maximum (ii The non-degenerate constraint qualification, NDCQ The above algorithm for finding stationary points normally works well, but the argument breaks down if h = 0 at the critical point In this case, the constraint surface doesn t a uniquely defined normal, so we can t say that f must be parallel to h We should therefore check that at each critical point we find the constraint qualification, usually called the non-degenerate constraint qualification NDCQ holds, ie h 0 at each critical point What happens if it doesn t hold, ie h = 0 at the critical point? Usually the Lagrange equations can t be solved Example: Maximise f = x subject to h = x 3 + y = 0 Solution: L = x λ(x 3 + y, so L x = 0 and L y = 0 give 1 = 3λx, (A; λy = 0, (B; x 3 = y (C (C
4 From (A, λ 0, so from (B, y = 0 Then from (C, x = 0 x = y = 0 is actually the maximising point, as we can see from the constraint (C, as y must be 0, so x 0, so f = 0 is the largest value of f However, x = y = 0 is not a well-defined solution of (A, (B and (C because if x = 0 equation (A reads 1 = 0! The problem is that h = (3x, y happens to be zero at the critical point (0, 0 so the NDCQ is not satisfied at this critical point If the NDCQ constraint is not satisfied at the critical point, we have to use a different method to find the maximum, other than Lagrange s method In this simple problem, we could just eliminate x using the constraint, so x = ( y 1/3, and sketch f = ( y 1/3 as a function of y to find the minimum In general, however, the problem is much more difficult if the NDCQ is not satisfied (iii Several equality constraints If we have m equality constraints, h i (x c i = 0, 1 i m, then we need m Lagrange multipliers, and the Lagrangian L is Then the n + m equations to be solved are L = f λ 1 h 1 λ h λ m h m L = 0, i = 1, n h i (x = c i, i = 1, m, for the n + m unknowns x 1,, x n and λ 1,, λ m If any constraint is simple, it may well be easier to use that constraint to eliminate a variable before finding the stationary points Example: Maximise f = x + y + z subject to the constraints x + y = 1 and z = Solution: Just using the general Lagrange method mechanically, and the five equations we need to solve are L = x + y + z λ 1 (x + y λ (z 1 λ 1 x = 0, 1 λ 1 y = 0, 1 λ = 0, x + y = 1, z = It is easily seen that the two solutions are x = 1/, y = 1/, z =, λ 1 = 1/, λ = 1 and x = 1/, y = 1/, z =, λ 1 = 1/, λ = 1 However, it is much simpler to use z = to eliminate z and just maximise f = x+y+ subject to x +y = 1, which only requires three equations for three unknowns, and gives the same answer more quickly If there are several inequality constraints, the non-degenerate constraint qualification, NDCQ, is that the m rows of the Jacobian derivative matrix, h 1 h 1 x n x 1 h m x 1 are linearly independent, that is that none of the rows can be expressed as a linear combination of the other rows If this is the case, we say the Jacobian derivative matrix is of rank m 3(D Constrained Optimisation: Second order conditions The Lagrange multiplier method gives the first order conditions that determine the stationary points, and we can sometimes tell whther the stationary point is a maximum or a minimum without examining the Hessian Matrix In more complicated examples, we need to a method to determine whether a stationary point is a local maximum or a local minimum, or neither Note that having the constraint completely changes the nature of the quadratic expression For example Q(x, y = x y is indefinite, but if we apply the constraint y = 0 then Q(x, y = Q(x, 0 = x which is positive definite and has a local minimum at x = y = 0 We must therefore replace our Leading Principal Minor test with something else The Lagrangian is L = f λ 1 h 1 λ h,, λ m h m, with h 1 = c 1,, h m = c m being the constraints Suppose we have a stationary point at x with Lagrange multipliers λ i, Using the Taylor series, h m x n, L(x + dx = L(x + dx L + 1 dxt Hdx + higher order terms
5 The term dx L = 0 at a stationary point, because at the stationary points L = 0 So the stationary point is a minimum if dx T Hdx > 0 and a maximum if dx T Hdx < 0 Here H is the Hessian based on the second derivatives of the Lagrangian, so the i, j component is L xix j = L = (f λ 1 x j x h 1 λ h + j Now the allowed displacements dx are restricted by the constraints to satisfy dx h i = 0 for every constraint i = 1, m Replacing dx by x, and h i by its value u i at the stationary point, the problem becomes classify the quadratic form Q = x T Hx, subject to u i x = 0 i = 1, m (i with one linear constraint Note that Q(x, y = x y is indefinite, but if we apply the constraint y = 0, ie u = (0, 1, then Q = x which is positive definite So a constraint can change the classification of Q from indefinite to definite In general, Q(x, y = ax + bxy + cy, with ux + vy = 0 Eliminate y by setting y = ux/v to get Q(x = x v (av buv + cu which is positive definite (minimum if (av buv + cu > 0, and negative definite (maximum if (av buv + cu < 0 (ii Bordered Hessians If we have an n variable Lagrangian with m constraints, then the Bordered Hessian is an (n + m (n + m matrix constructed as follows: ( 0 B H B = B T H where the B part has m rows and n columns, with the rows consisting of the constraint vectors u i, i = 1, m, and the H part is the Hessian based on the Lagrangian In the case where m =, n = 3 and the two constraints are u 1 x + u y + u 3 z = 0, v 1 x + v y + v 3 z = 0, (u 1, u, u 3 being h 1 and (v 1, v, v 3 being h, both evaluated at stationary point, the 5 5 Bordered Hessian matrix is 0 0 u 1 u u v 1 v v 3 H B = u 1 v 1 L xx L xy L xz u v L xy L yy L yz u 3 v 3 L xz L yz L zz where L xx = f xx λ 1h 1xx λ h xx, and the other components of the Hessian are defined similarly (iii Rules for classification using Bordered Hessians We need to classify Q = x T Hx, subject to u i x = 0, i = 1, m Construct the bordered Hessian as defined above, and evaluate the leading principal minors We only need the last (n m LPM s, starting with LP M m+1 and going up to (and including LP M n+m LP M n+m is just the determinant of the whole H B matrix (A Q is positive definite (PD if sgn(lp M n+m = sgn(det H B = ( 1 m and the successive LPM s have the same sign Here sgn means the sign of, so eg sgn( = 1 This case corresponds to a local minimum (B Q is negative definite (ND if sgn(lp M n+m = sgn(det H B = ( 1 n and the successive LPM s from LP M m+1 to LP M n+m alternate in sign This case corresponds to a local maximum (C If both (A and (B are violated by non-zero LPM s, then Q is indefinite The semi-definite conditions are very involved, and we don t go into them here
6 Example: If n = and m = 1, then n m = 1 and we only need examine LP M 3 Suppose this is LP M 3 = 1 Then this has the same sign as ( 1 m, and so the constrained Q is positive definite Check: if Q = x y and the constraint is y = 0, so u = (0, 1, the bordered Hessian is H B = which has LP M 3 = deth B = 1, and Q(x, 0 = x which is indeed positive definite Example: Q = x y z with constraint x = 0, so now u = (1, 0, 0 Now n = 3 and m = 1 we only need examine LP M 4 and LP M 3 H B = LP M 4 = 1, and LP M 3 = 1 These alternate in sign there is a possibility the constrained quadratic is negative definite To test this against criterion (B note LP M 4 = 1 which has the same sign as ( 1 n, and so the constrained Q is negative definite Check: if Q = x y z and the constraint is x = 0, then Q = y z which is clearly negative definite (iv Evaluating determinants Evaluating and 3 3 determinants is straightforward, but evaluating larger determinants can be difficult The definition is det ( 1 h A 1r1 A r A nrn where the summation is made over all permutations r 1 r r 3,, r n A permutation is just the numbers 1 to n written in a different order, eg [1 3 ] is a permutation on the first 3 integers and corresponds to r 1 = 1, r = 3 and r 3 = Permutations are either odd or even If it takes an odd number of interchanges to restore the permutation to its natural order, the permutation is odd If it takes an even number, the permutation is even In the formula for the determinant, h = 1 if the permutation is odd, h = if it is even So [ 3 4 1] is an odd permutation, as we must first swap and 1, then and 3, and then 3 and 4, three swaps altogether Since three is an odd number of swaps, the permutation is odd Other useful facts for evaluating determinants are (i Swapping any two rows or any two columns reverses the sign of the determinant (ii Adding any multiple of another row to a row leaves the determinant unchanged Similarly adding any multiple of a column to a different column leaves it unchanged using this trick, it is usually simple to generate zero elements which makes evaluating the determinant easier APPENDIX How were the tests for the constrained quadratic forms derived? This appendix can be omitted on first reading, as the most important issue is what the tests are and how to apply them However, there is a way to understand where these tests come from in terms of elementary row and column operations (ERCO s These also explain where the leading principal minor (LPM tests for the unconstrained quadratic forms come from An elementary row and column operation, ERCO, acts on a symmetric matrix and removes a pair of elements a ij and a ji from the matrix by subtracting appropriate multiples of a row and a column To illustrate, consider the 4 4 matrix a 11 a 1 a 13 a 14 a 1 a a 4 a 13 a 33 a 34 a 14 a 4 a 34 a 44 We want to remove the elements a 4 from row, column 4 and row 4, column using the elements and a 3 Because the matrix is symmetric it is the same element in both placesto remove a 4 from row, column 4, multiply column 3 by a 4 / and subtract it from column 4 This gives A = (a a 1 a 3 0 a 13 a 33 (a 34 a4a33 a 14 a 4 a 34 (a 44 a4a34
7 This process can be written as a matrix multiplication A U = A or a 11 a 1 a 13 (a 14 a4a a 1 a a 13 a 33 (a 34 a4a33 a a a 14 a 4 a 34 (a 44 a4a34 = a 11 a 1 a 13 a 14 a 1 a a 4 a 13 a 33 a 34 a 14 a 4 a 34 a 44 The matrix U on the right is a unit upper triangular matrix, because it has zeros below the leading diagonal and ones along the leading diagonal Multiply this out yourself to check it really works! To remove the a 4 from row 4, column, multiply row 3 by a 4 / and subtract it from row 4 This is equivalent to the matrix multiplication U T à = A or a 4 1 (a a 1 a 3 0 a 13 a a4a33 ( ( ( (a a 14 a4a13 0 a 34 a4a33 a 44 a4a34 = a 11 a 1 a 13 a 14 a4a13 a 1 a 0 a 13 a 33 a 34 a4a33 a 14 a 4 a 34 a 44 a4a34 So the whole ERCO process is equivalent to writing U T ÃU The important points are that U is a unit upper triangular matrix, so U T is a unit lower triangular matrix, and à has zeros where the elements where in A There are two key properties of ERCO operations (i The product of two unit upper triangular matrices is another unit upper triangular matrix This means if we do two successive ERCO operations, we end up with U T U 1 T ÃU 1U = V T ÃV for some unit upper triangular matrix V In fact, we can going on removing pairs of elements as often as we want, and still end up with V T ÃV (ii Removing a multiple of a row from another row, or a multiple of a column from another column, leaves the determinant of the matrix unchanged This a standard result from the theory of determinants Indeed, it also leaves all the leading principal minors, as defined in D(ii, unchanged This result can easily be verified for a 3 3 determinant, and the extension to the n n case is straightforward It follows that an ERCO operation leaves the leading principal minors unchanged, ie the LPM s of A and à are all the same Now we apply this ERCO process to our bordered Hessian We take the case m =, n = 4 so there are two constraints and four variables, so that our bordered Hessian is u 1 x 1 + u x + u 3 x 3 + u 4 x 4 = 0, v 1 x 1 + v x + v3x 3 + v4x 4 = 0, 0 0 u 1 u u 3 u v 1 v v 3 v 4 u 1 v 1 a 11 a 1 a 13 a 14 u v a 1 a a 4 u 3 v 3 a 13 x a 33 a 34 u 4 v 4 a 14 a 4 a 34 a 44 First we remove u, u 3 and u 4 by using the ERCO operations based on u 1 to write U T ÃU giving u v 1 v v 3 v u 1 v 1 a 11 a 1 a 13 a u /u 1 u 3 /u 1 u 4 /u u /u u v a 1 a a u 3 /u u 3 v 3 a 13 a 33 a u 4 /u a 1 u 4 v 4 a 14 a 4 a 34 a If u 1 happened to be zero, we would need to reorder the variables so that a non-zero element is brought into the u 1 position Since the constraint has to be non-trivial this must be possible Note that the U matrix applied to the vector (0, 0, x 1, x, x 3, x 4 T gives Ux = u /u 1 u 3 /u 1 u 4 /u x 1 + u x /u 1 + u 3 x 3 /u 1 + u 4 x 4 /u 1 //x x 3 x 4 = x,
8 When we apply the first row of à to x we get zero because of the constraint, and the same is true of x T applied to the first column of à Now we use the v element to remove v 1, v 3 and v 4 If m > we would continue until every row and column of the border just has one non-zero element in it If v happened to be zero, we would again reorder the variables from x to x n to bring a non-zero element into the v position If the only non-zero element in row of à is v 1, then the second constraint is linearly dependent on the first constraint, so its not really a second constraint In this case the NDCQ won t hold (see 3C(iii The matrix A now has the form U T BU = A with B of the form B = 0 0 u v 0 0 u 1 0 a 11 a 1 a 13 a 14 0 v a 1 a a a 13 a 33 a a 14 a 4 a 34 a 44 At this stage we can check that just as applying the first row of à to x gave zero because of the constraint, so applying the second row of B to Ux also gives zero The next step is to remove all the off-diagonal elements of the type a ij elements using a ij /a ii multiples of the ith row and column This reduces the matrix to the form U T CU = A with C of the form C = 0 0 u v 0 0 u 1 0 a v 0 a a a 44 Now we get the matrix into its final form by removing the a 11 and a elements using u 1 and v respectively In general, this means that a 11 to a mm are removed Then we swap columns 1 and 3, and columns and 4 Every time we swap a row we change the sign of the determinant and the principal minors, so this process multiplies the determinants and minors by a factor ( 1 m After this swap the matrix now has the form U T DU = A with D = u v u v a a 44 The determinant of D is simply LP M 6 = u 1 v a 33a 44 The next lowest principal minor is LP M 5 = u 1 v a 33 Now the U matrix applied to the vector x = (0, 0, x 1, x, x 3, x 4 T gives y = Ux Because of the swap of rows 1 and 3, and and 4, the third and fourth elements of y are zero, and the first element is x 1 + x u /u 1 + x 3 u 3 /u 1 + x 4 u 4 /u 1 which when multiplied by D 11 gives zero from the constraint equation Similarly, D times the second element y is zero, so that y T Dy = x T Ax = a 33 y 3 + a 44y 4 The elements y 3 and y 4 are linear combinations of x 1 x 4 The quadratic form x T Ax is therefore positive definite if a 33 and a 44 are positive This is the case if LP M 5 and LP M 6 are both positive However, LP M 6 and LP M 5 are the LPM s of D, which are ( 1 m times the LPM s of A So the test on the original matrix A to be positive definte is that LP M 5 and LP M 6, the LPM s of A, both have the same sign as ( 1 m Similarly, if a 33 and a 44 are both negative in D, then the quadratic form is negative definite This requires the LPM s of D to have alternating signs, with LP M 1 < 0 This means that LP M n+m, the determinant of D, must have sign ( 1 n+m, and so LP M n+m, the determinant of A, must have sign ( 1 n+m ( 1 m = ( 1 n So the condition for negative definiteness is that the LPM s of A must alternate in sign, and the last one, the determinant of A, must have the same sign as ( 1 n These are just the rules in 3D(iii The quadratic form is semi-definite but not definite if one of a 33 or a 44 is zero The same argument holds if there are no constraints, ie m = 0 Then we skip the elimination of the u i and v i, and obtain the results in D(ii directly CAJ /11/005
SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA
SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA This handout presents the second derivative test for a local extrema of a Lagrange multiplier problem. The Section 1 presents a geometric motivation for the
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 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 informationMATRIX 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 informationLecture 5 Principal Minors and the Hessian
Lecture 5 Principal Minors and the Hessian Eivind Eriksen BI Norwegian School of Management Department of Economics October 01, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 5 Principal Minors and
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 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 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 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 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 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 informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
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 informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8
Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e
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 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 informationConstrained optimization.
ams/econ 11b supplementary notes ucsc Constrained optimization. c 2010, Yonatan Katznelson 1. Constraints In many of the optimization problems that arise in economics, there are restrictions on the values
More information3. Let A and B be two n n orthogonal matrices. Then prove that AB and BA are both orthogonal matrices. Prove a similar result for unitary matrices.
Exercise 1 1. Let A be an n n orthogonal matrix. Then prove that (a) the rows of A form an orthonormal basis of R n. (b) the columns of A form an orthonormal basis of R n. (c) for any two vectors x,y R
More informationEigenvalues and Eigenvectors
Chapter 6 Eigenvalues and Eigenvectors 6. Introduction to Eigenvalues Linear equations Ax D b come from steady state problems. Eigenvalues have their greatest importance in dynamic problems. The solution
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationPartial Fractions Examples
Partial Fractions Examples Partial fractions is the name given to a technique of integration that may be used to integrate any ratio of polynomials. A ratio of polynomials is called a rational function.
More informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
More informationPolynomial Invariants
Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More information1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
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 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 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 information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More informationMATHEMATICS FOR ENGINEERING BASIC ALGEBRA
MATHEMATICS FOR ENGINEERING BASIC ALGEBRA TUTORIAL 3 EQUATIONS This is the one of a series of basic tutorials in mathematics aimed at beginners or anyone wanting to refresh themselves on fundamentals.
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 informationMore Quadratic Equations
More Quadratic Equations Math 99 N1 Chapter 8 1 Quadratic Equations We won t discuss quadratic inequalities. Quadratic equations are equations where the unknown appears raised to second power, and, possibly
More information(a) We have x = 3 + 2t, y = 2 t, z = 6 so solving for t we get the symmetric equations. x 3 2. = 2 y, z = 6. t 2 2t + 1 = 0,
Name: Solutions to Practice Final. Consider the line r(t) = 3 + t, t, 6. (a) Find symmetric equations for this line. (b) Find the point where the first line r(t) intersects the surface z = x + y. (a) We
More informationLinear and quadratic Taylor polynomials for functions of several variables.
ams/econ 11b supplementary notes ucsc Linear quadratic Taylor polynomials for functions of several variables. c 010, Yonatan Katznelson Finding the extreme (minimum or maximum) values of a function, is
More informationReview Jeopardy. Blue vs. Orange. Review Jeopardy
Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 0-3 Jeopardy Round $200 How could I measure how far apart (i.e. how different) two observations, y 1 and y 2, are from each other?
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
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 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 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 informationMATH 10034 Fundamental Mathematics IV
MATH 0034 Fundamental Mathematics IV http://www.math.kent.edu/ebooks/0034/funmath4.pdf Department of Mathematical Sciences Kent State University January 2, 2009 ii Contents To the Instructor v Polynomials.
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 informationAdding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors
1 Chapter 13. VECTORS IN THREE DIMENSIONAL SPACE Let s begin with some names and notation for things: R is the set (collection) of real numbers. We write x R to mean that x is a real number. A real number
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 informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
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 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 informationThe Determinant: a Means to Calculate Volume
The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are
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 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 informationFactorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
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 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 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 information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
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 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 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 informationConstrained Optimisation
CHAPTER 9 Constrained Optimisation Rational economic agents are assumed to make choices that maximise their utility or profit But their choices are usually constrained for example the consumer s choice
More informationDetermine If An Equation Represents a Function
Question : What is a linear function? The term linear function consists of two parts: linear and function. To understand what these terms mean together, we must first understand what a function is. The
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationLecture 1: Systems of Linear Equations
MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables
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 informationDeriving Demand Functions - Examples 1
Deriving Demand Functions - Examples 1 What follows are some examples of different preference relations and their respective demand functions. In all the following examples, assume we have two goods x
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
More information7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
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 informationReview of Fundamental Mathematics
Review of Fundamental Mathematics As explained in the Preface and in Chapter 1 of your textbook, managerial economics applies microeconomic theory to business decision making. The decision-making tools
More informationconstraint. Let us penalize ourselves for making the constraint too big. We end up with a
Chapter 4 Constrained Optimization 4.1 Equality Constraints (Lagrangians) Suppose we have a problem: Maximize 5, (x 1, 2) 2, 2(x 2, 1) 2 subject to x 1 +4x 2 =3 If we ignore the constraint, we get the
More informationThe Point-Slope Form
7. The Point-Slope Form 7. OBJECTIVES 1. Given a point and a slope, find the graph of a line. Given a point and the slope, find the equation of a line. Given two points, find the equation of a line y Slope
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 informationr (t) = 2r(t) + sin t θ (t) = r(t) θ(t) + 1 = 1 1 θ(t) 1 9.4.4 Write the given system in matrix form x = Ax + f ( ) sin(t) x y 1 0 5 z = dy cos(t)
Solutions HW 9.4.2 Write the given system in matrix form x = Ax + f r (t) = 2r(t) + sin t θ (t) = r(t) θ(t) + We write this as ( ) r (t) θ (t) = ( ) ( ) 2 r(t) θ(t) + ( ) sin(t) 9.4.4 Write the given system
More informationDERIVATIVES AS MATRICES; CHAIN RULE
DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we
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 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 information1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style
Factorisation 1.5 Introduction In Block 4 we showed the way in which brackets were removed from algebraic expressions. Factorisation, which can be considered as the reverse of this process, is dealt with
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 informationSolution of Linear Systems
Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
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 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 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 information1 3 4 = 8i + 20j 13k. x + w. y + w
) Find the point of intersection of the lines x = t +, y = 3t + 4, z = 4t + 5, and x = 6s + 3, y = 5s +, z = 4s + 9, and then find the plane containing these two lines. Solution. Solve the system of equations
More informationMore than you wanted to know about quadratic forms
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences More than you wanted to know about quadratic forms KC Border Contents 1 Quadratic forms 1 1.1 Quadratic forms on the unit
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationLinear Equations and Inequalities
Linear Equations and Inequalities Section 1.1 Prof. Wodarz Math 109 - Fall 2008 Contents 1 Linear Equations 2 1.1 Standard Form of a Linear Equation................ 2 1.2 Solving Linear Equations......................
More information2.5 Zeros of a Polynomial Functions
.5 Zeros of a Polynomial Functions Section.5 Notes Page 1 The first rule we will talk about is Descartes Rule of Signs, which can be used to determine the possible times a graph crosses the x-axis and
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 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 informationSOLVING QUADRATIC EQUATIONS - COMPARE THE FACTORING ac METHOD AND THE NEW DIAGONAL SUM METHOD By Nghi H. Nguyen
SOLVING QUADRATIC EQUATIONS - COMPARE THE FACTORING ac METHOD AND THE NEW DIAGONAL SUM METHOD By Nghi H. Nguyen A. GENERALITIES. When a given quadratic equation can be factored, there are 2 best methods
More informationSOLVING QUADRATIC EQUATIONS BY THE DIAGONAL SUM METHOD
SOLVING QUADRATIC EQUATIONS BY THE DIAGONAL SUM METHOD A quadratic equation in one variable has as standard form: ax^2 + bx + c = 0. Solving it means finding the values of x that make the equation true.
More informationClick on the links below to jump directly to the relevant section
Click on the links below to jump directly to the relevant section What is algebra? Operations with algebraic terms Mathematical properties of real numbers Order of operations What is Algebra? Algebra is
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 informationLectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More informationMATHEMATICS FOR ENGINEERING BASIC ALGEBRA
MATHEMATICS FOR ENGINEERING BASIC ALGEBRA TUTORIAL 1 ALGEBRAIC LAWS This tutorial is useful to anyone studying engineering. It uses the principle of learning by example. On completion of this tutorial
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 informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
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 information