Network Traffic Modelling

Size: px
Start display at page:

Download "Network Traffic Modelling"

Transcription

1 University of York Dissertation submitted for the MSc in Mathematics with Modern Applications, Department of Mathematics, University of York, UK. August 009 Network Traffic Modelling Author: David Slade Supervisor: Professor M.J. Smith

2 Contents 1 Introduction to Signal Control and Timings Continuous Modelling of Fixed Time Signals Delays, Routes, Links and Stages Optimisation of Fixed Time Signals Examples of P 0 Policy raess s Network 15.1 raess s Network with Flow from Node 1 to Node Responsive Control In A Simple Network Terminology Demand Feasibility, Supply Feasibility and Feasibility Two Delay Formulae Consistent Equilibrium Using The Equisaturation Policy Equilibrium Using Delay Formulae δ Stability of Equilibria Using Delay Formulae δ Equilibrium Using Delay Formulae δ Stability of Equilibria Using Delay Formulae δ Alternative Stability Analysis Analysis for Equilibria Using δ 1 Formulae Analysis for Equilibria Using δ Formulae Remark Effect on Network Capacity Network Capacity Using Equisaturation Policy Network Capacity Using the P 0 Policy Modelling as a Dynamical System and Finding a Lyapunov Function General Case P 0 and Equisaturation Policies Equilibria of a Symmetrical Network with ottlenecks Using delay formulae δ How The Value of α Affects Stability of the Network Using the δ 1 Delay Formulae How The Value of α Affects Stability of the Network Using the P 0 Policy Remark When A 0 Using P 0 Policy Stability Conclusion 49 1

