The Gravity Model: Derivation and Calibration
|
|
- Audra Hunter
- 8 years ago
- Views:
Transcription
1 The Gravity Model: Derivation and Calibration Philip A. Viton October 28, 2014 Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
2 Introduction We turn now to the Gravity Model of trip distribution. As previously noted, this is most widely used model in current practice. From our perspective, it is based on two important ideas, one new and one old. 1. It is based on a parametrized theoretical model, meaning that the theory depends (unlike the Average Growth Factor model) on constants that need to be estimated. 2. It utilizes the same idea of improvement via iteration as the Average Growth Factor model, though, as we will see, in a slightly different context. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
3 Derivation of the Gravity Model Physics The gravity model is based on Newton s gravitational theory from physics, interpreted in a transportation context. In physics, the attractive force between two bodies is directly proportional to their masses, and inversely proportional to the square of the distance between them: where: h ij = g m i m j d 2 ij h ij is the attractive force between bodies i and j. m i and m j are the bodies masses. d ij is the distance between them. g is Newton s gravitational (proportionality) constant, approximately in cgs (centimeters/grammes/seconds) units. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
4 Derivation of the Gravity Model Transportation The derivation of the transportation version of the gravity model is a simple argument from analogy: The Newtonian attractive force term (h ij ) is analogized to directed interzonal trip-making: h ij T ij. The masses are analogized to total trips in and out of zones, so that m i O i and m j A j. The distance term is retained, but in an attempt to be more general (whether there is a serious theoretical basis for this is a question) the power-2 term is permitted to be arbitrary. There is no reason to believe that the Newtonian proportionality term applies here, so we replace it by a different one. The result is the first form of the (transportation) gravity model: T ij = θ O i A j d β ij Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
5 Geographical Justification Tobler s First Law of Geography states that: Everything is related to everything else, but closer things more so (W. Tobler, Cellular Geography in S. Gale and S. Olssohn, eds, Philosophy in Geography, 1979, pp ). The gravity model is consistent with the First Law, but is not implied by it (there are other possible functional forms that are equally consistent with the First Law). Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
6 Travel-Time Factors (I) In the first form of the gravity model, let s write T ij = θ O i A j d β ij 1/d β ij = F ij The F ij are called the travel-time factors. With this notation, the first form of the transportation gravity model becomes T ij = θo i A j F ij Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
7 Travel-Time Factors (II) There are several reasons for writing the model this way. It looks neater. Even if we have data on (say, centroid-to-centroid) distances, it will be hard to estimate the power-law β using linear techniques. More importantly, this can be considered a way to sneak other influences into the model. If travel between zones i and j depends on, say, the number of jobs present in zone j, we might want to write the denominator of the gravity model say telling us that trips depend on distance, jobs and a lot of other factors. Writing all those influences as F ij provides a way of doing this. Note that the F s are to be considered as unknowns. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
8 Gravity Model with Conservation of Origins (I) We now show that by requiring the gravity model to satisfy conservation of origins, we can eliminate the proportionality constant θ. With the introduction of the travel-time factors, version 1 of the gravity model is: T ij = θo i A j F ij For fixed i, sum both sides over the destinations j: j T ij = θo i A j F ij j On the left, j T ij is just O i. On the right, we can take terms not involving j outside the summation: O i = θo i A j F ij j Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
9 Gravity Model with Conservation of Origins (II) Now divide both sides by O i 1 = θ A j F ij j and solve for θ : θ = 1 j A j F ij Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
10 Gravity Model with Conservation of Origins (III) Now insert this into the gravity model. Since we are interested in T ij (which already uses j) we re-label the summation index (as m) in the expression defining θ. The result is: T ij = 1 m A m F im O i A j F ij Then we have our second form of the transportation gravity model: T ij = O i A j F ij m A m F im Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
11 Gravity Model with Conservation of Origins (IV) There are two important things to note about this form of the model: 1. It is guaranteed to satisfy conservation of origins exactly. Therefore we will never need to check whether this condition is satisfied or not. Of course, the same does not apply to conservation of attractions: there is no reason to suppose that this condition will be satisfied; and in fact it usually will not be. 2. The travel-time factors F ij all depend on an unknown parameter (the parameter β). This means that the interpretation of these F s is not simply as a growth rate, which was something we could calculate given data on the present and some predictions about the future. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
12 Gravity Model with Zonal Adjustment Factors As an empirical matter, early users of the gravity model observed that it did not appear to yield very accurate predictions. In order to improve the predictive accuracy, they introduced a set of zonal adjustment factors, to be denoted K ij. When these were incorporated, the transportation gravity model took the form T ij = As to the zonal adjustment factors, note that: O i A j F ij K ij m A m F im K im (1) 1. They have no basis whatever in theory, unlike the travel-time factors. They are introduced simply to improve predictions. 2. The matrix K {K ij } is another Z Z = Z 2 parameters which need to be estimated. It might reasonably be asked whether this will be asking too much of the available data. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
13 Calibration (I) We turn now to the task of calibrating the gravity model of trip distribution specified as: T ij = O i A j F ij K ij m A m F im K im The standard method for doing this is an iterative method developed by the US Bureau of Public Roads (now the Federal Highway Administration), known as the BPR method. As we have seen, the transportation form of the gravity model requires us to estimate two sets of unknown parameters: the travel time factors (F {F ij }) and the zonal adjustment factors (K {K ij }). Note that both of these are Z Z matrices. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
14 Calibration (II) The underlying idea of the BPR method is to choose these unknowns in order to make the gravity model work as well as possible for our present-day data. That is, unlike the growth factor model calibrations, the BPR calibration method makes no use of future data. What the BPR method does is find the F s and K s that reproduce T 0, the present-day (observed) trip matrix. Once we have calibrated the model (ie found estimates of the travel-time and zonal adjustment factors, which we will denote by ˆF { ˆF ij }) and ˆK { ˆK ij } respectively), we will assume that these are stable (ie unchanged) as between our current period and the future period for which we wish to distribute the trips. This makes prediction simply a matter of plugging in the future (predicted) data and utilizing our estimated ˆF and ˆK. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
15 BPR Method : Summary (I) The BPR method involves the following steps: 0. (optional) reduce the dimensionality of the problem by imposing similarity assumptions on the different F -factors. We will assume that pairs of zones with similar interzonal travel times involve the same travel-time factor. Thus we will require additional data: the current interzonal travel times. These sets of similar F -factors define what we will call superzones. For now, set the K ij 1 (ie ignore them). 1. Iterative step: estimate the F s based on observed superzonal total trips. That is, we use the gravity model formulation (which will involve only the F s, since we are ignoring the K s) to reproduce as closely as we wish, the observed superzonal total trips. The result of this step (Step 1) is estimates of the travel-time factors, denoted ˆF. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
16 BPR Method : Summary (II) 2. At the end of Step 1 we have a candidate trip matrix (an estimate of our target T 0 ). However, though it will satisfy conservation of origins, it will usually not satisfy conservation of attractions. So we perform another iterative step, called row-and column factoring, to approximately balance the trip matrix. This is Step At the end of Step 2 we have the F s and an approximately balanced trip matrix. But it still does not reproduce the original T 0. We reproduce T 0 by using the one set of parameters we have so far ignored, namely the zonal adjustment factors (the K matrix). This is Step 3. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
17 BPR Method : Example In my view, the simplest way to understand the fairly complicated details of the BPR calibration method is to develop the formal expressions for the calibration steps alongside an actual example. So that is what we will do here. Note : I will post to the course website an abbreviated version of the example, containing just the computations. You may find it helpful to refer to this as you review the details. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
18 Example Data Present-day (observed) trip-interchange matrix: T 0 = Present-day(observed) interzonal travel-times matrix: t 0 = We shall use a convergence criterion of 5% in all iterative steps (α L = 0.95, α H = 1.05). Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
19 Step 0 (I) We will assume that pairs of zones with similar interzonal travel times involve the same travel-time factor. This will define a set of superzones. We operationalize this by assuming that all pairs of zones i and j satisfying 0 t 0 ij < δ for a given interzonal travel-time difference δ, utilize the same travel-time factor, F 1. And we take all zonal pairs satisfying δ t 0 ij < 2δ to utilize a second travel time factor, F 2. And then 2δ t 0 ij < 3δ are assumed to involve a third travel-time factor F 3. And so on. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
20 Step 0 (II) In our example we shall take δ = 5 minutes. This defines the following 3 superzones: with superzonal trip totals: Superzone Zonal Pairs 1 {1, 1}, {2, 2}, {3, 3} 2 {1, 2}, {2, 1} 3 {1, 3}, {2, 3}, {3, 1}, {3, 2} O S = [450, 590, 490] Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
21 Step 0 (III) In our example, we will be calculating 3 distinct travel-time factors, one for each superzone. It is a simple matter to parlay these three into a full set F of factors. Formally, we define a mapping (rule) φ that takes our 3 estimates of the travel time factors (F 1, F 2, F 3 ) and produce an estimate of the full F ij matrix. In our case this rule is: Finally we set φ(f 1, F 2, F 3 ) = K 1 = F 1 F 2 F 3 F 2 F 1 F 3 F 3 F 3 F (This amounts to ignoring the K s for now). Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66.
22 Step 1 (I) In Step 1 we will estimate the distinct superzonal travel-time factors F i, as set up in step 0. In this step we work exclusively with superzonal (aggregated) travel. But in that context, the method is very much like the way we calibrated the growth-factor models: we generate an estimate of T, and we compute error factors by comparing actual superzonal totals (ie those implied by T 0 ) with those implied by the current T. If we have not converged we update the F s (not T as in the average growth factor model) and try again. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
23 Step 1 (II) An iteration in Step 1 consists of the following tasks: 1. Use the previously computed (or assumed) F s and the gravity model to generate a new T matrix. 2. Compare the total superzonal travel implied by this T matrix with the superzonal totals implied by T 0, via error ratios E i. 3. If convergence is not satisfied, update the F s and try again. 4. The updating rule generates a new set of superzonal F s by multiplying the old F s by the error ratios. In general F k i = F k 1 i E k i (where i indexes the superzones). Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
24 Step 1, Iteration 1 (I) Initial estimate: F 0 i = (1, 1, 1). Apply φ and get F 0 = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
25 Step 1, Iteration 1 (II) Apply the gravity model and find: T 1 = Tij 1 = O0 i A0 j F ij 0 m A 0 mf 0 im = (Of course this is just T 1 ij = O 0 i A0 j m A 0 m = O 0 i A0 j S(T 0 ). Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
26 Step 1, Iteration 1 (III) Convergence check against the superzone totals (NB: not the origins or attractions): Target Actual Error ratio Ei Note that the targets are the actual superzonal trip totals. We see that we have not converged. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
27 Step 1, Iteration 2 (I) The new superzonal factors Fi 1 error ratios: are the previous F s corrected by the Fi 1 = Fi 0 Ei 1 = [1.0, 1.0, 1.0] [ , , ] = [ , , ] Apply φ to obtain the full set of new travel-time factors: F 1 = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
28 Step 1, Iteration 2 (II) Apply the gravity model: T 2 = Tij 2 = O0 i A0 j F ij 1 m A 0 mf 1 im = The Appendix, beginning at slide 57, contains the detailed computations behind this result. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
29 Step 1, Iteration 2 (III) Convergence test: Still no convergence. Target Actual Error ratio Ei Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
30 Step 1, Iteration 3 (I) New interzonal F i : Fi 2 = Fi 1 Ei 2 = [ , , ] [ , , ] = [ , , ] Apply φ : F 2 = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
31 Step 1, Iteration 3 (II) Apply the gravity model: T 3 = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
32 Step 1, Iteration 3 (III) Convergence check: These have all converged. Target Actual Error ratio Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
33 Step 1, Final Result At the end of Step 1 we have our final estimate of the travel-time factors ˆF ˆF ij, which is the F matrix we obtained at the convergent iteration of our step-1 computations. For our example: ˆF = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
34 Step 2 (I) At the end of step 1 we have estimated the F s. We also have, associated with those F s (and under the assumption that the K s are all 1) an estimate of the trip matrix. As compared with T 0 (the trip matrix we are trying to reproduce) the current estimate T satisfies conservation of origins (automatically) but: probably does not satisfy conservation of attractions (even approximately) probably does not reproduce the individual elements of T 0 Step 2 is an attempt to remedy the first problem (conservation of attractions). Note that it is possible that at the end of Step 1 we do satisfy conservation of attractions (approximately). In that case we omit Step 2. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
35 Step 2 (II) If we need to do step 2 (ie if we don t approximately satisfy conservation of origins at the end of Step 1) then an iteration of Step 2 consists of: 1. A column factoring : this scales each column of the trip matrix to ensure conservation of attractions. But in doing this, we destroy conservation of origins; so 2. We perform a row factoring. This scales the rows of the result in part (1) to restore conservation of origins. But it will destroy conservation of attractions. At the end of a Step-2 iteration we check conservation of attractions. If it is not approximately satisfied, then we perform another iteration; and we continue until conservation of attractions is approximately satisfied. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
36 Step 2, Setup (I) Continuing our example, based on ˆF fron Step 1 and K 1 we have an estimate of the travel-time matrix we re trying to reproduce, namely the final T matrix from the previous step: T 3 = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
37 Step 2, Setup (II) Is this good enough? We need to check only the columns (conservation of attractions) for convergence: Target Actual Error ratio Note that we check against the actual attractions A 0 we have no more use for the superzones. Clearly not good enough. So we need to do Step 2. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
38 Step 2, Setup (III) To simplify the notation, let s rename our starting point (T 3 ) to be T 1. At each iteration of step 2 (given that we need to do it at all, as we have to in this example) we must do: 1. a column factoring 2. a row factoring 3. a convergence check on the columns. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
39 Step 2, Iteration 1, Column Factoring The column factors are the previous error ratios, so we have: , , We multiply the elements in each column by its column factor giving: T 1a = Example: the (1, 2) element of T 1 (= ) is in column 2, so we use the second column factor, giving = = T 1a 12. Note that this satisfies conservation of attractions, but no longer satisfies conservation of origins. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
40 Step 2, Iteration 1, Row Factoring The row factors are the row-wise (originations) error ratios of T 1a : Target Actual Error ratio and multiplying each row by its row factor gives: T 1b = Example: the (1, 2) element of T 1a (= ) is in row 1, so we use the first row factor, giving = = T 1b 12. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
41 Step 2, Iteration 1, Convergence Check We need to check only the columns (ie the attractions), since the row factoring assures conservation of origins. We have converged. Target Actual Error ratio Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
42 Step 3 (I) We now have an approximately balanced T matrix (ie T 1b ) derived on the hypothesis that K 1, namely T 1b = This satisfies conservation of origins, satisfies conservation of attractions to within our convergence criterion, but still does not reproduce the individual elements of T 0. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
43 Step 3 (II) In order to reproduce the individual elements of T 0 we use the zonal adjustment factors, which we have ignored up to now. The zonal adjustment (K ) factors are now computed as ˆK ij = Tij 0 Tij 1b (ie on the last (convergent) T matrix from step 2) and where means element-by-element division. Then ˆK = = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
44 BPR Method: Example Results Summary For our calibration of the gravity model using the BPR method we have found: ˆF = (from the final result of Step 1); and ˆK = (from Step 3). Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
45 Discussion : Step 2 (I) Remember that the motivation for the BPR method is to construct the F and K factors to allow us to exactly reproduce our observed trip matrix T 0. However, a quick calculation shows that we have not succeeded in this: we find, plugging in our calibrated results: T ij = O0 i A0 j ˆF ij ˆK ij m A 0 ˆF = m im ˆK im which does not reproduce our original observed trip matrix. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
46 Discussion : Step 2 (II) If you think about this for a minute you ll realize that the problem seems to lie in Step 2, the row-and-column factoring. For one thing, this step has nothing to do with the gravity model at all: it s just an ad-hoc way of arriving at a balanced interim trip matrix. For another, you might reasonably say, why do it at all? If we can exactly reproduce T 0 by first doing Step 1 and then adjusting the results via the zonal adjustment factors in Step 3, won t we automatically have a balanced trip matrix? It seems to me that the answer to this is Yes; suggesting that Step 2 is dispensable, despite the BPR. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
47 Calibration Without Step 2 (I) At the end of Step 1 we had an interim estimate of T 0 as: T 3 = implying that we could take: ˆK = = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
48 Calibration Without Step 2 (II) And a simple calculation shows that if we plug these new estimates ˆF = ˆK = into the gravity model, we do indeed exactly reproduce our original trip matrix T 0. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
49 Prediction (I) In order to predict a future trip matrix remember that this is the object of the whole exercise we need: predictions of the future origins by zone, O i predictions of the future attractions by zone, A j possibly, predictions of the future interzonal travel times, if we believe these have changed Given these, we assume that the ˆF and ˆK matrices are stable over time, and derive our predictions by plugging everything into the gravity model. That is,we take T ij = O i A j ˆF ij ˆK ij m A m ˆF im ˆK im Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
50 Prediction (II) Note that there is no guarantee that this T will satisfy conservation of attractions One possibility is to perform an artificial balancing step on the results even though this is not mandated by the gravity model. We could do this is via row-and-column factoring (Step 2) on T. (Remember that conservation of origins is guaranteed). So the suggestion is: first compute T according to the gravity model formula, and then if necessary go through Step 2 (row-and-column factoring) to arrive at an approximately balanced T. If we do this, we report T as our final prediction. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
51 Prediction Example (I) We work with the conventionally-calibrated gravity model, ie the one in which we do Step 2, whose results are shown in slide 44. Suppose that we predict: O = (650, 590, 350) A = (350, 700, 540) So that total trip-making rises from 1530 to We assume that the travel-time matrix is unchanged. There is an interesting question of what to do when an interzonal travel time changes and falls into a superzonal category not covered by the calibration (eg, if in our example the 15-minute time became 16 minutes). About all we can reasonably do is to include this in the original superzone, even though it really doesn t belong there. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
52 Prediction Example (II) To start, plug in O and A into the gravity model, using the calibrated ˆF and ˆK matrices. The result is: T = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
53 Prediction Example (III) Is this good enough? We need to check (only) conservation of attractions, based on our predictions (A ): Target Actual Error ratio all of which are outside our 5% convergence criteria So if we are concerned about balance/consistency, it may be a good idea to do some row-and-column factoring. Let s do this. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
54 Prediction Example (IV) The column factors are: ( , , ). The column-factored matrix is: The row factors are: ( , , ). And the row-factored matrix is: Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
55 Prediction Example (V) Good enough? We check: Target Actual Error ratio all of which are OK, so we take as our approximately-balanced predicted trip interchange matrix: T = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
56 Appendix Appendix Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
57 Applying the Gravity Model (I) This appendix does the detailed calculations in which we apply the gravity model to the second iteration of Step 1. We have (from slide 27): F 1 = O 0 i = 550, 600, 380 A 0 j = 400, 620, We will compute the T 2 matrix, as shown in slide 28, by: ij = O0 i A0 j F ij 1 m A 0 mf 1 T 2 im Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
58 Applying the Gravity Model (II) Before we get started, one preliminary note. The denominator of the expression for T ij is of the form Z A m F im = A m F im m m=1 The important thing to note is that this does not involve j. In other words, we will use the same denominator for all elements of T in the same row: T 11, T 12 and T 13 (row 1) all involve the same denominator; as do T 21, T 22 and T 23 (row 2). For a Z Z problem, you have to compute only Z distinct denominators. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
59 Applying the Gravity Model (III) For our sample problem, we have a Z = 3 zone region, so all summations run from m = 1 to m = 3. We begin by computing the three denominators, since they will be used repeatedly. i = 1 : 3 A 0 mf 1 3 im = A 0 mf1m 1 m=1 m=1 = A 0 1F A 0 2F A 0 3F 0 13 = ( ) + ( ) + ( ) = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
60 Applying the Gravity Model (IV) Denominators, continued: i = 2 : 3 A 0 mf 1 3 im = A 0 mf2m 1 m=1 m=1 = A 0 1F A 0 2F A 0 3F 0 23 = ( ) + ( ) + ( ) = i = 3 : 3 A 0 mf 1 3 im = A 0 mf3m 1 m=1 m=1 = A 0 1F A 0 2F A 0 3F 0 33 = ( ) + ( ) + ( ) = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
61 Applying the Gravity Model Now we begin computing the individual terms. Row 1: i = 1; j = 1 : T11 2 = O0 1 A0 1 F 11 1 m A 0 mf1m 1 = = = i = 1; j = 2 : T12 2 = O0 1 A0 2 F 12 1 m A 0 mf1m 1 = = = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
62 Applying the Gravity Model (V) Final entry for Row 1: i = 1; j = 3 : T13 2 = O0 1 A0 3 F 13 1 m A 0 mf1m 1 = = = Note that the denominators for all the entries in row 1 (as they will be in each row) are the same. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
63 Applying the Gravity Model (VI) Row 2: i = 2; j = 1 : T21 2 = O0 2 A0 1 F 21 1 m A 0 mf2m = = i = 2; j = 2 : T22 2 = O0 2 A0 2 F 22 1 m A 0 mf2m = = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
64 Applying the Gravity Model (VII) Final entry for Row 2: Row 3: i = 2; j = 3 : T23 2 = O0 2 A0 3 F 23 1 m A 0 mf2m = = i = 3; j = 1 : T31 2 = O0 3 A0 1 F 31 1 m A 0 mf3m = = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
65 Applying the Gravity Model (VIII) Row 3, concluded: i = 3; j = 2 : T32 2 = O0 3 A0 2 F 32 1 m A 0 mf3m = = i = 3; j = 3 : T33 2 = O0 3 A0 3 F 33 1 m A 0 mf3m = = Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
66 Applying the Gravity Model (IX) Putting all these together we get: T 2 = T 2 ij = which matches the result in slide 28. Philip A. Viton CRP/CE 5700 () Gravity Model October 28, / 66
Question 2: How do you solve a matrix equation using the matrix inverse?
Question : How do you solve a matrix equation using the matrix inverse? In the previous question, we wrote systems of equations as a matrix equation AX B. In this format, the matrix A contains the coefficients
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 informationRecall this chart that showed how most of our course would be organized:
Chapter 4 One-Way ANOVA Recall this chart that showed how most of our course would be organized: Explanatory Variable(s) Response Variable Methods Categorical Categorical Contingency Tables Categorical
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 informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More informationDIRECT ORBITAL DYNAMICS: USING INDEPENDENT ORBITAL TERMS TO TREAT BODIES AS ORBITING EACH OTHER DIRECTLY WHILE IN MOTION
1 DIRECT ORBITAL DYNAMICS: USING INDEPENDENT ORBITAL TERMS TO TREAT BODIES AS ORBITING EACH OTHER DIRECTLY WHILE IN MOTION Daniel S. Orton email: dsorton1@gmail.com Abstract: There are many longstanding
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 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 informationOrthogonal Projections
Orthogonal Projections and Reflections (with exercises) by D. Klain Version.. Corrections and comments are welcome! Orthogonal Projections Let X,..., X k be a family of linearly independent (column) vectors
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 informationA Production Planning Problem
A Production Planning Problem Suppose a production manager is responsible for scheduling the monthly production levels of a certain product for a planning horizon of twelve months. For planning purposes,
More informationANALYTIC HIERARCHY PROCESS (AHP) TUTORIAL
Kardi Teknomo ANALYTIC HIERARCHY PROCESS (AHP) TUTORIAL Revoledu.com Table of Contents Analytic Hierarchy Process (AHP) Tutorial... 1 Multi Criteria Decision Making... 1 Cross Tabulation... 2 Evaluation
More information5.5. Solving linear systems by the elimination method
55 Solving linear systems by the elimination method Equivalent systems The major technique of solving systems of equations is changing the original problem into another one which is of an easier to solve
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 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 informationFractions to decimals
Worksheet.4 Fractions and Decimals Section Fractions to decimals The most common method of converting fractions to decimals is to use a calculator. A fraction represents a division so is another way of
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 informationIntroduction to. Hypothesis Testing CHAPTER LEARNING OBJECTIVES. 1 Identify the four steps of hypothesis testing.
Introduction to Hypothesis Testing CHAPTER 8 LEARNING OBJECTIVES After reading this chapter, you should be able to: 1 Identify the four steps of hypothesis testing. 2 Define null hypothesis, alternative
More informationPartial Fractions. (x 1)(x 2 + 1)
Partial Fractions Adding rational functions involves finding a common denominator, rewriting each fraction so that it has that denominator, then adding. For example, 3x x 1 3x(x 1) (x + 1)(x 1) + 1(x +
More informationDeterminants can be used to solve a linear system of equations using Cramer s Rule.
2.6.2 Cramer s Rule Determinants can be used to solve a linear system of equations using Cramer s Rule. Cramer s Rule for Two Equations in Two Variables Given the system This system has the unique solution
More informationGLM, insurance pricing & big data: paying attention to convergence issues.
GLM, insurance pricing & big data: paying attention to convergence issues. Michaël NOACK - michael.noack@addactis.com Senior consultant & Manager of ADDACTIS Pricing Copyright 2014 ADDACTIS Worldwide.
More informationMulti-state transition models with actuarial applications c
Multi-state transition models with actuarial applications c by James W. Daniel c Copyright 2004 by James W. Daniel Reprinted by the Casualty Actuarial Society and the Society of Actuaries by permission
More informationSection 1.5 Linear Models
Section 1.5 Linear Models Some real-life problems can be modeled using linear equations. Now that we know how to find the slope of a line, the equation of a line, and the point of intersection of two lines,
More informationOPRE 6201 : 2. Simplex Method
OPRE 6201 : 2. Simplex Method 1 The Graphical Method: An Example Consider the following linear program: Max 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2
More informationRow Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
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 information1 Portfolio mean and variance
Copyright c 2005 by Karl Sigman Portfolio mean and variance Here we study the performance of a one-period investment X 0 > 0 (dollars) shared among several different assets. Our criterion for measuring
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 informationGRAVITATIONAL FIELDS PHYSICS 20 GRAVITATIONAL FORCES. Gravitational Fields (or Acceleration Due to Gravity) Symbol: Definition: Units:
GRAVITATIONAL FIELDS Gravitational Fields (or Acceleration Due to Gravity) Symbol: Definition: Units: Formula Description This is the formula for force due to gravity or as we call it, weight. Relevant
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More informationLinear Equations ! 25 30 35$ & " 350 150% & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development
MathsTrack (NOTE Feb 2013: This is the old version of MathsTrack. New books will be created during 2013 and 2014) Topic 4 Module 9 Introduction Systems of to Matrices Linear Equations Income = Tickets!
More informationInflation. Chapter 8. 8.1 Money Supply and Demand
Chapter 8 Inflation This chapter examines the causes and consequences of inflation. Sections 8.1 and 8.2 relate inflation to money supply and demand. Although the presentation differs somewhat from that
More informationTo do a factor analysis, we need to select an extraction method and a rotation method. Hit the Extraction button to specify your extraction method.
Factor Analysis in SPSS To conduct a Factor Analysis, start from the Analyze menu. This procedure is intended to reduce the complexity in a set of data, so we choose Data Reduction from the menu. And the
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 information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
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 informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
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 information6.042/18.062J Mathematics for Computer Science. Expected Value I
6.42/8.62J Mathematics for Computer Science Srini Devadas and Eric Lehman May 3, 25 Lecture otes Expected Value I The expectation or expected value of a random variable is a single number that tells you
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationCHAPTER 8 FACTOR EXTRACTION BY MATRIX FACTORING TECHNIQUES. From Exploratory Factor Analysis Ledyard R Tucker and Robert C.
CHAPTER 8 FACTOR EXTRACTION BY MATRIX FACTORING TECHNIQUES From Exploratory Factor Analysis Ledyard R Tucker and Robert C MacCallum 1997 180 CHAPTER 8 FACTOR EXTRACTION BY MATRIX FACTORING TECHNIQUES In
More informationA Mathematical Study of Purchasing Airline Tickets
A Mathematical Study of Purchasing Airline Tickets THESIS Presented in Partial Fulfillment of the Requirements for the Degree Master of Mathematical Science in the Graduate School of The Ohio State University
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 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 informationIntroduction to Matrices
Introduction to Matrices Tom Davis tomrdavis@earthlinknet 1 Definitions A matrix (plural: matrices) is simply a rectangular array of things For now, we ll assume the things are numbers, but as you go on
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
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 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 informationThe Trip Scheduling Problem
The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems
More informationExperiment #1, Analyze Data using Excel, Calculator and Graphs.
Physics 182 - Fall 2014 - Experiment #1 1 Experiment #1, Analyze Data using Excel, Calculator and Graphs. 1 Purpose (5 Points, Including Title. Points apply to your lab report.) Before we start measuring
More information1 Interest rates, and risk-free investments
Interest rates, and risk-free investments Copyright c 2005 by Karl Sigman. Interest and compounded interest Suppose that you place x 0 ($) in an account that offers a fixed (never to change over time)
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 informationLecture 5 Rational functions and partial fraction expansion
S. Boyd EE102 Lecture 5 Rational functions and partial fraction expansion (review of) polynomials rational functions pole-zero plots partial fraction expansion repeated poles nonproper rational functions
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 informationSimple Regression Theory II 2010 Samuel L. Baker
SIMPLE REGRESSION THEORY II 1 Simple Regression Theory II 2010 Samuel L. Baker Assessing how good the regression equation is likely to be Assignment 1A gets into drawing inferences about how close the
More informationManifold Learning Examples PCA, LLE and ISOMAP
Manifold Learning Examples PCA, LLE and ISOMAP Dan Ventura October 14, 28 Abstract We try to give a helpful concrete example that demonstrates how to use PCA, LLE and Isomap, attempts to provide some intuition
More informationCryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards
More informationCOLLEGE ALGEBRA. Paul Dawkins
COLLEGE ALGEBRA Paul Dawkins Table of Contents Preface... iii Outline... iv Preliminaries... Introduction... Integer Exponents... Rational Exponents... 9 Real Exponents...5 Radicals...6 Polynomials...5
More informationLinear Threshold Units
Linear Threshold Units w x hx (... w n x n w We assume that each feature x j and each weight w j is a real number (we will relax this later) We will study three different algorithms for learning linear
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 informationNonlinear Iterative Partial Least Squares Method
Numerical Methods for Determining Principal Component Analysis Abstract Factors Béchu, S., Richard-Plouet, M., Fernandez, V., Walton, J., and Fairley, N. (2016) Developments in numerical treatments for
More informationA Direct Numerical Method for Observability Analysis
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 15, NO 2, MAY 2000 625 A Direct Numerical Method for Observability Analysis Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper presents an algebraic method
More informationChi Square Tests. Chapter 10. 10.1 Introduction
Contents 10 Chi Square Tests 703 10.1 Introduction............................ 703 10.2 The Chi Square Distribution.................. 704 10.3 Goodness of Fit Test....................... 709 10.4 Chi Square
More informationFactor analysis. Angela Montanari
Factor analysis Angela Montanari 1 Introduction Factor analysis is a statistical model that allows to explain the correlations between a large number of observed correlated variables through a small number
More informationSudoku puzzles and how to solve them
Sudoku puzzles and how to solve them Andries E. Brouwer 2006-05-31 1 Sudoku Figure 1: Two puzzles the second one is difficult A Sudoku puzzle (of classical type ) consists of a 9-by-9 matrix partitioned
More information1 Short Introduction to Time Series
ECONOMICS 7344, Spring 202 Bent E. Sørensen January 24, 202 Short Introduction to Time Series A time series is a collection of stochastic variables x,.., x t,.., x T indexed by an integer value t. The
More informationSTATISTICA Formula Guide: Logistic Regression. Table of Contents
: Table of Contents... 1 Overview of Model... 1 Dispersion... 2 Parameterization... 3 Sigma-Restricted Model... 3 Overparameterized Model... 4 Reference Coding... 4 Model Summary (Summary Tab)... 5 Summary
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 informationPre-Algebra Lecture 6
Pre-Algebra Lecture 6 Today we will discuss Decimals and Percentages. Outline: 1. Decimals 2. Ordering Decimals 3. Rounding Decimals 4. Adding and subtracting Decimals 5. Multiplying and Dividing Decimals
More informationAnnex 6 BEST PRACTICE EXAMPLES FOCUSING ON SAMPLE SIZE AND RELIABILITY CALCULATIONS AND SAMPLING FOR VALIDATION/VERIFICATION. (Version 01.
Page 1 BEST PRACTICE EXAMPLES FOCUSING ON SAMPLE SIZE AND RELIABILITY CALCULATIONS AND SAMPLING FOR VALIDATION/VERIFICATION (Version 01.1) I. Introduction 1. The clean development mechanism (CDM) Executive
More informationRegression III: Advanced Methods
Lecture 16: Generalized Additive Models Regression III: Advanced Methods Bill Jacoby Michigan State University http://polisci.msu.edu/jacoby/icpsr/regress3 Goals of the Lecture Introduce Additive Models
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 informationSummation Algebra. x i
2 Summation Algebra In the next 3 chapters, we deal with the very basic results in summation algebra, descriptive statistics, and matrix algebra that are prerequisites for the study of SEM theory. You
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 informationFTS Real Time System Project: Portfolio Diversification Note: this project requires use of Excel s Solver
FTS Real Time System Project: Portfolio Diversification Note: this project requires use of Excel s Solver Question: How do you create a diversified stock portfolio? Advice given by most financial advisors
More informationAP Physics 1 and 2 Lab Investigations
AP Physics 1 and 2 Lab Investigations Student Guide to Data Analysis New York, NY. College Board, Advanced Placement, Advanced Placement Program, AP, AP Central, and the acorn logo are registered trademarks
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 informationEvaluating Annuities (IV) Evaluating Annuities (III) Annuity: First Example. Evaluating Annuities (V) We want to evaluate
Annuities Annuities and the IRR Philip A. Viton October 24, 2014 When the temporal impact Z t of a project does not vary during some time period, it is said to constitute an annuity (for that period).
More informationWhat are the place values to the left of the decimal point and their associated powers of ten?
The verbal answers to all of the following questions should be memorized before completion of algebra. Answers that are not memorized will hinder your ability to succeed in geometry and algebra. (Everything
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 informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding
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 informationNetwork quality control
Network quality control Network quality control P.J.G. Teunissen Delft Institute of Earth Observation and Space systems (DEOS) Delft University of Technology VSSD iv Series on Mathematical Geodesy and
More informationeach college c i C has a capacity q i - the maximum number of students it will admit
n colleges in a set C, m applicants in a set A, where m is much larger than n. each college c i C has a capacity q i - the maximum number of students it will admit each college c i has a strict order i
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 informationAlgebra Practice Problems for Precalculus and Calculus
Algebra Practice Problems for Precalculus and Calculus Solve the following equations for the unknown x: 1. 5 = 7x 16 2. 2x 3 = 5 x 3. 4. 1 2 (x 3) + x = 17 + 3(4 x) 5 x = 2 x 3 Multiply the indicated polynomials
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More informationAt the skate park on the ramp
At the skate park on the ramp 1 On the ramp When a cart rolls down a ramp, it begins at rest, but starts moving downward upon release covers more distance each second When a cart rolls up a ramp, it rises
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 informationx1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.
Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability
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 informationNotes from February 11
Notes from February 11 Math 130 Course web site: www.courses.fas.harvard.edu/5811 Two lemmas Before proving the theorem which was stated at the end of class on February 8, we begin with two lemmas. The
More informationStock valuation. Price of a First period's dividends Second period's dividends Third period's dividends = + + +... share of stock
Stock valuation A reading prepared by Pamela Peterson Drake O U T L I N E. Valuation of common stock. Returns on stock. Summary. Valuation of common stock "[A] stock is worth the present value of all the
More informationMarketing Mix Modelling and Big Data P. M Cain
1) Introduction Marketing Mix Modelling and Big Data P. M Cain Big data is generally defined in terms of the volume and variety of structured and unstructured information. Whereas structured data is stored
More informationASEN 3112 - Structures. MDOF Dynamic Systems. ASEN 3112 Lecture 1 Slide 1
19 MDOF Dynamic Systems ASEN 3112 Lecture 1 Slide 1 A Two-DOF Mass-Spring-Dashpot Dynamic System Consider the lumped-parameter, mass-spring-dashpot dynamic system shown in the Figure. It has two point
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 information