Delay Di erential Equations and Oscillations
|
|
- Gwen Brown
- 5 years ago
- Views:
Transcription
1 Lecture 2 Delay D erental Equatons and Oscllatons Readng: Most of the materal n today s lecture comes from Chapter 1, pages of James D. Murray (22), Mathematcal Bology I: An Introducton, 3rd edton. If you are at the unversty, ether physcally or va the VPN, you can read an onlne verson at Logstc growth revsted One of the shortcomngs of Malthusan growth law mentoned n yesterday s lecture was that t took no account of ether gestaton (the tme t takes for a chld to grow n ts mother s womb) or the tme t takes for a newborn to grow to sexual maturty. There are, of course, many organsms for whom these are not serous objectons yeast cells reproducng n a lump of rsng bread dough have nether gestaton nor sexual maturaton but today I ll ntroduce a mathematcal tool, the delay d erental equaton (DDE), capable of descrbng growth laws n whch the brth rate at tme t depends on the state of the populaton at earler tmes. The smplest DDE s a d erental equaton of the form = f(n(t), N(t T )) (2.1) where T>ssomefxeddelay. Forexample,wecouldmodfythelogstclawto get apple = rn(t) N(t T ) 1. (2.2) K It s mportant to recognse what a drastc change ths s. The models we dscussed n the frst lecture were the sort of thng you studed n the second term of the Frst Year: one can specfy a soluton unquely by settng up an ntal value problem, N(t =)=N, 2.1 = g(n).
2 If we want to know N(t) for<t<1 then, provded that g(n) sn ttoobadly behaved, all we would need to specfy s the ntal condton N(t =)=N. But for DDEs the stuaton s much more complcated more lke a partal dfferental equaton. To work out what happens on an nterval <t<t we need to specfy both the functon f(n(t), N(t T )) and a whole nterval worth of ntal data: we need to know N(t) for T < t <. To drve ths pont home, thnk about the data we need before we can compute / at t = T/2: we need both N(T/2) and N(T/2 T )=N( T/2). As you mght magne, ths make the problem consderably harder and, generally, one can t solve DDEs exactly. Despte ths added complexty, the delayed logstc model (2.2) has some behavour n common wth the orgnal, ODE verson. In partcular, the constant functons N(t) =an(t) =K are both stll solutons. But the DDE verson also supports a new possblty: oscllatory solutons. We won t generally be able to obtan exact expressons for N(t) andsobeforewebegntoanalysethedelayed logstc model I d lke to nvestgate an example where one can compute everythng explctly Malthusan growth wth mgraton and delays Recall that the very smplest growth law, / = rn, has solutons that are exponentals n tme, N(t) =N e rt, and so clearly doesn t permt oscllatons. But f we ntroduce a delay, new possbltes emerge. Suppose we consder the growth law = bn(t T ) (t) m (2.3) where b, d and m are all postve real numbers. Ths descrbes a populaton wth per-anmal brth rate b, death rate d and outward mgraton rate m (measured n beasts-per-unt-tme). The novel feature s that these beasts have a gestaton perod T, so that the number of o sprng beng born at tme t depends on the populaton at tme t T Brth, death and mgraton wthout delay The ODE verson of the model above s whch has an equlbrum at N(t) =N? = m/(b = bn m = (b d)n m (2.4) d) andgeneralsoluton N(t) =N? +(N N? )e rt where r =(b d), N? = m/r and N = N(t = ) s the ntal populaton. If b<d, so that r<, then N(t) tendston? for all ntal condtons, but f b>d, so that r>, then the behavour of N(t) ssomewhatcounter-ntutve: 8 < lm N(t) = t!1 : 1 f N >N? N? f N = N? 1 f N <N? 2.2
3 The last case, where the populaton becomes negatve, makes no bologcal sense, so t s nterestng to ask how ths problematc behavour arses. The ssue turns out to be the constant mgraton term m. It says that anmals keep mgratng away at, say, 1 beasts per week, even when the populaton has fallen to zero beasts. We can crcumvent ths problem by sayng that the model (2.4) only apples n cases where N N?. Ths restrcton rules out the pathologcal negatve populatons, though leaves open the possblty of a dvergng populaton Oscllatory solutons Let s seek solutons to (2.3), the DDE verson of the brth-plus-death-plus-mgraton model. Before we do so t s helpful to smplfy the problem by ntroducng dmensonless varables. One natural set of choces s x = N N? = N(b d) m and = bt and these lead, va calculatons smlar to those n Secton 1.4, to the DDE dx d = x( ˆT ) x( ) (1 ). (2.5) where = d/b and ˆT = bt s the dmensonless verson of the delay. Note that as we want there to be a postve net reproductve rate we need b>d>andso < < 1. It turns out that, for sutable values of the parameters, ths has oscllatory solutons of the form x( ) =A + B cos(! ). One can prove ths by computng dx/d n two ways: frst by drect d erentaton and then va the DDE (2.5). The drect route yelds dx d = d d The DDE, on other hand, says (A + B cos(! )) =!B sn(! ). (2.6) dx d = x( ˆT ) x( ) (1 ) = ha + B cos(!( ˆT )) [A + B cos(! )] (1 ) =(1 )A (1 ) h + B cos(! ˆT )cos(! )+sn(! ˆT )sn(! ) B cos(! ) =(1 )A (1 ) h + B cos(! ) cos(! ˆT ) h + B sn(! ) sn(! ˆT ). (2.7) 2.3
4 Condtons on! ˆT -1 1 cos( ) sn( ) /2 3 /2 2! ˆT Fgure 2.1: The curves above are graphs of the functon cos(! ˆT ) (green, sold) and sn(! ˆT ) (orange, dashed). They make t clear that one can satsfy both the condtons cos(! ˆT ) = and! = sn(! ˆT ) f 3 /2 <! ˆT < 2, whch ensures both cos(! ˆT ) > and sn(! ˆT ) <. Equatng expressons (2.6) and (2.7) and matchng up coe cos(!t) andsn(!t) termsyeldsthreecondtons: cents of the constant, (1 )A (1 )=, cos(! ˆT ) = and! =sn(! ˆT ). (2.8) The frst of these leads mmedately to A =1andfwelookatthesecondcondton and recall that < < 1, we see that ths mples cos(! ˆT ) >. Smlarly, the thrd condton mples that sn(! ˆT ) <. Fgure 2.1 makes t clear that both of these condtons can be satsfed provded 3 /2 <! ˆT <2. Ths means that we can fnd values of the parameters! and ˆT such that the DDE (2.3) has oscllatory solutons of the form x( ) =1+Bcos(! ). Proceed as follows: Use the second condton to obtan a value! ˆT that les n the range 3 /2 < < 2 and satsfes Ths s always possble as < < 1. = cos(! ˆT ) cos( ). Fnd! by rewrtng the thrd condton as Fnally, get ˆT by notng that! = sn(! ˆT ) = sn( ). ˆT =! ˆT! = sn( ). 2.4
5 Snusodal soluton to the DDE x(t) ! t 4! Fgure 2.2: Here s a snusodal soluton x( ) =1+B cos(! ) to the DDE (2.3) that has ampltude B =.35. The parameters are =.92, ˆT =15.4 and! =.38, whch correspond to puttng =! ˆT = 15 /8 nto the calculatons sketched n Secton Fgure 2.2 llustrates a soluton of the knd we ve just constructed. The ampltude B of the snusodal oscllaton does not enter nto the condtons (2.8) and so we are free to choose t almost arbtrarly, though we need B < 1toensurethatthe populaton never becomes negatve. Ths example may seem a bt contrved and ndeed, t s but t was desgned to produce easy calculatons and to make the pont that convertng an ODE model such as (2.4) nto a DDE can nduce oscllatons. We wll look at ways to establsh the same prncple n more general settngs, ncludng the delayed logstc model (2.2), n the remander of the lecture. 2.2 No oscllatons wthout delay I d lke to drve home the pont that delays can nduce oscllatons where none are otherwse possble. Here s a result that I learned from Murray, though I doubt that t s hs orgnally. It says that a large famly of ODE models for the populaton of a sngle-speces can never have oscllatory solutons. Defnton 2.1. A functon N : R! R s perodc wth perod T f: N(t + T )=N(t) for all t 2 R; T s the smallest value for whch the prevous condton holds and T>. The second requrement means that we do not regard constant functons as perodc and so a perodc functon s, necessarly, non-constant. Theorem 2.2 (No oscllatons wthout delay n sngle-speces models). If N(t) satsfes the d erental equaton = f(n) (2.9) for some contnuous functon f : R! R then N(t) cannot be perodc. 2.5
6 Proof. We ll prove ths by contradcton. Assume the ODE (2.9) has a perodc soluton N(t) wthperodt. Multply both sdes of the ODE by / to obtan 2 = f(n). Now ntegrate both sdes of ths expresson over a sngle perod of the oscllaton. An easy theorem (that I won t prove here) says that the result s ndependent of whch nterval we choose, so we mght as well ntegrate over apple t apple T to obtan Z T 2 Z T = f(n). (2.1) Consder frst the expresson on the left. We know that N(t) snon-constant(our defnton of a perodc functon ruled ths out explctly) and so we know / 6= somewhere n the regon of ntegraton. Thus (/) 2 s a strctly postve quantty somewhere n the nterval and so we can defne Z T 2 I = and conclude that I>. On the other hand, consder the rght-hand sde of (2.1). If we change the varable of ntegraton to N and ntroduce N = N() = N(T )weget: I = Z T f(n) Z N(T ) = f(n) = = N() Z N N f(n) where the last lne follows because we ended up ntegratng over an nterval of length zero. Ths provdes the contradcton we sought: t s mpossble that both I> and I =,sotherecannotbeanyperodcsolutonsto(2.9). 2.3 Oscllatons n the logstc law wth delay Let s conclude by returnng to the logstc DDE (2.2) apple 1 = rn(t) N(t T ) K. and makng a qualtatve argument (not aproof)sayngthattmayhaveoscllatory solutons. Suppose that at some tme t 1 we have the followng: N(t 1 )=K, t=t1 > and N(t) <K for t 1 T apple t<t 1. Ths stuaton s llustrated n Fgure 2.3 and prompts the followng observatons: 2.6
7 Logstc Growth wth Delay Populaton N(t) K 2K t 1 t 1 + T t 2 t 2 + T Tme Fgure 2.3: An llustraton of the qualtatve argument n Secton 2.3 that suggests one ought to expect oscllatory solutons to the logstc DDE (2.2). Here t 1 s a tme at whch N(t) s ncreasng and satsfes N(t) =K, whle t 2 s the next tme N(t) =K, at whch pont N(t) s decreasng. When t = t 1, N(t) =K, butn(t T ) <K, so the factor [1 N(t T )/K] that appears n the logstc DDE s postve. Ths means / > an(t) s an ncreasng functon. When t = t 1 + T, N(t T )=N(t 1 )=K, so the factor [1 N(t T )/K] vanshes, whch means that / =, and so N(t) has a crtcal pont. The crtcal pont s a local maxmum. To see ths, consder a slghtly later moment, say, t = t 1 + T + for some sutably small. Then t T>t 1 and N(t T ) >K, so the factor [1 N(t T )/K] s negatve and / <. Somewhat later, there s a tme t 2 >t 1 + T such that N(t 2 )=K, but now N(t T ) >K, so / < an(t) sadecreasngfuncton. When t = t 2 + T, N(t mnmum. T )=N(t 2 )=K, so / =an(t) hasalocal Ths oscllatory soluton N(t) ncreases from K to ts local maxmum n tme T and then also decreases from K to a local mnmum n T, so one mght expect the perod of the oscllaton to be around 4T. Although ths argument sn t especally precse n partcular, t says nothng very concrete about the length of the nterval between t 1 + T and t 2 t turns out to make a correct predcton: numercs show that the logstc DDE (2.2) does have oscllatory solutons for a wde range of values of the dmensonless quantty rt. Ths proves to be the relevant quantty because we can make a dmensonless verson of the problem wth the same change of varables that we used when analysng 2.7
8 the ODE verson of the logstc law: x = N K and = rt. The resultng dmensonless DDE s dx h d = x( ) 1 x( ˆT ) (2.11) where ˆT = rt s the dmensonless verson of the delay T. 2.8
Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More information6. Stochastic processes (2)
Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space
More information6. Stochastic processes (2)
6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process
More informationAdvanced Circuits Topics - Part 1 by Dr. Colton (Fall 2017)
Advanced rcuts Topcs - Part by Dr. olton (Fall 07) Part : Some thngs you should already know from Physcs 0 and 45 These are all thngs that you should have learned n Physcs 0 and/or 45. Ths secton s organzed
More informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationIntegrals and Invariants of Euler-Lagrange Equations
Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More information12. The Hamilton-Jacobi Equation Michael Fowler
1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationLecture Note 3. Eshelby s Inclusion II
ME340B Elastcty of Mcroscopc Structures Stanford Unversty Wnter 004 Lecture Note 3. Eshelby s Incluson II Chrs Wenberger and We Ca c All rghts reserved January 6, 004 Contents 1 Incluson energy n an nfnte
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationMechanics Physics 151
Mechancs Physcs 151 Lecture 3 Lagrange s Equatons (Goldsten Chapter 1) Hamlton s Prncple (Chapter 2) What We Dd Last Tme! Dscussed mult-partcle systems! Internal and external forces! Laws of acton and
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationFREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,
FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More information8.1 Arc Length. What is the length of a curve? How can we approximate it? We could do it following the pattern we ve used before
.1 Arc Length hat s the length of a curve? How can we approxmate t? e could do t followng the pattern we ve used before Use a sequence of ncreasngly short segments to approxmate the curve: As the segments
More informationPhysics 5153 Classical Mechanics. Principle of Virtual Work-1
P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationIntegrals and Invariants of
Lecture 16 Integrals and Invarants of Euler Lagrange Equatons NPTEL Course Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng, Indan Insttute of Scence, Banagalore
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationGeometry of Müntz Spaces
WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationChapter 3 Differentiation and Integration
MEE07 Computer Modelng Technques n Engneerng Chapter Derentaton and Integraton Reerence: An Introducton to Numercal Computatons, nd edton, S. yakowtz and F. zdarovsky, Mawell/Macmllan, 990. Derentaton
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationTemperature. Chapter Heat Engine
Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the
More informationLecture 4. Instructor: Haipeng Luo
Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationHow Differential Equations Arise. Newton s Second Law of Motion
page 1 CHAPTER 1 Frst-Order Dfferental Equatons Among all of the mathematcal dscplnes the theory of dfferental equatons s the most mportant. It furnshes the explanaton of all those elementary manfestatons
More informationMath 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationSolutions to Homework 7, Mathematics 1. 1 x. (arccos x) (arccos x) 1
Solutons to Homework 7, Mathematcs 1 Problem 1: a Prove that arccos 1 1 for 1, 1. b* Startng from the defnton of the dervatve, prove that arccos + 1, arccos 1. Hnt: For arccos arccos π + 1, the defnton
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationModelli Clamfim Equazione del Calore Lezione ottobre 2014
CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g
More informationChapter Twelve. Integration. We now turn our attention to the idea of an integral in dimensions higher than one. Consider a real-valued function f : D
Chapter Twelve Integraton 12.1 Introducton We now turn our attenton to the dea of an ntegral n dmensons hgher than one. Consder a real-valued functon f : R, where the doman s a nce closed subset of Eucldean
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationn ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More informationMath 702 Midterm Exam Solutions
Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationNotes on Kehoe Perri, Econometrica 2002
Notes on Kehoe Perr, Econometrca 2002 Jonathan Heathcote November 2nd 2005 There s nothng n these notes that s not n Kehoe Perr NBER Workng Paper 7820 or Kehoe and Perr Econometrca 2002. However, I have
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationACTM State Calculus Competition Saturday April 30, 2011
ACTM State Calculus Competton Saturday Aprl 30, 2011 ACTM State Calculus Competton Sprng 2011 Page 1 Instructons: For questons 1 through 25, mark the best answer choce on the answer sheet provde Afterward
More informationIrregular vibrations in multi-mass discrete-continuous systems torsionally deformed
(2) 4 48 Irregular vbratons n mult-mass dscrete-contnuous systems torsonally deformed Abstract In the paper rregular vbratons of dscrete-contnuous systems consstng of an arbtrary number rgd bodes connected
More informationProf. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model
EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several
More information18.781: Solution to Practice Questions for Final Exam
18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationCHAPTER 14 GENERAL PERTURBATION THEORY
CHAPTER 4 GENERAL PERTURBATION THEORY 4 Introducton A partcle n orbt around a pont mass or a sphercally symmetrc mass dstrbuton s movng n a gravtatonal potental of the form GM / r In ths potental t moves
More information