3 List of Figures 1 A typical shape of the graph of Webster s delay formula as traffic flow on the lane, X i, increases. Note the asymptote at s i G i where the delay increases towards infinity A simple example of a network that has four routes. The flow on link i is therefore = flow on route 1 + flow on route + flow on route 3 + flow on route 4 = X 1 + X + X 3 + X A simple example of a signal controlled junction with two links approaching it. Link 1 has saturation flow s 1 and link has saturation flow s A simple network A network with a single origin-destination pair with four routes raess s Network showing costs on the links, e.g. flow + 50 means the cost on the link is the flow + 50 units The average travel cost at equilibrium flow as k changes, it is a decreasing function for 0 k The average travel costs of the three routes as the amount of traffic travelling from node 1 to node, ǫ, changes How the price of anarchy changes for increasing amount of cars travelling from node 1 to node A simple signal-controlled network. Route 1 has saturation flow = k vehicles per minute at node A and saturation flow k vehicles per minute at the signal. Route has saturation flow=k vehicles per minute at node and saturation flow s vehicles per minute at the signal Example graph of how d 1 may change as spare capacity decreases, approaching infinity as TX 1 approaches sg ifurcation diagram to show pitchfork bifurcation of the equilibria of the system. ifurcation point at T = s 4 As x 1 = 1 + [ ]1 ]1 1 [1, x 4 [As(s T)] = [As(s T)] 13 The set of equilibria consistent with the equisaturation policy for some T using delay formulae δ 1. The lines are all equilibria, including the axes, and the arrows indicate the natural directions of motion of non-equilibria as drivers and green times respond to delays and saturation ratios (they also indicate the stability of the equilibria) ifurcation diagram to show the changing stability of the equilibria of the system. ifurcation points at T 1 = s [ 1 s 16 ]1 and A T = s + [ ] 1 s A

4 15 The set of equilibria consistent with the equisaturation policy for some T using delay formulae δ. The lines are all equilibria, including the axes, and the arrows indicate the natural directions of motion of non-equilibria as drivers and green times respond to delays and saturation ratios (they also indicate the stability of the equilibria). The bifurcation points are also indicated; T 1 = s [ 1 s 16 ]1 and T A = s + [ 1 s 16 ] A 16 A network with a wide long upper route and shorter narrower lower route. Route 1 has saturation flow = 8s 1 vehicles per minute at node A and saturation flow s 1 vehicles per minute at the signal. Route has saturation flow=α vehicles per minute at node and saturation flow s vehicles per minute at the signal Network capacity as s varies using two different policies for determining signal timings, P 0 and equisaturation A symmetrical network with two routes both with identical saturation flows of α at the bottlenecks at Node A and Node and saturation flow s at the signal controlled junction A graph of the equilbria of the network as T increases, with α = s A typical graph of the equilbria of the network as T increases, with s < α < s A graph of the equilbria of the network as T increases, with α = s. 46 The set of equilibria consistent with the P 0 policy for some T using delay formulae δ. The lines are all equilibria, including the axes, and the arrows indicate the natural directions of motion of non-equilibria as drivers and green times respond to delays and saturation ratios (they also indicate the stability of the equilibria). 49 3

5 Acknowledgements I would like to thank the whole of the Department of Mathematics for their help, lectures, seminars and other such work in the four years i have spent at the University of York. In particular i would like to thank Dr.Zaq Coehlo for organising the MSc course which has been most enjoyable. I would also like to thank Professor Mike Smith who has been a marvellous supervisor for this dissertation. For providing me with an insight into his and others work on the subject of Traffic Modelling, for guiding, advising and correcting me; i have thoroughly enjoyed working on and completing this project. 4

6 Introduction In the modern world many people own cars or use public transport to travel. This leads to congestion and therefore long delays on journeys. To attempt to minimise delays and keep traffic moving then we must try and find the best signal timings and traffic flows for traffic networks. To do this various models have been used and their dynamics analysed. Within these models there are two important choices to make, one of them is the form of the delay function of a link and the other the signal timing policy employed. In this project we will look at two forms of a delay function, both similar and both representing a term in Webster s delay formula which will be introduced in the next section. We will also consider two signal timing policies, one of them called the equisaturation policy and the other the P 0 policy. We will first introduce notation and concepts of traffic modelling, as well as the two signal timing policies and Webster s delay formula. In the section following this we look at raess s network and how increasing cost and thus decreasing traffic flow on a link in raess s network can actually reduce average travel cost across the network. We will then consider changing the parameters and adding flow on one link and consider how this changes the price of anarchy. In the next section we look at the set of feasible traffic flows and green times and the constraints that they have. We also look at our two chosen delay formulae and look at the consistent equilibria they produce when the equisaturation policy is utilised on a simple network with no bottlenecks. We analyse the stability of these equilibria, using two methods, and will acquire graphs of the evolution of the equilibria as the total flow on the network changes. We next look at the effect on network capacity using the P 0 policy has compared with the equisaturation policy. We then consider the system as a system of four differential equations and find a Lyapunov function to show that there is only one consistent equilibrium when using the P 0 policy on the network. Finally we introduce bottlenecks into the simple network we have been looking at, and look at the symmetrical version of this network. We find the equilibria of the network, using both delay formulae, and consider how the saturation flows at the bottlenecks can affect the stability of these. Acknowledgement of Previous Work This project is based upon work done by a number of experts. The first section involving raess s network is based upon work done by both raess [4] and Roughgarden [8]. The rest of the project is based upon work, supervision and guidance done by Professor Mike Smith at the University of York, who has provided numerous papers, projects and presentations for myself to learn from and work from. 5

7 1 Introduction to Signal Control and Timings Traffic signal control strategies seek to minimise a combination of total travel time and stops for vehicles for the local traffic flow that has been observed, assuming that this pattern does not change. 1.1 Continuous Modelling of Fixed Time Signals Definition 1 A stage a set of lanes approaching a junction which are shown green simultaneously as their paths do not coincide. The simplest case is where the stages are such that traffic approaching the junction along distinct lanes in the same stage follow paths which do not intersect and so lanes in the same stage may be given green simultaneously. Let there be K stages at a junctions, the signal display changes from green to stage 1 to green to stage to...to green to stage K to green to stage 1 and in a continuous cycle as given. The method of changing display is fixed time if the periods of time when the signal is green for stage k are of the form t k to t k + τg k, τ + t k to τ + t k + τg k, τ + t k to τ + t k + τg k, and so on. The time period during which stage k is green consists of repeated periods of time of constant lengths, τg k seconds, which happen regularly (every τ seconds). The time τ seconds is called the cycle time of the signal and is usually less that 10 seconds. τg k is the green time and t k may be thought of as the offset associated with the particular junction been considered. Different junctions have their own t k offset time and taken together these describe the way in which the fixed time evolutions at separate junctions are related. Definition An integreen is some fixed time, η seconds say, during which all stages at a junction are shown red to allow traffic which has just had priority in one stage the time to clear the junction before traffic flows with coinciding paths are given priority/shown green. We will assume that η = 0 for simplicity. The green time proportions G 1,G,...,G K for which stages 1,,...,K are given green add up to one. A signal controlled junction has signals operating fixed time if the variables τ,g 1,...,G K are fixed. It is natural to seek the best values of these variables which is the reason for modelling traffic signals. Webster [] first thoroughly studied isolated traffic signals and this is now a standard reference on fixed time signal control. Webster developed a formula for the delay imposed on a single traffic stream by a traffic signal operating to fixed time signal timings and used this to justify a simple rule in calculating fixed time 6

8 settings which approximately minimise the total of all delays experienced by all vehicles passing through the junction. The study involved: 1. theoretical modelling. simulation to validate the delay formula 3. optimisation to estimate reasonable signal settings. These three elements play an important part in studies that follow Webster s work. 1. Delays, Routes, Links and Stages To optimise the signal control variables we need an objective function which is usually chosen to be the total rate of delay D at the junction. To minimise D we require a formula giving D in terms of flows and signal timing parameters which leads us to Webster s Formula. This was designed to estimate the average medium run delay d i to vehicles on a single lane caused by traffic signals operating on a fixed time basis. It gives the estimated average delay per vehicle as a function of 1. average traffic inflow rate along that lane (X i vehicles per second). proportion of time the lane is given green (G i ) 3. saturation flow of the lane (s i vehicles per second) 4. cycle time (τ seconds). Webster s Delay Formula [ ] d i (X i, G i ) = 9 τ (1 G i ) X i X i s s i G i (s i G i X i ) i This is an extremely important function that is considered throughout modelling of traffic flow networks. We can consider numerous simplifications of this formula as the overriding factor of the delay formula is δ = 1 s i G i X i as this almost dictates the shape of the graph completely. So we can consider this formula and slight variations of it when deciding on a delay formula that we wish to apply to a network when studying its dynamics. 7

9 d i s i G i x i Figure 1: A typical shape of the graph of Webster s delay formula as traffic flow on the lane, X i, increases. Note the asymptote at s i G i where the delay increases towards infinity. The term δ is close to a well know formula, derived by Pollaczek and Khintchine, for the average delay experienced by a Poisson stream of traffic being served 1 by a server with identical service times equal to s i G i seconds. The first term of Webster s delay formula approximates the delay due to the stop start nature of traffic signal control. A network is made up of links, routes and nodes. At the start of each route is an origin node which is connected by a number of links and nodes to the final node, the destination node. There may be a number of origin-destination pairs. Definition 3 A link is a road that adjoins the last signal controlled junction or bottleneck to the next one. Definition 4 A route is made up of a finite number of links that join the origin to the destination with no breaks. Definition 5 The flow on a link i is denoted x i and is the number of vehicles per minute on the given link. The flow on a route r is denoted by X r. The flow along link i, x i, is the sum of the flows along all routes which the link belongs to. So x i = where X r is the flow along route r. r: route r contains link i 8 X r

10 The green time awarded to link i, G i, is the sum of those green times awarded to the stages to which the link belongs: G i = g k. Example: k:stage k contains link i link i Figure : A simple example of a network that has four routes. The flow on link i is therefore = flow on route 1 + flow on route + flow on route 3 + flow on route 4 = X 1 + X + X 3 + X Optimisation of Fixed Time Signals link 1 signal link Figure 3: A simple example of a signal controlled junction with two links approaching it. Link 1 has saturation flow s 1 and link has saturation flow s. Let us consider a junction with only two lanes approaching it (see Figure 3, link 1 and link, with saturation flows s 1 and s respectively, so stage 1 is link 1 and stage is link. Link 1 has signal green time G 1 and link is awarded green time G. We have that the delays experienced by each of the routes are represented by d 1 (X 1, G 1 ) and d (X, G ). 9

11 Suppose link 1 is given green for τg 1 seconds and link is given green for τg seconds during each cycle of τ seconds then we have that as G 1 and G are proportions that G 1 + G = 1. Supply Feasibility and Constraints: Let flows X 1 and X be fixed. The stage green times G 1 and G are adjusted so the fixed traffic flows can get through the junction. Then the feasible supply gives X 1 < s 1 G 1, X < s G. Also we have that G 1 + G = 1 and G 1 0, G 0. These constraints give us a set for feasible green time vector G = (G 1, G ). We are supposing that the vector of link flows, X, and cycle time τ are both fixed. It is easy to check that Webster s formula is decreasing and strictly convex in G i. Thus if we let D be the sum of all the delays experienced at the junction D (X,G) = X 1 d 1 (X 1, G 1 ) + X d (X, G ) is (for fixed X) a convex function of the vector G of the stage green times. There are many ways of determining a feasible vector G which minimises the convex function D subject to the linear feasibility constraints on G. One way is to begin with a feasible G. Determine the marginal costs D G 1 and D G. oth are negative as delay d i will be smaller if G i gets larger. They give the degree to which D changes when the stage green time vector G changes. We may think of D G 1 and D G as pressures P 1 and P on stages 1 and respectively. Increasing the green time for the stage under the most pressure is a natural decision. Suppose P 1 = D G 1 < D G = P then a swap of time α from[ less pressurised stage 1 to more pressurised stage will reduce D, by about α if α is small. A more general swap rate is ] D G 1 D G defined as (P 1 P ). As green time is swapped towards stage, D must decline and under natural conditions G approaches the stage green time vector G which minimises D for fixed X. At G it is impossible to swap further according to the above rules. At optimum G, P 1 = P. Pressures on the two stages (or in this case links) are equal and D is minimised. This is one signal timings policy called the delay minimisation policy. One can build other objectives into a signal setting policy by letting P i (X,G) be other functions of flow and green time. Still following as above and considering P i as pressures. The new control policy, we call it policy P, is determined by P 1 and P. 10

12 Policy P clearly depends on how we choose the pressures P i. For any natural P the adjustment of G is as straight forward as with delay minimisation. The rate of change of G 1 is P 1 P, rate of change of G is P P 1. The swap rule leads to G which equalises P 1 and P and minimise the maximum of P 1 and P. There are three choices for P that are most popular: Delay Minimisation Equisaturation P 1 (X,G) = D G 1 P (X,G) = D G P 0 Policy P 1 (X,G) = X 1 s 1 G 1 P (X,G) = X s G P 1 (X,G) = s 1 d 1 (X 1, G 1 ) P (X,G) = s d (X, G ) The third choice called the P 0 policy [1] and, as we will show throughout the project, favours links with high saturation flows and maximises the capacity of a network automatically. 1.4 Examples of P 0 Policy Consider the following simple network with signal control where link 1 and link meet. It has link 1 which has twice the saturation flow as the shorter link. So take s 1 = and s = 1. Link 1 Link Figure 4: A simple network. 11

13 Using the policy P 0 we have s 1 d 1 = s d d = d 1 so the delay time for vehicles on link is twice as long as the delay for vehicles on link 1 thus encouraging vehicles to use the higher saturation link that is link 1 and so overall maximising the capacity of the network as a whole. 1

14 Now consider the network in Figure 5. The network has one origin destination pair and four routes. There are three signal controlled junctions at nodes A, and C. Origin route 1 route route 3 A C Destination Figure 5: A network with a single origin-destination pair with four routes. Let us assume that routes 1, and 3 have saturation flow s 1 = 1. We now look at two cases, one where the saturation flow on route 4 is greater than the sum of the saturation flows on the other routes. The other case is when the saturation flow on route 4 is less than the sum of the other routes. Take s 4 = 4. Thus s 1 d 1 = s 4 d 4 d 1 = 4d 4. So as there are 3 signals on route 4 the total delay time is 3 4 d 1 < d 1 so the delay time on either route 1, or 3 is greater than on route 4. Thus favouring the route with the higher saturation flow. Now take s 4 =. d 1 = d and so the total delay time on route 4 is 3 d 1 > d 1 13

15 so the incentive is to stay on either route 1, or 3 and avoid route 4. This is because as a combination routes 1, and 3 offer a higher saturation flow than route 4 in this case. These two examples show that policy P 0 favours the higher capacity routes and maximises the network capacity. We consider this policy further in other sections of the project and show how P 0 produces favourable results. 14

16 raess s Network Destination flow x flow flow + k Node 1 Node 10 x flow flow + 50 Route 1 Origin Route Figure 6: raess s Network showing costs on the links, e.g. flow + 50 means the cost on the link is the flow + 50 units. We consider raess s network [4], shown in figure 6, which we assume has a capacity flow of 6 travels from the origin to the destination. If we, at first, consider that the dotted link is not present then the equilibrium flow (where both routes have equal costs) is when there is a flow of 3 on each route. As the costs are equal there is no incentive to swap routes. The cost on the two routes are (10.flow on link) + (flow on link + 50) = (10.3) + (3 + 50) = 83. Now we consider the network with the dotted link included. If k = 10, then the three routes have the same cost if the distribution of flow is equal on all three, i.e. flow on route 1 = flow on route = flow on route 3 =. The average travel cost at this distribution is 9 which is greater than the average cost without the dotted link. We now look at the effect of varying the parameter k. If k = 3 then we see that the flow distribution (3,3,0) is an equilibrium with the costs of each route being 83. So by increasing the cost of the dotted link it has been made undesirable and so traffic flow is only on the other routes. So the equilibrium of the network changes when k changes. If k varies between 0 and 3 then we obtain that the equilibrium flow pattern is ( + k 10 13, + k 10, 13 (k 10) 13 (presented in the form (flow on route 1, flow on route, flow on route 3) ),which gives all route costs as 9 9(k 10) 13. ) 15

17 Average travel cost k Figure 7: The average travel cost at equilibrium flow as k changes, it is a decreasing function for 0 k 3..1 raess s Network with Flow from Node 1 to Node Let us now consider raess s network when there is a set amount of traffic flow, ǫ, of the total flow (which is 6) travelling from node 1 to node (see figure 6 ). Let us find the equilibrium flow pattern that is created in this situation and how this affects costs of travel. There is an equilibrium when costs on all three routes are the same. These are defined as C 1 = (10.flow on link11) + (50 + flow on link1) C = (10.flow on link) + (50 + flow on link1) C 3 = (10.flow on link11) + (10.flow on link11) + (flow on dotted link + k). We note that (if f i = flow on route i); flow on link 11 = f 1 + f 3, flow on link 1 = f 1, flow on link 1 = f, flow on link = f + f 3, and flow on dotted link = f 3 + ǫ. We also note that as the total network flow is 6, then f 1 + f + f 3 = 6 ǫ. At equilibrium we have C 1 = C = C 3, thus we have four simultaneous equations to solve for three variables f i. Firstly, C 1 = C, gives us that f 1 = f. Then we use the fact that f + f 3 = 6 ǫ f 1 to yield, from C 1 = C 3, 10 (6 ǫ f 1 ) + (50 + f 1 ) = 0 (6 ǫ f 1 ) + f 3 + ǫ + k and noting that f 3 = 6 ǫ f 1, (50 + f 1 ) = 10 (6 ǫ f 1 ) + 6 f 1 + k 16

18 gives as k 10 (1 + ǫ) f 1 = f = + 13 (k 10) + 7ǫ f 3 =. 13 This gives average costs for all routes following this equilibrium flow pattern [ ] 9 (k 10) + 40ǫ 9 13 which we see is the same as the usual raess s network costs when ǫ = 0. The equilibrium flow pattern is valid until f 3 = 0 which is when (k 10) + 7ǫ < 6 which is when k < 3 7 ǫ. This gives us the following graph of average travel cost for different values of ǫ, see Figure 8. average travel cost ǫ = 0 ǫ = 1 ǫ = ǫ = k Figure 8: The average travel costs of the three routes as the amount of traffic travelling from node 1 to node, ǫ, changes. The ratio of the equilibrium cost and the optimal cost, which Roughgarden [8] called the price of anarchy, is interesting to look at to see how big an effect changes have on the cost of the network. We can see when ǫ = 0 that the price of anarchy for the raess network we considered in the first section is

19 Roughgarden [8] showed that if the cost functions of the routes have the form (a x flow)+b then the price of anarchy is 4 and for large random networks the 3 price of anarchy approaches 4 with probability 1 as the number of links in the 3 network tends to infinity, provided networks loads are suitably chosen. We look at how adding in traffic flowing from node 1 to node affects the price of anarchy. We look at cost at k = 10 and cost at k = 3 7ǫ. This gives the price of anarchy as 9 40ǫ ǫ 6 which is equal to 8 ( ǫ) ǫ. We plot this graph in figure 9. Price of anarchy ǫ 6 7 Figure 9: How the price of anarchy changes for increasing amount of cars travelling from node 1 to node. We must have that 3 7ǫ 10 which gives us that ǫ 6, otherwise the 7 ratio is 1. This shows us that by having cars travelling from node 1 to node the price of anarchy falls, so the improvement in travel costs by increasing k decreases. Therefore the benefit of closing the link in raess s network will be reduced if there are cars that travel from node 1 to node. 18

20 3 Responsive Control In A Simple Network We will consider a simple, symmetrical network shown in Figure 10. Two routes of equal uncongested travel time and distance join a single Origin-Destination pair. There are two stages at the signal; the first gives green to route 1, the second gives green to route. We suppose the cycle time at the junction is fixed and so the total of the two green times will be fixed. At nodes 1 and there are bottlenecks. We consider the characteristics of the two routes to be identical. Node A Link 11 Link 1 Route 1 Origin Link 1 Signal Route Link Destination Node Figure 10: A simple signal-controlled network. Route 1 has saturation flow = k vehicles per minute at node A and saturation flow k vehicles per minute at the signal. Route has saturation flow=k vehicles per minute at node and saturation flow s vehicles per minute at the signal. 3.1 Terminology We will use the following terminology: T = total flow from the Origin to Destination (vehicles per minute) TX 1 = flow on route 1 (vehicles per minute) TX = flow on route (vehicles per minute) X 1 = proportion of flow using route 1 X = proportion of flow using route G 1 = proportion of time route 1 is given green G = proportion of time route is given green k = saturation flow at nodes A and via either route (vehicles per minute) s = saturation flow at the signal approached via either route (vehicles per minute) d 11 = delay at exit of link 11 (minutes per vehicle) d 1 = delay at exit of link 1 (minutes per vehicle) 19

21 d 1 = delay at exit of link 1 (minutes per vehicle) d = delay at exit of link (minutes per vehicle) K 1 = uncongested time to traverse route 1 ignoring bottleneck delays (minutes per vehicle) K = uncongested time to traverse route ignoring bottleneck delays (minutes per vehicle) C 1 = K 1 + AX 1 + d 11 + d 1 = average travel time on route 1 (minutes per vehicle) C = K + AX + d 1 + d = average travel time on route (minutes per vehicle). We are assuming that the routes have the same uncongested travel time so that K 1 = K = K. The vector X = (X 1, X ) gives the flow split between route 1 and route ; always X 1 + X = 1, X 1 0 and X 0. Also, we suppose that the stage green-time proportions satisfy G 1 + G = 1, G 1 0 and G 0, so there are no positive minimum green-times. 3. Demand Feasibility, Supply Feasibility and Feasibility The assumed conditions on the vector X and the stage green times lead to the following definitions. The set D of demand feasible (X,G) is given by D = {(X,G) : X 1 + X = 1, X 1 0, X 0, G 1 + G = 1, G 1 0, G 0}. The set S of supply feasible (X,G) is given by S = {(X,G) : sg 1 > TX 1, sg > TX }. From this we immediately have the set E of feasible (X,G) given by E = D S. 3.3 Two Delay Formulae We assume that there are two delay formulae δ 1 and δ giving all four delays d 11, d 1, d 1 and d. We define them using δ 1 as the following: d 11 = d 1 = 0 TX 1 d 1 = δ 1 (TX 1, sg 1 ) = [sg 1 (sg 1 TX 1 )] TX d = δ 1 (TX, sg ) = [sg (sg TX )]. 0

22 Using δ the delays are given by the following: d 11 = d 1 = 0 d 1 = δ (TX 1, sg 1 ) = (sg 1 TX 1 ) d = δ (TX, sg ) = (sg TX ). The travel costs along routes 1 and given by C 1 and C respectively are defined as C 1 = K + ATX 1 + d 1 and C = K + ATX + d. A,, k and s are all constants. δ 1 is identical to the second term of Webster s delay formula (1958) if we choose to be 9 0. d 1 sg 1TX1 Figure 11: Example graph of how d 1 may change as spare capacity decreases, approaching infinity as TX 1 approaches sg 1. For both δ 1 and δ, as the spare capacity (the difference between sg i and TX i, i.e. the maximum flow possible and the actual flow) decreases towards zero, the delays increase towards infinity. This is a natural requirement and explains the supply feasible set S (see Figure 11). The delays defined by δ 1 and δ are defined throughout the feasible set E. We define an equilibrium flow as a feasible vector (X 1,X ) and a feasible T such that C 1 = C. 1

23 The definitions of the costs show that this involves the delay functions and thus depends on X,G and T.

24 4 Consistent Equilibrium Using The Equisaturation Policy 4.1 Equilibrium Using Delay Formulae δ 1 If we now assume that the delay formulae are in the form of δ 1 then we have and C 1 = K + ATX 1 + d 1 = ATX 1 + C = K + ATX + d = ATX + TX 1 [sg 1 (sg 1 TX 1 )] TX [sg (sg 1 TX )] as d 11 = d 1 = 0. In the equisaturation policy, for any feasible X and T, green times are chosen so that TX 1 = TX sg 1 sg thus X 1 = G 1 and X = G which gives [ ][ T 1 C 1 C = AT (X 1 X ) + 1 ]. s (s T) X 1 X To find the equilibria of the system we solve the equation C 1 C = 0. Obviously X 1 = X = 1 is a solution for all T. To find the others we multiply C 1 C = 0 by X 1 X and obtain [ ] T (C 1 C )X 1 X = AT (X 1 X ) X 1 X [X 1 X ] = 0. s (s T) Now we have already obtained the solution of X 1 X = 0 so here we assume that this is not true and divide through by X 1 X and then substitute in X = 1 X 1 to yield X1 X 1 + [As (s T)] = 0 which gives us two solutions and X 1 = 1 + [ 1 4 X 1 = 1 [ 1 4 ] 1 [As (s T)] ] 1. [As (s T)] These are two real roots of the equation C 1 C = 0 if and only if [As(s T)] which is the same as saying if and only if T s 4. As 3

25 4. Stability of Equilibria Using Delay Formulae δ 1 We have three equilibria of this system, namely X 1 = 1 X 1 = 1 [ 1 4 [As (s T)] X 1 = 1 + [ 1 4 [As (s T)] and we wish to find the ranges of T in which they are stable. To do this we consider the function C 1 C as a function of X 1 only which we can do as X = 1 X 1, so let [ f (X 1 ) = C 1 C = AT (X 1 1) + ] 1 ] 1 T s (s T) ] [ 1 1 ]. X 1 1 X 1 To analyse the stability of the equilibria we look at the derivative of this equation, which is [ ][ ] f T 1 1 (X 1 ) = AT + s (s T) (1 X 1 ). When X 1 = 1 we have f ( 1 ) X 1 = AT 8T s (s T). Now an equilibrium is stable for values of T for which f (X 1 ) > 0. So we see that the equilibrium X 1 = 1 4 is stable when T < s. As [ ]1 Let us consider the equilibrium point X 1 = Now for 4 [As(s T)] ] simplicity let θ = [ 1 4 [As(s T)] and so X 1 = 1 + θ 1. If we consider the function f (X 1 )(X 1 X ) we note that as X 1 X 0 the sign of the gradient of the function is the same as f (X 1 ) (although with possibly different magnitude) and the roots of the two equations are the same. Therefore we can consider f (X 1 )(X 1 X ) and its derivative when analysing the stability of the equilibria. F (X 1 ) = f (X 1 ) (X 1 X ) = AT (X 1 1) ( X 1 X 1 and its derivative is thus F (X 1 ) = AT [( X 1 X 1 ) T s (s T) (X 1 1) ) + (X1 1)(1 X 1 ) ] T s (s T). 4

26 X 1 x 1 1 x s 4 As s T Figure 1: ifurcation diagram to show pitchfork bifurcation of the equilibria [ ]1 of the system. ifurcation point at T = s 4 and As x 1 = 1 + 1, 4 [As(s T)] ]1 [1 x = 1. 4 [As(s T)] So substituting in X 1 = 1 + θ 1 we obtain F (X 1 ) = ( ) 1 θ 4θ As (s T) = 4θ and this is always less than zero for the range in which the equilibrium point X 1 = 1 + θ 1 is real. Similarly for the other point we get the same result. So for the other two equilibria, we obtain that these are unstable for T < s 4 As which gives us the following two diagrams. Figure 1 is a bifurcation diagram, showing how the stability of the equilibria change as T increases. Figure 13 shows the set of equilibria (TX 1, TX ) as T increases from zero to s (of course T cannot be greater than s). We see that we have a pitchfork bifurcation at T = s 4 where as T As increases we have three equilibria, two of which are unstable with the middle equilibrium point stable but as T increases past the bifurcation point we only have one equilibrium and this is unstable. 5

27 s TX s 4 As s TX 1 Figure 13: The set of equilibria consistent with the equisaturation policy for some T using delay formulae δ 1. The lines are all equilibria, including the axes, and the arrows indicate the natural directions of motion of non-equilibria as drivers and green times respond to delays and saturation ratios (they also indicate the stability of the equilibria). 4.3 Equilibrium Using Delay Formulae δ Now suppose that the delay formulae are in the form of δ. Therefore we have and C 1 = K + ATX 1 + d 1 = ATX 1 + sg 1 TX 1 C = K + ATX + d = ATX + sg TX. As we are using the equisaturation policy, as before, we have X 1 = G 1 and X = G and so C 1 C = AT (X 1 X ) + ( 1 1 ). s T X 1 X We note that X 1 = X = 1 is an equilibrium. We attempt to find more equilibria by multiplying C 1 C = 0 through by X 1 X to get (C 1 C )X 1 X = AT (X 1 X ) X 1 X s T (X 1 X ) = 0. 6

28 Now as we have ruled out X 1 X = 0 as we have found this as an equilibrium already we may divide by X 1 X and set X = 1 X 1 to yield X 1 X 1 AT (s T) = 0. Solving this quadratic equation we obtain two solutions: and X 1 = 1 + [ 1 4 X 1 = 1 [ 1 4 ]1 AT (s T) ]1. AT (s T) We see that these are two real equilibria of the system if and only if AT(s T) which is equivalent to T st + 4 A 0 and if we solve this we have that the above two equilibria are real between T = s 1 [ s 16 ] 1 A and T = s + 1 [ s 16 ]1. A 4.4 Stability of Equilibria Using Delay Formulae δ If we consider f (X 1 ) = C 1 C = AT (X 1 1) + s T ( 1 1 ) X 1 1 X 1 then we take its derivative f (X 1 ) = AT s T ( 1 X 1 + ) 1 (1 X 1 ). We evaluate the derivative at each of the equilibria. If we have an equilibrium point X1 then this is stable for all values of T that f (X1 ) > 0. y applying this rule to each equilibrium point we obtain for the point X 1 = 1 ( ) 1 f = AT 8 (s T) 7

29 X 1 1 T 1 T T Figure 14: ifurcation diagram to show the changing stability of the equilibria of the system. ifurcation points at T 1 = s [ 1 s 16 ]1 and T A = s + [ ] 1 s A and so the equilibrium is unstable whenever this is greater than zero. This gives us that X 1 = 1 is stable for all values of T such that s 1 [ s 16 ] 1 s < T < A + 1 [ s 16 ]1 A and unstable at all other points. The other two equilibria points that were found before are unstable for all values of T such that they are real solutions i.e. the values stated above. ]1. Now for [1 Let us consider the equilibrium point X 1 = [AT(s T)] [ ] 1 simplicity let θ = and so X 4 [AT(s T)] 1 = 1 + θ 1. If we consider the function f (X 1 )(X 1 X ) we note that as X 1 X 0 the sign of the gradient of the function is the same as f (X 1 ) (although with possibly different magnitude) and the roots of the two equations are the same. Therefore we can consider f (X 1 )(X 1 X ) and its derivative when analysing the stability of the equilibria. F (X 1 ) = f (X 1 )(X 1 X ) = AT (X 1 1) ( X 1 X 1 and its derivative is thus F (X 1 ) = AT [( X 1 X 1 ) s T (X 1 1) ) + (X1 1)(1 X 1 ) ] s T. 8

30 TX T 1 T s TX 1 Figure 15: The set of equilibria consistent with the equisaturation policy for some T using delay formulae δ. The lines are all equilibria, including the axes, and the arrows indicate the natural directions of motion of non-equilibria as drivers and green times respond to delays and saturation ratios (they also indicate the stability of the equilibria). The bifurcation points are also indicated; T 1 = s 1 [ s 16 A ] 1 and T = s + 1 [ s 16 A So substituting in X 1 = 1 + θ 1 we obtain F (X 1 ) = AT which is less than zero when ] 1. ( ) 1 θ 4θ T (s T) 4θ < 0 and this is always less than zero for the range in which the equilibrium point X 1 = 1 + θ 1 is real. Similarly for the other point we get the same result. This information allows us to draw two informative graphs shown below. Figure 14 is a bifurcation diagram which shows the changing stability of the equilibria of the system, we see how it appears as two opposing pitchforks. Figure 15 shows the set of equilibria, (TX 1, TX ) for a certain T from zero to s; all lines, including the axes up to s, are equilbria. 9

31 4.5 Alternative Stability Analysis Although we have considered the stability of the equilibria that we have found, it is beneficial to check the answers we achieved with another method. We will use a, maybe, more traditional way of checking stability by considering the Jacobian matrix of the system. This means we must write the system in terms of differential equations which is something we will use later in the project. We will show that this method achieves the same answers and thus back up the method we have already used where we considered the derivative of the equilibrium equation Analysis for Equilibria Using δ 1 Formulae We have already found three equilbria of the formula C C 1 = 0 which are also equilibria with the same stability of the differential equation system Ẋ 1 = (C C 1 )(X 1 X ) = AT(X X 1 )X 1 X + T s (s T) (X 1 X ) Ẋ = (C 1 C )(X 1 X ) = AT(X 1 X )X 1 X + T s (s T) (X X 1 ) which has Jacobian matrix [ ] Ẋ 1 AT (X Ẋ1 X 1X ) + T AT (X s(s T) 1 X X ) T s(s T) X A = 1 X = Ẋ Ẋ X 1 X AT (X 1 X X ) T AT (X s(s T) 1 X 1X ) + T s(s T) To evaluate the stability of the equilibria we look at the Jacobian matrix evaluated at the equilbria points and consider the trace and determinant of the matrix to decide stability. Let us consider a Jacobian matrix [ ] a b = c d then the characteristic equation is det ( λi) = 0, which thus yields where λ τλ + = 0 τ = trace(a) = a + d = det(a) = ad bc. So the eigenvalues only depend on the trace and determinant of the matrix. If τ < 0 then the equilibria are stable [6]. 30

32 If we use this information for our system we first evaluate the equilibrium (X 1, X ) = ( 1, 1 ) : ( 1 A, 1 ) = [ AT + T 4 s(s T) AT T 4 s(s T) AT 4 T s(s T) AT 4 + T s(s T) which has trace, τ = AT + T 4 and this is less than zero when T < s s(s T) ( ). As 1 Now let us consider the equilibrium + θ, 1 1 θ 1, where θ = 1. 4 As(s T) We have that the trace of the matrix A evaluated at the equilibrium point is τ = ( θ) AT + T s (s T) and this is less than zero when T > s 4 but the equilibrium point is only real As when T ( < s 4 so this equilibrium point is always unstable. The equilibrium As ) 1 point θ, θ 1 satisfies the same conditions so is always unstable while real. We note that these equilibria are also equilibria of the extended system of the following differential equations Ẋ 1 = (C C 1 )(X 1 X ) = AT(X X 1 )X 1 X + T s (s T) (X 1 X ) Ẋ = (C 1 C )(X 1 X ) = AT(X 1 X )X 1 X + Ġ 1 = TX 1 sg 1 TX sg Ġ = TX sg TX 1 sg 1. ] T s (s T) (X X 1 ) 4.5. Analysis for Equilibria Using δ Formulae Using the same method we analyse the system C 1 C = 0 defined using the δ delay formulae. We analyse the differential equations system Ẋ 1 = (C C 1 )(X 1 X ) = AT(X X 1 )X 1 X + (s T) (X 1 X ) Ẋ = (C 1 C )(X 1 X ) = AT(X 1 X )X 1 X + which has Jacobian matrix AT (X X 1 X ) + A = AT (X 1 X X) (s T) (X X 1 ) AT (X (s T) 1 X X1) (s T) (s T) AT (X 1 X 1 X ) + (s T) 31

33 Let us consider the equilibrium point ( 1, 1 ), if we evaluate the Jacobian matrix A at this point then we get the trace of A as τ = AT + and this is less (s T) than zero when s 1 [ s 16 ] 1 s < T < A + 1 Now if we look at the equilibrium point θ = 1 4 AT(s T) [ s 16 A ] 1. (1) ( ) 1 θ 1, 1 + θ 1, where in this case,. The matrix A evaluated at this point has trace τ = AT ( X 1 + X 4X 1X ) + (s T), which, if we note that X1 + X = 1 X 1X, is τ = AT ( 1 ) + 6θ + (s T) and this is less than zero when 4θ < 0 which ( is at no point ) when the equilibrium point is real so the point 1 θ 1, 1 + θ 1 is always unstable when real, i.e. in the interval (1). The other equilibrium point found has the same conditions, shown in the same way. 4.6 Remark y using the above method we have shown that we get the same answers for the ranges of stability and instability of the equilibria as before when we considered the derivative of the equilibrium equation C 1 C = 0. This gives us two methods now for finding the range of stability of equilibria that we find. 3

34 5 Effect on Network Capacity 5.1 Network Capacity Using Equisaturation Policy We now consider the network shown in Figure 16 with same saturation flow at both nodes but different saturation flows at the signal from each route. We consider when s 1 > s so that the upper route is considered as wider. Node A Link 11 Route 1 Link 1 Origin Link 1 Signal Route Link Destination Node Figure 16: A network with a wide long upper route and shorter narrower lower route. Route 1 has saturation flow = 8s 1 vehicles per minute at node A and saturation flow s 1 vehicles per minute at the signal. Route has saturation flow=α vehicles per minute at node and saturation flow s vehicles per minute at the signal. and We now introduce two delay formulae for the bottlenecks; TX 1 d 11 = δ 1 (TX 1, α) = α (α TX 1 ) TX d 1 = δ 1 (TX, α) = α (α TX ) d 11 = δ (TX 1, α) = α TX 1 d 1 = δ (TX, α) =. α TX If the equisaturation policy is used to determine fixed time signal timings then we have that X 1 = X is the stable equilibrium (see next section). From this we have that as, by the policy, TX 1 = TX s 1 G 1 s G 33

35 then s 1 G 1 = s G. We also have G 1 = 1 G so s 1 s 1 G = s G and thus Similarly s s G 1 = s 1 G 1, giving We find the upper bound for feasible T; and we note that s 1 s 1 + s = G. s s 1 + s = G 1. s 1 G 1 + s G = s 1s s 1 + s + s s 1 s 1 + s = s 1s s 1 + s s 1 s 1 +s < 1 so we have the upper bound for T as s 1 s s 1 + s < s. We note at the possible loss of network capacity as no matter the size of s 1 the maximum network capacity is less than s. 5. Network Capacity Using the P 0 Policy If we implement the policy P 0 (Smith, 1980) then the green time vector G = (G 1, G ) for any feasible flow vector X = (X 1, X ) is chosen so that (X,G) is feasible and s 1 d 1 = s d where the delays are the delays for each route at the signal. If we allow for drivers to choose the cheapest route then obviously all drivers will choose the route with smallest delay which is the route with the highest saturation flow. Thus, in our case where route 1 is the widest and thus has least delays, all drivers will be on route 1. The network capacity of this route can not exceed the minimum saturation flow of the bottleneck at node 1 and the signal junction, as otherwise delay times would approach infinity at one of these points. Thus the network capacity of the network when the P 0 policy is implemented is min{max {s 1, s }, α}. Figure 17 shows the differences in network capacity between the two policies. 5.3 Modelling as a Dynamical System and Finding a Lyapunov Function Let us consider the delay formula δ and the P 0 policy and analyse the stability of the equilibrium (X1, X, G 1, G ) that it produces. 34

36 α Network capacity s 1 P 0 equisaturation s Figure 17: Network capacity as s varies using two different policies for determining signal timings, P 0 and equisaturation. There are many dynamical systems that would be natural to describe the evolution of the system away from the equilibrium. We will consider the following system: dx 1 dt dx dt = C C 1 = AT (X X 1 ) + s 1 G 1 TX 1 = C 1 C = AT (X 1 X ) + s G TX + () s G TX α TX (3) α TX 1 + (4) s 1 G 1 TX 1 α TX 1 α TX (5) dg 1 = s 1 d 1 s d dt (6) dg = s d s 1 d 1 dt (7) We want to show that any solution of the dynamical system converges to the unique equilibrium. We do this by finding a Lyapunov function of the system. A Lyapunov function V of a system ẋ = f (x) with fixed point x, is a continuously differentiable, real valued function V (x). If, further, the Lyapunov function has the following properties: 1. V (x) > 0 for all x x i.e. V is positive definite. V < 0 for all x x then x is globally asymptotically stable, which means x (t) x as t for all initial conditions, further the system has no closed orbits [5]. 35

37 So, let us consider the function V (X,G) = ln(s 1 ) ln(s 1 G 1 TX 1 ) + ln(α) ln(α TX 1 ) + ln(s ) ln(s G TX ) + ln(α) ln(α TX ) + AT From this and the above we see that V = AT X 1 + T T + = TC 1 X 1 α TX 1 s 1 G 1 TX 1 V = AT T T X + + = TC X 8s TX s G TX V s 1 = = s 1 d 1 G 1 s 1 G 1 TX 1 V s = = s d G s G TX (X 1 + X ). and so dv dt = TC 1 [C C 1 ] + TC [C 1 C ] s 1 d 1 [s 1 d 1 s d ] s d [s d s 1 d 1 ] = T [C 1 C ] [s 1 d 1 s d ] < 0 unless we are at equilibrium. So V declines along trajectories away from equilibrium provided flows and green times are positive. Also V > 0 away from equilibrium so V is a Lyapunov function for the dynamical system and furthermore, (X1, X, G 1, G ), is a stable equilibrium point if it is in the interior of the feasible set. We must consider what happens when a trajectory of the function hits the boundary. Does the Lyapunov function V still decrease? To see this we look at the direction of the function at the boundary, if it is negative then we know it is decreasing still, so we consider V (X,G) = V (X,G) f (X,G) where f (X,G) is the system of differential. Let us consider the boundary where X 1 = 0. When X 1 = 0, we have that Ẋ1 and Ẋ go to 0. So we get Ẋ 1 V Ẋ Ġ 1 = Ġ TC 1 TC s 1 d 1 s d Ġ 1 Ġ

38 so we then get (s 1 d 1 s d )(s d s 1 d 1 ) which is clearly less than zero unless we are at equilibrium. So V is descending on this boundary and it can be shown that it will descend on all the non-negativity boundaries. A function is convex if it has a second derivative that is always greater than or equal to 0. Clearly, lnx is convex for values (0, ) as the second derivative of lnx is 1 x. Similarly, x is a convex function. Also, the sum of two convex functions is also convex, and adding a constant to it does not change its convexity. Proof. Consider f(x) and g(x) both convex functions for some range U. Now let h(x) = f(x) + g(x) + c, where c is any constant. Then h (x) = f (x) + g (x) 0 as f and g are convex. From this we can quite clearly see that V is convex in all variables X 1, X, G 1 and G. Theorem 1 A minimum x of a convex function f : R n R is also a global minimum of f. Proof [7]: Let x be a local minimum of a convex function f. Then for any w in some neighbourhood S of x we have f (w) f (x). Now for any y and z = tx + (1 t) y S for t < 1 and as f is convex we have the property that tf(x) + (1 t)f(y) f(tx + (1 t)y) = f(z) f(x). Which then gives the result immediately that f(y) f(x). This theorem shows us that the equilibrium we find using the Lyapunov function V is a unique stable equilibrium. 5.4 General Case We now consider a more general case where we have any delay function f : R + R + which is a non-increasing function. Now the cost functions of the two routes are defined as C 1 = ATX 1 + f (s 1 G 1 TX 1 ) + f (α TX 1 ) C = ATX + f (s G TX ) + f (α TX ) 37

39 If we define F 11, F 1, F 1 and F as, for u > 0, then For clarity we have F ii = F ij = si u α u f (u)du f (u)du F ij (u) = f(u). then we put the Lyapunov function as F 11 X 1 (s 1 G 1 TX 1 ) = f (s 1 G 1 TX 1 ) F X (s G TX ) = f (s G TX ) F 1 X 1 (α TX 1 ) = f (8s TX 1 ) F X (α TX ) = f (8s TX ) F i G i (s i G i TX i ) = s i f (s i G i TX i ) V (X,G) = F 11 (s 1 G 1 TX 1 ) + F (s G TX ) + F 1 (α TX 1 ) + F (α TX ) + AT ( ) X 1 + X. We now note that V X 1 = AT X 1 + Tf (s 1 G 1 TX 1 ) + Tf (α TX 1 ) = TC 1 V X = AT X + Tf (s G TX ) + Tf (α TX ) = TC V G 1 = s 1 f (s 1 G 1 TX 1 ) V G = s f (s G TX ) which gives us dv dt = T [C 1 C ] [s 1 d 1 s d ] < 0 unless at equilibrium. Thus V is a Lyapunov function for the dynamical system and the single unique equilibrium is stable, here we assume that the delay function is such that V is a 38

40 convex function. This is true so long as F is convex, where F is the integral of the delay function f. This is the case where the trajectory does not hit boundary constraints. If this happens we must check that V is decreasing on the boundaries. It is simple to show that V is decreasing on the boundaries. We consider Ẋ 1 V Ẋ Ġ 1 Ġ and show that it is negative on the boundaries. For instance if G 1 = 0 then G = 0 and we have Ẋ 1 V Ẋ Ġ 1 = TC 1 (C C 1 ) + TC (C 1 C ) = T (C 1 C )(C C 1 ) Ġ which is always less than zero except at equilibrium. 5.5 P 0 and Equisaturation Policies In this section we have seen how employing the equisaturation policy can lead to a loss in network capacity, whereas if we use the P 0 policy it automatically maximises the network capacity. We have considered constructing a Lyapunov function to show that the system, when green times are set using the P 0 policy, has a unique equilibrium and that this point is stable. To do this we considered the evolution of the network using differential equations and found a convex Lyapunov function that decreased within the set of feasibility and on the boundaries. We then looked at doing this for a more general case. 39

2.3 Convex Constrained Optimization Problems

2.3 Convex Constrained Optimization Problems 42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

More information

BX in ( u, v) basis in two ways. On the one hand, AN = u+

BX in ( u, v) basis in two ways. On the one hand, AN = u+ 1. Let f(x) = 1 x +1. Find f (6) () (the value of the sixth derivative of the function f(x) at zero). Answer: 7. We expand the given function into a Taylor series at the point x = : f(x) = 1 x + x 4 x

More information

Traffic control and route choice: modelling and optimisation

Traffic control and route choice: modelling and optimisation JCT Signals Symposium (2012) Traffic control and route choice: modelling and optimisation Mike Smith (mike@st-pauls-square.demon.co.uk) Department of Mathematics, University of York, UK 1. Introduction

More information

Hello, my name is Olga Michasova and I present the work The generalized model of economic growth with human capital accumulation.

Hello, my name is Olga Michasova and I present the work The generalized model of economic growth with human capital accumulation. Hello, my name is Olga Michasova and I present the work The generalized model of economic growth with human capital accumulation. 1 Without any doubts human capital is a key factor of economic growth because

More information

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce

More information

Lecture 13 Linear quadratic Lyapunov theory

Lecture 13 Linear quadratic Lyapunov theory EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time

More information

Figure 2.1: Center of mass of four points.

Figure 2.1: Center of mass of four points. Chapter 2 Bézier curves are named after their inventor, Dr. Pierre Bézier. Bézier was an engineer with the Renault car company and set out in the early 196 s to develop a curve formulation which would

More information

3.2 Sources, Sinks, Saddles, and Spirals

3.2 Sources, Sinks, Saddles, and Spirals 3.2. Sources, Sinks, Saddles, and Spirals 6 3.2 Sources, Sinks, Saddles, and Spirals The pictures in this section show solutions to Ay 00 C By 0 C Cy D 0. These are linear equations with constant coefficients

More information

Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand

Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such

More information

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming

More information

(Quasi-)Newton methods

(Quasi-)Newton methods (Quasi-)Newton methods 1 Introduction 1.1 Newton method Newton method is a method to find the zeros of a differentiable non-linear function g, x such that g(x) = 0, where g : R n R n. Given a starting

More information

3. INNER PRODUCT SPACES

3. 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 information

On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems

On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems Dynamics at the Horsetooth Volume 2, 2010. On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems Eric Hanson Department of Mathematics Colorado State University

More information

Nonlinear Iterative Partial Least Squares Method

Nonlinear 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 information

Performance of networks containing both MaxNet and SumNet links

Performance of networks containing both MaxNet and SumNet links Performance of networks containing both MaxNet and SumNet links Lachlan L. H. Andrew and Bartek P. Wydrowski Abstract Both MaxNet and SumNet are distributed congestion control architectures suitable for

More information

1 Nonzero sum games and Nash equilibria

1 Nonzero sum games and Nash equilibria princeton univ. F 14 cos 521: Advanced Algorithm Design Lecture 19: Equilibria and algorithms Lecturer: Sanjeev Arora Scribe: Economic and game-theoretic reasoning specifically, how agents respond to economic

More information

Reaction diffusion systems and pattern formation

Reaction diffusion systems and pattern formation Chapter 5 Reaction diffusion systems and pattern formation 5.1 Reaction diffusion systems from biology In ecological problems, different species interact with each other, and in chemical reactions, different

More information

Jim Lambers MAT 169 Fall Semester 2009-10 Lecture 25 Notes

Jim Lambers MAT 169 Fall Semester 2009-10 Lecture 25 Notes Jim Lambers MAT 169 Fall Semester 009-10 Lecture 5 Notes These notes correspond to Section 10.5 in the text. Equations of Lines A line can be viewed, conceptually, as the set of all points in space that

More information

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written

More information

On the Interaction and Competition among Internet Service Providers

On the Interaction and Competition among Internet Service Providers On the Interaction and Competition among Internet Service Providers Sam C.M. Lee John C.S. Lui + Abstract The current Internet architecture comprises of different privately owned Internet service providers

More information

15 Limit sets. Lyapunov functions

15 Limit sets. Lyapunov functions 15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior

More information

Solving Simultaneous Equations and Matrices

Solving Simultaneous Equations and Matrices Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering

More information

Vector and Matrix Norms

Vector 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 information

MATH 21. College Algebra 1 Lecture Notes

MATH 21. College Algebra 1 Lecture Notes MATH 21 College Algebra 1 Lecture Notes MATH 21 3.6 Factoring Review College Algebra 1 Factoring and Foiling 1. (a + b) 2 = a 2 + 2ab + b 2. 2. (a b) 2 = a 2 2ab + b 2. 3. (a + b)(a b) = a 2 b 2. 4. (a

More information

2After completing this chapter you should be able to

2After completing this chapter you should be able to After completing this chapter you should be able to solve problems involving motion in a straight line with constant acceleration model an object moving vertically under gravity understand distance time

More information

DATA ANALYSIS II. Matrix Algorithms

DATA 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 information

A QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS

A QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit Vectors

More information

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical

More information

Load Balancing and Switch Scheduling

Load Balancing and Switch Scheduling EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

More information

Deployment of express checkout lines at supermarkets

Deployment of express checkout lines at supermarkets Deployment of express checkout lines at supermarkets Maarten Schimmel Research paper Business Analytics April, 213 Supervisor: René Bekker Faculty of Sciences VU University Amsterdam De Boelelaan 181 181

More information

Linear Programming I

Linear Programming I Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins

More information

Algebra 1 Course Title

Algebra 1 Course Title Algebra 1 Course Title Course- wide 1. What patterns and methods are being used? Course- wide 1. Students will be adept at solving and graphing linear and quadratic equations 2. Students will be adept

More information

Increasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.

Increasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all. 1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.

More information

Chapter 4 One Dimensional Kinematics

Chapter 4 One Dimensional Kinematics Chapter 4 One Dimensional Kinematics 41 Introduction 1 4 Position, Time Interval, Displacement 41 Position 4 Time Interval 43 Displacement 43 Velocity 3 431 Average Velocity 3 433 Instantaneous Velocity

More information

Lecture 7: Finding Lyapunov Functions 1

Lecture 7: Finding Lyapunov Functions 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1

More information

Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10

Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10 Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 10 Boundary Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction

More information

A New Nature-inspired Algorithm for Load Balancing

A New Nature-inspired Algorithm for Load Balancing A New Nature-inspired Algorithm for Load Balancing Xiang Feng East China University of Science and Technology Shanghai, China 200237 Email: xfeng{@ecusteducn, @cshkuhk} Francis CM Lau The University of

More information

Hacking-proofness and Stability in a Model of Information Security Networks

Hacking-proofness and Stability in a Model of Information Security Networks Hacking-proofness and Stability in a Model of Information Security Networks Sunghoon Hong Preliminary draft, not for citation. March 1, 2008 Abstract We introduce a model of information security networks.

More information

Lecture 07: Work and Kinetic Energy. Physics 2210 Fall Semester 2014

Lecture 07: Work and Kinetic Energy. Physics 2210 Fall Semester 2014 Lecture 07: Work and Kinetic Energy Physics 2210 Fall Semester 2014 Announcements Schedule next few weeks: 9/08 Unit 3 9/10 Unit 4 9/15 Unit 5 (guest lecturer) 9/17 Unit 6 (guest lecturer) 9/22 Unit 7,

More information

Module1. x 1000. y 800.

Module1. x 1000. y 800. Module1 1 Welcome to the first module of the course. It is indeed an exciting event to share with you the subject that has lot to offer both from theoretical side and practical aspects. To begin with,

More information

G(s) = Y (s)/u(s) In this representation, the output is always the Transfer function times the input. Y (s) = G(s)U(s).

G(s) = Y (s)/u(s) In this representation, the output is always the Transfer function times the input. Y (s) = G(s)U(s). Transfer Functions The transfer function of a linear system is the ratio of the Laplace Transform of the output to the Laplace Transform of the input, i.e., Y (s)/u(s). Denoting this ratio by G(s), i.e.,

More information

Three-dimensional figure showing the operation of the CRT. The dotted line shows the path traversed by an example electron.

Three-dimensional figure showing the operation of the CRT. The dotted line shows the path traversed by an example electron. Physics 241 Lab: Cathode Ray Tube http://bohr.physics.arizona.edu/~leone/ua/ua_spring_2010/phys241lab.html NAME: Section 1: 1.1. A cathode ray tube works by boiling electrons off a cathode heating element

More information

3. Reaction Diffusion Equations Consider the following ODE model for population growth

3. Reaction Diffusion Equations Consider the following ODE model for population growth 3. Reaction Diffusion Equations Consider the following ODE model for population growth u t a u t u t, u 0 u 0 where u t denotes the population size at time t, and a u plays the role of the population dependent

More information

Rolle s Theorem. q( x) = 1

Rolle s Theorem. q( x) = 1 Lecture 1 :The Mean Value Theorem We know that constant functions have derivative zero. Is it possible for a more complicated function to have derivative zero? In this section we will answer this question

More information

ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE

ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE YUAN TIAN This synopsis is designed merely for keep a record of the materials covered in lectures. Please refer to your own lecture notes for all proofs.

More information

Statistical Forecasting of High-Way Traffic Jam at a Bottleneck

Statistical Forecasting of High-Way Traffic Jam at a Bottleneck Metodološki zvezki, Vol. 9, No. 1, 2012, 81-93 Statistical Forecasting of High-Way Traffic Jam at a Bottleneck Igor Grabec and Franc Švegl 1 Abstract Maintenance works on high-ways usually require installation

More information

Algebra I Vocabulary Cards

Algebra I Vocabulary Cards Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Absolute Value Order of Operations Expression

More information

Lectures 5-6: Taylor Series

Lectures 5-6: Taylor Series Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,

More information

15.062 Data Mining: Algorithms and Applications Matrix Math Review

15.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 information

Chapter 7. Lyapunov Exponents. 7.1 Maps

Chapter 7. Lyapunov Exponents. 7.1 Maps Chapter 7 Lyapunov Exponents Lyapunov exponents tell us the rate of divergence of nearby trajectories a key component of chaotic dynamics. For one dimensional maps the exponent is simply the average

More information

Inner Product Spaces

Inner 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 information

SOLUTIONS. f x = 6x 2 6xy 24x, f y = 3x 2 6y. To find the critical points, we solve

SOLUTIONS. f x = 6x 2 6xy 24x, f y = 3x 2 6y. To find the critical points, we solve SOLUTIONS Problem. Find the critical points of the function f(x, y = 2x 3 3x 2 y 2x 2 3y 2 and determine their type i.e. local min/local max/saddle point. Are there any global min/max? Partial derivatives

More information

Indiana State Core Curriculum Standards updated 2009 Algebra I

Indiana State Core Curriculum Standards updated 2009 Algebra I Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and

More information

1 Portfolio mean and variance

1 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 information

In this section, we will consider techniques for solving problems of this type.

In this section, we will consider techniques for solving problems of this type. Constrained optimisation roblems in economics typically involve maximising some quantity, such as utility or profit, subject to a constraint for example income. We shall therefore need techniques for solving

More information

Section 1.1. Introduction to R n

Section 1.1. Introduction to R n The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

More information

4 Lyapunov Stability Theory

4 Lyapunov Stability Theory 4 Lyapunov Stability Theory In this section we review the tools of Lyapunov stability theory. These tools will be used in the next section to analyze the stability properties of a robot controller. We

More information

Week 7 - Game Theory and Industrial Organisation

Week 7 - Game Theory and Industrial Organisation Week 7 - Game Theory and Industrial Organisation The Cournot and Bertrand models are the two basic templates for models of oligopoly; industry structures with a small number of firms. There are a number

More information

Optimal Design of α-β-(γ) Filters

Optimal Design of α-β-(γ) Filters Optimal Design of --(γ) Filters Dirk Tenne Tarunraj Singh, Center for Multisource Information Fusion State University of New York at Buffalo Buffalo, NY 426 Abstract Optimal sets of the smoothing parameter

More information

CHAPTER 7 APPLICATIONS TO MARKETING. Chapter 7 p. 1/54

CHAPTER 7 APPLICATIONS TO MARKETING. Chapter 7 p. 1/54 CHAPTER 7 APPLICATIONS TO MARKETING Chapter 7 p. 1/54 APPLICATIONS TO MARKETING State Equation: Rate of sales expressed in terms of advertising, which is a control variable Objective: Profit maximization

More information

AP Physics 1 and 2 Lab Investigations

AP 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 information

Nonparametric adaptive age replacement with a one-cycle criterion

Nonparametric adaptive age replacement with a one-cycle criterion Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk

More information

The Heat Equation. Lectures INF2320 p. 1/88

The Heat Equation. Lectures INF2320 p. 1/88 The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)

More information

EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL

EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL Exit Time problems and Escape from a Potential Well Escape From a Potential Well There are many systems in physics, chemistry and biology that exist

More information

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year. This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra

More information

Understanding Basic Calculus

Understanding Basic Calculus Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other

More information

Chapter 10: Network Flow Programming

Chapter 10: Network Flow Programming Chapter 10: Network Flow Programming Linear programming, that amazingly useful technique, is about to resurface: many network problems are actually just special forms of linear programs! This includes,

More information

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE 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 information

Search Heuristics for Load Balancing in IP-networks

Search Heuristics for Load Balancing in IP-networks Search Heuristics for Load Balancing in IP-networks Mattias Söderqvist Swedish Institute of Computer Science mso@sics.se 3rd March 25 SICS Technical Report T25:4 ISSN 11-3154 ISRN:SICS-T--25/4-SE Abstract

More information

LABEL PROPAGATION ON GRAPHS. SEMI-SUPERVISED LEARNING. ----Changsheng Liu 10-30-2014

LABEL PROPAGATION ON GRAPHS. SEMI-SUPERVISED LEARNING. ----Changsheng Liu 10-30-2014 LABEL PROPAGATION ON GRAPHS. SEMI-SUPERVISED LEARNING ----Changsheng Liu 10-30-2014 Agenda Semi Supervised Learning Topics in Semi Supervised Learning Label Propagation Local and global consistency Graph

More information

The dynamic equation for the angular motion of the wheel is R w F t R w F w ]/ J w

The dynamic equation for the angular motion of the wheel is R w F t R w F w ]/ J w Chapter 4 Vehicle Dynamics 4.. Introduction In order to design a controller, a good representative model of the system is needed. A vehicle mathematical model, which is appropriate for both acceleration

More information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM 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 information

Review of Basic Options Concepts and Terminology

Review of Basic Options Concepts and Terminology Review of Basic Options Concepts and Terminology March 24, 2005 1 Introduction The purchase of an options contract gives the buyer the right to buy call options contract or sell put options contract some

More information

OPRE 6201 : 2. Simplex Method

OPRE 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 information

Analysis of a Production/Inventory System with Multiple Retailers

Analysis of a Production/Inventory System with Multiple Retailers Analysis of a Production/Inventory System with Multiple Retailers Ann M. Noblesse 1, Robert N. Boute 1,2, Marc R. Lambrecht 1, Benny Van Houdt 3 1 Research Center for Operations Management, University

More information

MATHEMATICS FOR ENGINEERING BASIC ALGEBRA

MATHEMATICS 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 information

Economics 2020a / HBS 4010 / HKS API-111 FALL 2010 Solutions to Practice Problems for Lectures 1 to 4

Economics 2020a / HBS 4010 / HKS API-111 FALL 2010 Solutions to Practice Problems for Lectures 1 to 4 Economics 00a / HBS 4010 / HKS API-111 FALL 010 Solutions to Practice Problems for Lectures 1 to 4 1.1. Quantity Discounts and the Budget Constraint (a) The only distinction between the budget line with

More information

Introduction to Support Vector Machines. Colin Campbell, Bristol University

Introduction to Support Vector Machines. Colin Campbell, Bristol University Introduction to Support Vector Machines Colin Campbell, Bristol University 1 Outline of talk. Part 1. An Introduction to SVMs 1.1. SVMs for binary classification. 1.2. Soft margins and multi-class classification.

More information

Insurance. Michael Peters. December 27, 2013

Insurance. Michael Peters. December 27, 2013 Insurance Michael Peters December 27, 2013 1 Introduction In this chapter, we study a very simple model of insurance using the ideas and concepts developed in the chapter on risk aversion. You may recall

More information

4.3 Lagrange Approximation

4.3 Lagrange Approximation 206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average

More information

The degree of a polynomial function is equal to the highest exponent found on the independent variables.

The degree of a polynomial function is equal to the highest exponent found on the independent variables. DETAILED SOLUTIONS AND CONCEPTS - POLYNOMIAL FUNCTIONS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions and Comments to ingrid.stewart@csn.edu. Thank you! PLEASE NOTE

More information

2013 MBA Jump Start Program

2013 MBA Jump Start Program 2013 MBA Jump Start Program Module 2: Mathematics Thomas Gilbert Mathematics Module Algebra Review Calculus Permutations and Combinations [Online Appendix: Basic Mathematical Concepts] 2 1 Equation of

More information

Chapter 21: The Discounted Utility Model

Chapter 21: The Discounted Utility Model Chapter 21: The Discounted Utility Model 21.1: Introduction This is an important chapter in that it introduces, and explores the implications of, an empirically relevant utility function representing intertemporal

More information

7 Gaussian Elimination and LU Factorization

7 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 information

The Mathematics of Traffic in Networks

The Mathematics of Traffic in Networks The Mathematics of Traffic in Networks Frank Kelly 1 Introduction We are all familiar with congested roads, and perhaps also with congestion in other networks such as the Internet, so it is obviously important

More information

Adaptive Online Gradient Descent

Adaptive Online Gradient Descent Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

More information

15 Kuhn -Tucker conditions

15 Kuhn -Tucker conditions 5 Kuhn -Tucker conditions Consider a version of the consumer problem in which quasilinear utility x 2 + 4 x 2 is maximised subject to x +x 2 =. Mechanically applying the Lagrange multiplier/common slopes

More information

University 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 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 information

Macroeconomics Lecture 1: The Solow Growth Model

Macroeconomics Lecture 1: The Solow Growth Model Macroeconomics Lecture 1: The Solow Growth Model Richard G. Pierse 1 Introduction One of the most important long-run issues in macroeconomics is understanding growth. Why do economies grow and what determines

More information

In addition to looking for applications that can be profitably examined algebraically,

In addition to looking for applications that can be profitably examined algebraically, The mathematics of stopping your car Eric Wood National Institute of Education, Singapore In addition to looking for applications that can be profitably examined algebraically, numerically

More information

Inner product. Definition of inner product

Inner product. Definition of inner product Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product

More information

Random graphs with a given degree sequence

Random graphs with a given degree sequence Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.

More information

CONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation

CONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in

More information

MULTIVARIATE PROBABILITY DISTRIBUTIONS

MULTIVARIATE PROBABILITY DISTRIBUTIONS MULTIVARIATE PROBABILITY DISTRIBUTIONS. PRELIMINARIES.. Example. Consider an experiment that consists of tossing a die and a coin at the same time. We can consider a number of random variables defined

More information

TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

More information

Microeconomic Theory: Basic Math Concepts

Microeconomic Theory: Basic Math Concepts Microeconomic Theory: Basic Math Concepts Matt Van Essen University of Alabama Van Essen (U of A) Basic Math Concepts 1 / 66 Basic Math Concepts In this lecture we will review some basic mathematical concepts

More information

Solution of Linear Systems

Solution 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 information

Using the Theory of Reals in. Analyzing Continuous and Hybrid Systems

Using the Theory of Reals in. Analyzing Continuous and Hybrid Systems Using the Theory of Reals in Analyzing Continuous and Hybrid Systems Ashish Tiwari Computer Science Laboratory (CSL) SRI International (SRI) Menlo Park, CA 94025 Email: ashish.tiwari@sri.com Ashish Tiwari

More information

If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?

If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question

More information