Notes on Kehoe Perri, Econometrica 2002
|
|
- Godfrey Wilkinson
- 5 years ago
- Views:
Transcription
1 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 However, I have gathered all the equatons together, and added a few more steps n the computatons n places. 1 Model Planner s objectve " max λ 1 β t π(s c1 (s t,l 1 (s t + λ 2 c2 (s t,l 2 (s t # t=0 s t t=0 s t Resource constrants c (s t +k (s t = F (k (s t 1,A (s t l (s t + (1 δk (s t 1 t, s t Enforcement constrants r=t s r β r t π(s r s t U (c (s r,l (s r V (k (s t 1,s t, t, s t Autarky problem V (k (s t 1,s t =max β r t π(s r s t U(c (s r,l (s r r=t s r subject to c (s r +k (s r F (k (s r 1,A (s r l (s r + (1 δk (s r 1 r, s r 1
2 Lagrangan for planner s problem max λ 1 β t π(s t U c1 (s t,l 1 (s t + λ 2 β t π(s t U c2 (s t,l 2 (s t {c (s t,l (s t,k (s t } t=0 s t t=0 s " t # + β t π(s t μ (s t β r t π(s r s t U (c (s r,l (s r V (k (s t 1,s t t=0 s t r=t s r + β t π(s t γ(s t F (k (s t 1,A (s t l (s t + (1 δk (s t 1 c (s t +k (s t t=0 s t Now note that π(s r =π(s r s t π(s t. Note also that there s a partal summaton formula of Abel whch ponts out that P β t μ t β r t P u(c r = β t M t u(c t t=0 r=t t=0 where M t = M t 1 + μ t,m 1 =0 Lets apply ths to the Lagrangan max + {c (s t,l (s t,k (s t } t=0 s t + resource constrants β t π(s t M (s t U c (s t,l (s t μ (s t V (k (s t 1,s t where M (s t =M (s t 1 +μ (s t M (s 1 =λ KP nstead choose to wrte max β t π(s t M (s t 1 U c (s t,l (s t + μ (s t U c (s t,l (s t V (k (s t 1,s t {c (s t,l (s t,k (s t } t=0 s t + β t π(s t γ(s t F (k (s t 1,A (s t l (s t + (1 δk (s t 1 c (s t +k (s t t=0 s t (we wll use ths to compute frst order condtons 2 Frst order condtons 1. c (s t β t π(s t M (s t 1 U c (s t +β t π(s t μ (s t U c (s t β t π(s t γ(s t =0 2
3 Combnng the FOCs for the two countres, we get U 1c (s t M 1 (s t 1 +μ 1 (s t = U 2c (s t M 2 (s t 1 +μ 2 (s t or U 1c (s t U 2c (s t = M 2(s t 1 +μ 2 (s t M 1 (s t 1 +μ 1 (s t (note ths mples rato of sum of past multplers defnes relatve margnal values - mplcatons wthout partcpaton constrants 2. l (s t β t π(s t M (s t U l (s t +β t π(s t μ (s t U l (s t +β t π(s t γ(s t F l (s t =0 Combnng ths wth the FOC for c (s t gves U l(s t (M (s t +μ (s t F l (s t or U l(s t F l (s t = U c (s t M (s t +μ (s t = U c (s t 3. k (s t β t π(s t γ(s t +β t+1 s t+1 π(s t,s t+1 γ(s t,s t+1 r (s t,s t+1 μ (s t,s t+1 V k (k (s t, s t,s t+1 =0 U c (s t M (s t 1 +μ (s t = β s t+1 π(s t,s t+1 π(s t Uc (s t+1 M (s t +μ (s t+1 r (s t+1 μ (s t,s t+1 V k (k (s t, s t,s t+1 U c (s t = β π(s t+1 s t U c (s t+1 M (s t+1 s t+1 V k (k (s t, (s t,s t+1 M (s t r (s t,s t+1 μ (s t,s t+1 M (s t = β π(s t+1 s t U c (s t+1 r (s t+1 + μ (s t+1 Uc M s (s t (s t+1 r (s t+1 V k (k (s t, (s t,s t+1 t+1 where r (s t+1 =F k (s t+1 +(1 δ From the autarky problem, V k (k (s t,s t+1 =Uc Aut (s t+1 r Aut (s t+1 Comment: If no constrants are bndng, the captal accumulaton FOC s standard. Otherwse thngs look dfferent. If you thnk agent 1 s constrant 3
4 mght bnd tomorrow (μ 1 (s t+1 > 0 then the reason must be that you thnk autarky consumpton wll be hgh, so V 1k (k 1 (s t,s t+1 wll be low - lower than U c (s t+1 r (s t+1 - so the RHS of the nter-temporal FOC s larger that n the absence of the enforcement constrant. One mght thnk that ths would suggest the planner should ncrease k 1 (s t, to reduce r (s t+1. However, ncreasng k 1 (s t drves V 1k (k 1 (s t,s t+1 further down, makng the RHS even larger. Thus the planner actually reduces k 1 (s t. Ths s (roughly the ntuton for why n ths economy, net exports are pro-cyclal: when country 1 has a postve persstent productvty shock - and s therefore tempted to default - the planner reduces k 1 (s t and ncreases k 2 (s t. The reducton s k 1 (s t reduces the value of default n the next perod, and the ncreased k 2 (s t makes potental future transfers from country 2 larger, ncreasng value nsde the contract. 3 New State Varables As n the smpler Kocherlakota economy, Kehoe and Perr then defne some new varables v (s t = μ (s t M (s t 1 v (s t = M (s t μ (s t M (s t = M (s t 1 M (s t z(s t = M 2(s t M 1 (s t Then M (s t = M (s t 1 1 v (s t and thus z(s t = 1 v 1(s t 1 v 2 (s t z(st 1 Now the frst order condtons for consumpton and captal can be rewrtten as and U 1c (s t U 2c (s t = M 2(s t +μ 2 (s t M 1 (s t 1 +μ 1 (s t = z(st = 1 v 1(s t 1 v 2 (s t z(st 1 U c (s t =β s t+1 π(s t+1 s t Uc (s t+1 r (s t+1 1 v (s t+1 v (s t+1 1 v (s t+1 V k(k (s t,s t+1 Kehoe and Perr focus on Markov shocks, so that π(s t s t 1 =π(s t s t 1. Then look for decson rules c (x t,l (x t,k (x t together wth polcy rules for z(x t and v (x t where the state x t = z(s t 1,k 1 (s t 1,k 2 (s t 1,s t. Thus ths s the same state space we used to solve the Kocherlakota model, except that k 1 (s t 1 and k 2 (s t 1 have been added. 4
5 4 Computaton procedure Let x =(z,k 1,k 2,s be the state (note that the notaton s a bt confusng, snce the understandng s that z, k 1 and k 2 are nherted from the prevous perod, and do not depend on the current state s. Defne also value functons W (x =U(c (x,l (x + β s 0 π(s 0 sw (x 0 Defne a grd on the state space (.e a three dmensonal grd over the three contnuous varables z, k 1 and k 2 for each possble (dscrete value for s. Guess c 0 (x,l0 (x,k00 (x,z00 (x,v 0(x,W0 (xª x. One good ntal guess s the soluton to the plannng problem wthout enforcement constrants. Note that these allocatons correspond to the allocatons that would emerge n a decentralzed economy wth a complete set of asset markets and no enforcement problems. Now procede to update the guess. Suppose, we are on the n th teraton n updatng the vector of unknown functons, and suppose we are at pont q n the grd. Frst assume nether enforcement constrant bnds. Thus mmedately v (q = 0 and z 0 (q =z. Compute (c (q,l (q,k 0 (q (6 numbers that satsfy 1. The consumpton lesure FOC for both agents (2 equatons U l (q F l (q = U c(q 2. The expresson for z (1 equaton U 1c (q U 2c (q = z0 (q 3. The world resource constrant (1 equaton [c (q+k(q] 0 = [F (k (q,a (ql (q + (1 δk (q] 4. The FOCs for captal (2 equatons U c (c (q,l (q = β π(s 0 s s0 U c (c n 1 (x 0,l n 1 (x 0 F k(k 0(q,A(s0 l n 1 (x δ (x 0 Note that, to evaluate c,l and v n the next perod, we use the old guesses for the decson rules polcy functons (superscrpt n 1. The unknowns n ths equaton are c (q, l (q and k 0 (q. Note, however, that although we use the old functons for next perod varables, we do evaluate them at the correct pont: x 0 =(z 0 (q,k1 0 (q,k0 2 (q,s0. vn 1 (x 0 (x 0 V k(k 0 (q,s 0 5
6 Thus at ths pont we solve a system of 6 non-lnear equatons n 6 unknowns. Then we check whether ether of the two enforcement constrants s volated. If nether s, we are done wth ths grd pont. Alternatvely suppose one of the enforcement constrants s volated (say the one for country 1. Then we solve a dfferent system of equatons. Now we look for (c (q,l (q,k 0(q,v 1(q,z 0 (q (8 numbers that satsfy 1. The consumpton lesure FOC for both agents (2 equatons U l (q F l (q = U c(q 2. The expresson for z (1 equaton U 1c (q U 2c (q = z0 (q 3. The law of moton for z (1 equaton z0(q = 1 v 1(q z 1 4. The world resource constrant (1 equaton [c (q+k(q] 0 = [F (k (q,a (ql (q + (1 δk (q] 5. The FOCs for captal (2 equatons U c (c (q,l (q = β π(s0 s U c (c n 1 (x 0,l n 1 s0 (x 0 F k(k 0(q,A(s0 l n 1 (x δ (x 0 6. The enforcment constrant for country 1 s an equalty (1 equaton vn 1 (x 0 (x 0 V k(k 0 (q,s 0 U c (c (q,l (q + β s 0 π(s 0 sw n 1 (x 0 =V (k,s Note that n equlbrum, f the planner s dong ts job, t wll not be the case the both enforcement constrants bnd smultaneously. Once decson rules have been updated at one pont n the grd, we move to the next pont, and contnue untl decson rules have been updated. Now (and only now we can update the value functons, for each x. For example, for x = q W n (q =U(c n (q,l n (q + β s 0 π(s 0 sw n 1 (x 0 (q If the new value functons are cloes to the old for every x, we are done. Otherwse, we need to repeat the entre process. It s mportant the the ntal guess for the value functons s unformly greater than or equal to the true value of the value functon. 6
Economics 8105 Macroeconomic Theory Recitation 1
Economcs 8105 Macroeconomc Theory Rectaton 1 Outlne: Conor Ryan September 6th, 2016 Adapted From Anh Thu (Monca) Tran Xuan s Notes Last Updated September 20th, 2016 Dynamc Economc Envronment Arrow-Debreu
More informationEquilibrium with Complete Markets. Instructor: Dmytro Hryshko
Equlbrum wth Complete Markets Instructor: Dmytro Hryshko 1 / 33 Readngs Ljungqvst and Sargent. Recursve Macroeconomc Theory. MIT Press. Chapter 8. 2 / 33 Equlbrum n pure exchange, nfnte horzon economes,
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationk t+1 + c t A t k t, t=0
Macro II (UC3M, MA/PhD Econ) Professor: Matthas Kredler Fnal Exam 6 May 208 You have 50 mnutes to complete the exam There are 80 ponts n total The exam has 4 pages If somethng n the queston s unclear,
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 informationWelfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?
APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare
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 informationPROBLEM SET 7 GENERAL EQUILIBRIUM
PROBLEM SET 7 GENERAL EQUILIBRIUM Queston a Defnton: An Arrow-Debreu Compettve Equlbrum s a vector of prces {p t } and allocatons {c t, c 2 t } whch satsfes ( Gven {p t }, c t maxmzes βt ln c t subject
More informationSupporting Information for: Two Monetary Models with Alternating Markets
Supportng Informaton for: Two Monetary Models wth Alternatng Markets Gabrele Camera Chapman Unversty & Unversty of Basel YL Chen St. Lous Fed November 2015 1 Optmal choces n the CIA model On date t, gven
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 informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
More informationSupporting Materials for: Two Monetary Models with Alternating Markets
Supportng Materals for: Two Monetary Models wth Alternatng Markets Gabrele Camera Chapman Unversty Unversty of Basel YL Chen Federal Reserve Bank of St. Lous 1 Optmal choces n the CIA model On date t,
More informationA NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegian Business School 2011
A NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegan Busness School 2011 Functons featurng constant elastcty of substtuton CES are wdely used n appled economcs and fnance. In ths note, I do two thngs. Frst,
More informationEconomics 2450A: Public Economics Section 10: Education Policies and Simpler Theory of Capital Taxation
Economcs 2450A: Publc Economcs Secton 10: Educaton Polces and Smpler Theory of Captal Taxaton Matteo Parads November 14, 2016 In ths secton we study educaton polces n a smplfed verson of framework analyzed
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 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 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 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 informationMixed Taxation and Production Efficiency
Floran Scheuer 2/23/2016 Mxed Taxaton and Producton Effcency 1 Overvew 1. Unform commodty taxaton under non-lnear ncome taxaton Atknson-Stgltz (JPubE 1976) Theorem Applcaton to captal taxaton 2. Unform
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 informationHow Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists *
How Strong Are Weak Patents? Joseph Farrell and Carl Shapro Supplementary Materal Lcensng Probablstc Patents to Cournot Olgopolsts * September 007 We study here the specal case n whch downstream competton
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
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 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 information9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set
More informationApplied Stochastic Processes
STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of
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 informationOnline Appendix: Reciprocity with Many Goods
T D T A : O A Kyle Bagwell Stanford Unversty and NBER Robert W. Stager Dartmouth College and NBER March 2016 Abstract Ths onlne Appendx extends to a many-good settng the man features of recprocty emphaszed
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 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 informationPoisson brackets and canonical transformations
rof O B Wrght Mechancs Notes osson brackets and canoncal transformatons osson Brackets Consder an arbtrary functon f f ( qp t) df f f f q p q p t But q p p where ( qp ) pq q df f f f p q q p t In order
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
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 informationCS294 Topics in Algorithmic Game Theory October 11, Lecture 7
CS294 Topcs n Algorthmc Game Theory October 11, 2011 Lecture 7 Lecturer: Chrstos Papadmtrou Scrbe: Wald Krchene, Vjay Kamble 1 Exchange economy We consder an exchange market wth m agents and n goods. Agent
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 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 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 informationMean Field / Variational Approximations
Mean Feld / Varatonal Appromatons resented by Jose Nuñez 0/24/05 Outlne Introducton Mean Feld Appromaton Structured Mean Feld Weghted Mean Feld Varatonal Methods Introducton roblem: We have dstrbuton but
More informationf(x,y) = (4(x 2 4)x,2y) = 0 H(x,y) =
Problem Set 3: Unconstraned mzaton n R N. () Fnd all crtcal ponts of f(x,y) (x 4) +y and show whch are ma and whch are mnma. () Fnd all crtcal ponts of f(x,y) (y x ) x and show whch are ma and whch are
More informationTHE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.
THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY Wllam A. Pearlman 2002 References: S. Armoto - IEEE Trans. Inform. Thy., Jan. 1972 R. Blahut - IEEE Trans. Inform. Thy., July 1972 Recall
More informationcoordinates. Then, the position vectors are described by
Revewng, what we have dscussed so far: Generalzed coordnates Any number of varables (say, n) suffcent to specfy the confguraton of the system at each nstant to tme (need not be the mnmum number). In general,
More informationDECOUPLING THEORY HW2
8.8 DECOUPLIG THEORY HW2 DOGHAO WAG DATE:OCT. 3 207 Problem We shall start by reformulatng the problem. Denote by δ S n the delta functon that s evenly dstrbuted at the n ) dmensonal unt sphere. As a temporal
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 informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationIn the figure below, the point d indicates the location of the consumer that is under competition. Transportation costs are given by td.
UC Berkeley Economcs 11 Sprng 006 Prof. Joseph Farrell / GSI: Jenny Shanefelter Problem Set # - Suggested Solutons. 1.. In ths problem, we are extendng the usual Hotellng lne so that now t runs from [-a,
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
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 information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
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 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 informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
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 informationIntroduction 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 informationCHAPTER 7 CONSTRAINED OPTIMIZATION 2: SQP AND GRG
Chapter 7: Constraned Optmzaton CHAPER 7 CONSRAINED OPIMIZAION : SQP AND GRG Introducton In the prevous chapter we eamned the necessary and suffcent condtons for a constraned optmum. We dd not, however,
More information8 Derivation of Network Rate Equations from Single- Cell Conductance Equations
Physcs 178/278 - Davd Klenfeld - Wnter 2015 8 Dervaton of Network Rate Equatons from Sngle- Cell Conductance Equatons We consder a network of many neurons, each of whch obeys a set of conductancebased,
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 informationUniversity of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D.
Unversty of Calforna, Davs Date: June 22, 29 Department of Agrcultural and Resource Economcs Department of Economcs Tme: 5 hours Mcroeconomcs Readng Tme: 2 mnutes PRELIMIARY EXAMIATIO FOR THE Ph.D. DEGREE
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More information14 Lagrange Multipliers
Lagrange Multplers 14 Lagrange Multplers The Method of Lagrange Multplers s a powerful technque for constraned optmzaton. Whle t has applcatons far beyond machne learnng t was orgnally developed to solve
More informationJAB Chain. Long-tail claims development. ASTIN - September 2005 B.Verdier A. Klinger
JAB Chan Long-tal clams development ASTIN - September 2005 B.Verder A. Klnger Outlne Chan Ladder : comments A frst soluton: Munch Chan Ladder JAB Chan Chan Ladder: Comments Black lne: average pad to ncurred
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More information1 The Sidrauski model
The Sdrausk model There are many ways to brng money nto the macroeconomc debate. Among the fundamental ssues n economcs the treatment of money s probably the LESS satsfactory and there s very lttle agreement
More informationRyan (2009)- regulating a concentrated industry (cement) Firms play Cournot in the stage. Make lumpy investment decisions
1 Motvaton Next we consder dynamc games where the choce varables are contnuous and/or dscrete. Example 1: Ryan (2009)- regulatng a concentrated ndustry (cement) Frms play Cournot n the stage Make lumpy
More informationSupport Vector Machines CS434
Support Vector Machnes CS434 Lnear Separators Many lnear separators exst that perfectly classfy all tranng examples Whch of the lnear separators s the best? + + + + + + + + + Intuton of Margn Consder ponts
More informationSELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.
SELECTED SOLUTIONS, SECTION 4.3 1. Weak dualty Prove that the prmal and dual values p and d defned by equatons 4.3. and 4.3.3 satsfy p d. We consder an optmzaton problem of the form The Lagrangan for ths
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More information8 Derivation of Network Rate Equations from Single- Cell Conductance Equations
Physcs 178/278 - Davd Klenfeld - Wnter 2019 8 Dervaton of Network Rate Equatons from Sngle- Cell Conductance Equatons Our goal to derve the form of the abstract quanttes n rate equatons, such as synaptc
More informationσ τ τ τ σ τ τ τ σ Review Chapter Four States of Stress Part Three Review Review
Chapter Four States of Stress Part Three When makng your choce n lfe, do not neglect to lve. Samuel Johnson Revew When we use matrx notaton to show the stresses on an element The rows represent the axs
More informationand problem sheet 2
-8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,
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 informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationComparative Advantage and Optimal Trade Taxes
Comparatve Advantage and Optmal Trade Taxes Arnaud Costnot (MIT), Dave Donaldson (MIT), Jonathan Vogel (Columba) and Iván Wernng (MIT) June 2014 Motvaton Two central questons... 1. Why do natons trade?
More informationFinal Exam - Solutions
EC 70 - Math for Economsts Samson Alva Department of Economcs, Boston College December 13, 011 Fnal Exam - Solutons 1. Job Search (a) The agent s utlty functon has no explct dependence on tme, except through
More informationON MECHANICS WITH VARIABLE NONCOMMUTATIVITY
ON MECHANICS WITH VARIABLE NONCOMMUTATIVITY CIPRIAN ACATRINEI Natonal Insttute of Nuclear Physcs and Engneerng P.O. Box MG-6, 07725-Bucharest, Romana E-mal: acatrne@theory.npne.ro. Receved March 6, 2008
More information3.2. Cournot Model Cournot Model
Matlde Machado Assumptons: All frms produce an homogenous product The market prce s therefore the result of the total supply (same prce for all frms) Frms decde smultaneously how much to produce Quantty
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
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 informationGames of Threats. Elon Kohlberg Abraham Neyman. Working Paper
Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017
More informationSolution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method
Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222
More information( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1
Problem Set 4 Suggested Solutons Problem (A) The market demand functon s the soluton to the followng utlty-maxmzaton roblem (UMP): The Lagrangean: ( x, x, x ) = + max U x, x, x x x x st.. x + x + x y x,
More informationSingle Variable Optimization
8/4/07 Course Instructor Dr. Raymond C. Rump Oce: A 337 Phone: (95) 747 6958 E Mal: rcrump@utep.edu Topc 8b Sngle Varable Optmzaton EE 4386/530 Computatonal Methods n EE Outlne Mathematcal Prelmnares Sngle
More information10.34 Fall 2015 Metropolis Monte Carlo Algorithm
10.34 Fall 2015 Metropols Monte Carlo Algorthm The Metropols Monte Carlo method s very useful for calculatng manydmensonal ntegraton. For e.g. n statstcal mechancs n order to calculate the prospertes of
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 informationLecture Notes, January 11, 2010
Economcs 200B UCSD Wnter 2010 Lecture otes, January 11, 2010 Partal equlbrum comparatve statcs Partal equlbrum: Market for one good only wth supply and demand as a functon of prce. Prce s defned as the
More informationProblem adapted reduced models based on Reaction-Diffusion Manifolds (REDIMs)
Problem adapted reduced models based on Reacton-Dffuson Manfolds (REDIMs) V Bykov, U Maas Thrty-Second Internatonal Symposum on ombuston, Montreal, anada, 3-8 August, 8 Problem Statement: Smulaton of reactng
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationManaging Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration
Managng Caacty Through eward Programs on-lne comanon age Byung-Do Km Seoul Natonal Unversty College of Busness Admnstraton Mengze Sh Unversty of Toronto otman School of Management Toronto ON M5S E6 Canada
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models
More informationPrice competition with capacity constraints. Consumers are rationed at the low-price firm. But who are the rationed ones?
Prce competton wth capacty constrants Consumers are ratoned at the low-prce frm. But who are the ratoned ones? As before: two frms; homogeneous goods. Effcent ratonng If p < p and q < D(p ), then the resdual
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
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 informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
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 informationOnline Appendix. t=1 (p t w)q t. Then the first order condition shows that
Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate
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 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 information