Discrete time approximation of decoupled Forward-Backward SDE with jumps

Size: px
Start display at page:

Download "Discrete time approximation of decoupled Forward-Backward SDE with jumps"

Transcription

1 Dscree me approxmaon of decoupled Forward-Backward SD wh jumps Bruno Bouchard, Romuald le To ce hs verson: Bruno Bouchard, Romuald le Dscree me approxmaon of decoupled Forward-Backward SD wh jumps Sochasc Processes and her Applcaons, lsever, 28, 118 1, pp53-75 <hal > HAL Id: hal hps://halarchves-ouveresfr/hal Submed on 8 Dec 25 HAL s a mul-dscplnary open access archve for he depos and dssemnaon of scenfc research documens, wheher hey are publshed or no The documens may come from eachng and research nsuons n France or abroad, or from publc or prvae research ceners L archve ouvere plurdscplnare HAL, es desnée au dépô e à la dffuson de documens scenfques de nveau recherche, publés ou non, émanan des éablssemens d ensegnemen e de recherche franças ou érangers, des laboraores publcs ou prvés

2 Dscree me approxmaon of decoupled Forward-Backward SD wh jumps Bruno BOUCHARD LPMA CNRS, UMR 7599 Unversé Pars 6 e-mal: bouchard@ccrjusseufr and CRST Romuald LI CRMAD CNRS, UMR 7534 Unversé Pars 9 e-mal: ele@ensaefr and CRST-NSA Ths verson : November 25 Absrac We sudy a dscree-me approxmaon for soluons of sysems of decoupled forward-backward sochasc dfferenal equaons wh jumps Assumng ha he coeffcens are Lpschz-connuous, we prove he convergence of he scheme when he number of me seps n goes o nfny When he jump coeffcen of he frs varaon process of he forward componen sasfes a non-degeneracy condon whch ensures s nversbly, we oban he opmal convergence rae n 1/2 The proof s based on a generalzaon of a remarkable resul on he pah-regulary of he soluon of he backward equaon derved by Zhang 28, 29 n he nojump case A smlar resuls obaned whou he non-degeneracy assumpon whenever he coeffcens are Cb 1 wh Lpschz dervaves Several exensons of hese resuls are dscussed In parcular, we propose a convergen scheme for he resoluon of sysems of coupled semlnear parabolc PD s Key words : Dscree-me approxmaon, forward-backward SD s wh jumps, Mallavn calculus MSC Classfcaon 2: 65C99, 6H7, 6J75 1

3 1 Inroducon In hs paper, we sudy a dscree me approxmaon scheme for he soluon of a sysem of decoupled Forward-Backward Sochasc Dfferenal quaons FBSD n shor wh jumps of he form { X = X + bx rdr + σx rdw r + Y = gx T + T h Θ r dr T Z r dw r T where Θ := X, Y, Z, Γ wh Γ := ρeueλde βx r, e µde, dr, U re µde, dr 11 Here, W s a d-dmensonal Brownan moon and µ an ndependen compensaed Posson measure µde, dr = µde, dr λdedr Such equaons naurally appear n hedgng problems, see eg yraud-losel 13, or n sochasc conrol, see eg Tang and L 26 and he recen paper Becherer 4 for an applcaon o exponenal uly maxmsaon n fnance Under sandard Lpschz assumpons on he coeffcens b, σ, β, g and h, exsence and unqueness of he soluon have been proved by Tang and L 26, hus generalzng he semnal paper of Pardoux and Peng 21 The man movaon for sudyng dscree me approxmaons of sysems of he above form s ha hey provde an alernave o classcal numercal schemes for a large class of deermnsc PD s of he form where Lu, x + h, x, u, x, σ, x x u, x, Iu, x =, ut, x = gx, 12 Lu, x := u, x + xu, xbx + 1 d σσ x j 2 u, x 2 x xj,j=1 + {u, x + βx, e u, x x u, xβx, e} λde, Iu, x := {u, x + βx, e u, x} ρe λde Indeed, s well known ha, under mld assumpons on he coeffcens, he componen Y of he soluon can be relaed o he vscosy soluon u of 12 n he sense ha Y = u, X, see eg 2 Thus solvng 11 or 12 s essenally he same In he socalled four-seps scheme, hs relaon allows o approxmae he soluon of 11 by frs esmang numercally u, see 11 and 18 Here, we follow he converse approach Snce classcal numercal schemes for PD s generally do no perform well n hgh dmenson, we wan o esmae drecly he soluon of 11 so as o provde an approxmaon of u 2

4 In he no-jump case, e β =, he numercal approxmaon of 11 has already been suded n he leraure, see eg Zhang 29, Bally and Pages 3, Bouchard and Touz 6 or Gobe e al 15 In 6, he auhors sugges he followng mplc scheme Gven a regular grd π = { = T/n, =,, n}, hey approxmae X by s uler scheme X π and Y, Z by he dscree-me process Ȳ π, Z π n defned backward by Z π π = n Ȳ +1 W +1 F Ȳ π = Ȳ π +1 F + 1 n h X π, Ȳ π, Z π where Ȳ π n := gx π n and W +1 := W +1 W In he no-jump case, urns ou ha he dscrezaon error rr n Y, Z := { max <n sup,+1 s nmaely relaed o he quany n 1 +1 = Y Ȳ π 2 n 1 + = +1 Z Z 2 d where Z := n Z Z π 2 d +1 Z d F Under Lpschz connuy condons on he coeffcens, Zhang 27 was able o prove ha he laer s of order of n 1 } 1 2 Ths remarkable resul allows o derve he bound rr n Y, Z Cn 1/2, e he above approxmaon acheves he opmal convergence rae n 1/2 In hs paper, we exend he approach of Bouchard and Touz 6 and approxmae he soluon of 11 by he backward scheme Z π π = n Ȳ +1 W +1 F Γ π π = n Ȳ ρe µde, +1, +1 F Ȳ π π = Ȳ +1 F + 1 h X π n, Ȳ π, Z π, Γ π where Ȳ π n := gx π n By adapng he argumens of Gobe e al 15, we frs prove ha our dscrezaon error rr n Y, Z, U := { max <n sup,+1 Y Ȳ π 2 n 1 + = +1 Z Z π 2 + Γ Γ π 2 d converges o as he dscresaon sep T/n ends o We hen provde upper bounds on max <n sup,+1 Y Y 2 n 1 + = +1 Z Z 2 + Γ Γ 2 d, 3 } 1 2

5 where Γ +1 := n Γ d F We frs show ha max <n sup,+1 Y Y 2 n 1 + = +1 Γ Γ 2 d C n 1 whenever he coeffcens are Lpschz connuous Under some addonal condons on he nversbly of β + I d, see H 1, or on he regulary of he coeffcen, see H 2, we hen prove ha n 1 +1 = Z Z 2 d C n 1 Ths exends o our framework he remarkable resul derved by Zhang 28, 29 n he no-jump case and allows us o show ha our dscree-me scheme acheves he opmal convergence rae n 1/2 Observe ha, n opposon o algorhms based on he approxmaon of he Brownan moon by dscree processes akng a fne number of possble values see 1, 8, 9, 1 and 17, our scheme does no provde a fully mplemenable numercal procedure snce nvolves he compuaon of a large number of condonal expecaons However, he mplemenaon of he above menoned schemes n hgh dmenson s quesonable and, n our seng, hs ssue can be solved by approxmang he condonal expecaon operaors numercally n an effcen way In he no-jump case, Bouchard and Touz 6 use he Mallavn calculus o rewre condonal expecaons as he rao of wo uncondonal expecaons whch can be esmaed by sandard Mone-Carlo mehods In he refleced case where h does no depend on Z, Bally and Pages 3 use a quanzaon approach Fnally, Gobe e al 15 have suggesed an adapaon of he so-called Longsaff and Schwarz algorhm based on non-paramerc regressons, see 16, whch also works n he case where β bu he drver does no depend on U Snce hs s no he man ssue of hs paper, we leave he heorecal sudy and numercal mplemenaon of such mehods n our seng for furher research The res of he paper s organzed as follows In Secon 2, we descrbe he approxmaon scheme and sae our man convergence resul We also dscuss several possble exensons In parcular, we propose a convergen scheme for he resoluon of sysems of coupled semlnear parabolc PD s Secon 3 conans some resuls on he Mallavn dervaves of Forward and Backward SD s Applyng hese resuls n Secon 4, we derve some regulary properes for he soluon of he backward equaon under addonal smoohness assumpons on he coeffcens We fnally use an approxmaon argumen o conclude he proof of our man heorem 4

6 Noaons : Any elemen x R d wll be denfed o a column vecor wh -h componen x and ucldan norm x For x R d, n and d N, we defne x 1,, x n as he column vecor assocaed o x 1 1,, x d 1 1,, x 1 n,, x dn n The scalar produc on R d s denoed by x y For a m d-dmensonal marx M, we noe M := sup{ Mx ; x R d, x = 1}, M s ranspose and we wre M M d f m = d Gven p N and a measured space A, A, µ A, we denoe by L p A, A, µ A ; R d, or smply L p A, A or L p A f no confuson s possble, he se of p-negrable R d -valued measurable maps on A, A, µ A For p =, L A, A, µ A ; R d s he se of essenally bounded R d -valued measurable maps The se of k-mes dfferenable maps wh bounded dervaves up o order k s denoed by C k b and C b := k 1 C k b For a map b : Rd R k, we denoe by b s Jacoban marx whenever exss In he followng, we shall use hese noaons whou specfyng he dmenson when s clearly gven by he conex 2 Dscree me approxmaon of decoupled FBSD wh jumps 21 Decoupled forward backward SD s Le Ω, F, F = F T, P be a sochasc bass such ha F conans he P-null ses, F T = F and F sasfes he usual assumpons We assume ha F s generaed by a d-dmensonal sandard Brownan moon W and an ndependen Posson measure µ on, T where = R m for some m 1 We denoe by F W = F W T resp F µ = F µ T he P-augmenaon of he naural flraon of W resp µ We assume ha he compensaor ν of µ has he form νd, de = λded for some fne measure λ on, endowed wh s Borel rbe, and denoe by µ := µ ν he compensaed measure Gven K >, wo K-Lpschz connuous funcons b : R d R d and σ : R d M d, and a measurable map β : R d R d such ha sup e β, e K and sup βx, e βx, e K x x x, x R d, 21 e we defne X as he soluon on, T of X = X + bx r dr + σx r dw r + βx r, e µde, dr, 22 for some nal condon X R d The exsence and unqueness of such a soluon s 5

7 well known under he above assumpons, see eg 14 and he Appendx for sandard esmaes for soluons of such SD Before nroducng he backward SD, we need o defne some addonal noaons Gven s and some real number p 2, we denoe by S p s, he se of real valued adaped càdlàg processes Y such ha Y S p s, 1 := sup Y r p p s r <, H p s,s he se of progressvely measurable Rd -valued processes Z such ha Z H p s, := s p 1 p Z r 2 2 dr <, L p λ,s, s he se of P measurable maps U : Ω, T R such ha U L p λ,s, := s 1 U s e p p λdeds < wh P defned as he σ-algebra of F-predcable subses of Ω, T The space B p s, := S p s, Hp s, Lp λ,s, s endowed wh he norm Y, Z, U B p s, := 1 Y p + Z p + U p p S p H p L p s, s, λ,s, In he sequel, we shall om he subscrp s, n hese noaons when s, =, T For ease of noaons, we shall somemes wre ha an R n -valued process s n S p s, or L p λ,s, meanng ha each componens n he correspondng space Smlarly an elemen of M m s sad o belong o H p s, f each column belongs o H p s, The norms are hen naurally exended o such processes The am of hs paper s o sudy a dscree me approxmaon of he rple Y, Z, U soluon on, T of he backward sochasc dfferenal equaon Y = gx T + T h Θ r dr T Z r dw r T where Θ := X, Y, Z, Γ and Γ s defned by Γ := ρeueλde, 6 U r e µde, dr, 23

8 for some measurable map ρ : R m sasfyng sup ρe K 24 e By a soluon, we mean an F-adaped rple Y, Z, U B 2 sasfyng 23 In order o ensure he exsence and unqueness of a soluon o 23, we assume ha he map g : R d R and h : R d R R d R m R are K-Lpschz connuous see Lemma 52 n he Appendx For ease of noaons, we shall denoe by C p a generc consan dependng only on p and he consans K, λ, b, σ, h, g and T We wre Cp f also depends on X In hs paper, p wll always denoe a real number greaer han 2 Remark 21 For he convenence of he reader, we have colleced n he Appendx sandard esmaes for he soluons of Forward and Backward SD s In parcular, hey mply X, Y, Z, U p S p B p C p 1 + X p, p 2 25 The esmae on X s sandard, see 54 of Lemma 51 n he Appendx Pluggng hs n 58 of Lemma 52 leads o he bound on Y, Z, U B p Usng 55 of Lemma 51, we also deduce ha sup X u X s p s u C p 1 + X p s, 26 whle he prevous esmaes on X combned wh 59 of Lemma 52 mples { } sup Y u Y s p C p 1 + X p s p + Z p + U p 27 H p L p s u s, λ,s, 22 Dscree me approxmaon We frs fx a regular grd π := { := T/n, =,, n} on, T and approxmae X by s uler scheme X π defned by { X π := X X π +1 := X π + 1 n bxπ + σx π W +1 + βxπ, e µde,, where W +1 := W +1 W Is well known ha max sup X X π <n 2,+1 C 2 n

9 We hen approxmae Y, Z, Γ by Ȳ π, Z π, Γ π defned by he backward mplc scheme Z π π := n Ȳ +1 W +1 F Γ π π := n Ȳ ρe µde, +1, +1 F Ȳ π π := Ȳ +1 F + 1 h 21 X π n, Ȳ π, Z π, Γ π on each nerval, +1, where Ȳ π n := gx π n Observe ha he resoluon of he las equaon n 21 may nvolve he use of a fxed pon procedure However, h beng Lpschz and mulpled by 1/n, he approxmaon error can be negleced for large values of n Remark 22 The above backward scheme, whch s a naural exenson of he one consdered n 6 n he case β =, can be undersood as follows On each nerval, +1, we wan o replace he argumens X, Y, Z, Γ of h n 23 by F -measurable random varables X, Ỹ, Z, Γ Is naural o ake X = X π Takng condonal expecaon, we oban he approxmaon Y 1 = Y+1 F + n h X π, Ỹ, Z, Γ Ths leads o a backward mplc scheme for Y of he form Ȳ π π = Ȳ +1 F + 1 n h X π, Ȳ π, Z, Γ 211 I remans o choose Z and Γ n erms of Ȳ π +1 By he represenaon heorem, here exs wo processes Z π H 2 and U π L 2 λ sasfyng Ȳ π π +1 Ȳ +1 F = +1 Z π s dw s + +1 U π s e µds, de Observe ha hey do no depend on he way Ȳ π s defned and ha Z π and Γ π defned n 21 sasfy Z π = n Zs π ds F and Γπ = n Γ π s ds F 212 and herefore concde wh he bes H 2,+1 -approxmaons of Zπ <+1 and Γ π <+1 := ρeu π eλde <+1 by F -measurable random varables vewed as consan processes on, +1, e +1 Z π Z π 2 d +1 Γ π Γ π 2 d +1 = nf Z Z L 2 π Z 2 d Ω,F +1 = nf Γ π Γ 2 d Γ L 2 Ω,F 8

10 Thus, s naural o ake Z, Γ = Z π, Γ π n 211, so ha Ȳ π = Ȳ π n h X π, Ȳ π, Z π, Γ π +1 Z π s dw s Fnally, observe ha, f we defne Y π on, +1 by seng Y π := Ȳ π hx π, Ȳ π, Z π, Γ π + we oban n +1 Y π d F Z π s dw s + +1 U π s e µds, de U π s e µds, de, π = Ȳ +1 F + 1 n h X π, Ȳ π, Z π, Γ π = Y π = Ȳ π Thus, n hs scheme, Ȳ π s he bes H 2,+1 -approxmaon of Y π on, +1 by F - measurable random varables vewed as consan processes on, +1 Ths explans he noaon Ȳ π whch s conssen wh he defnon of Z π and Γ π Remark 23 One could also use an explc scheme as n eg 3 or 15 In hs case, 21 has o be replaced Z π π := n Ỹ +1 W +1 F Γ π π := n Ỹ ρe µde, +1, +1 F Ỹ π π := Ỹ +1 F + h 1 X π n, Ỹ π +1, Z π, Γ π F 213 wh he ermnal condon Ỹ π n = gx π n The advanage of hs scheme s ha does no requre a fxed pon procedure However, from a numercal pon of vew, addng a erm n he condonal expecaon defnng Ỹ π makes more dffcul o esmae We herefore hnk ha he mplc scheme may be more racable n pracce The convergence of he explc scheme wll be dscussed n Remarks 26 and 28 below 23 Convergence of he approxmaon scheme In hs subsecon, we show ha he approxmaon error rr n Y, Z, U := { sup Y Ȳ π 2 } 1 + Z Z π 2 H + Γ Γ π H 2 T converges o Before o sae hs resul, le us nroduce he processes Z, Γ defned on each nerval, +1 by Z := n +1 Z s ds F and 9 Γ +1 := n Γ s ds F

11 Remark 24 Observe ha Z and Γ are he counerpars of Z π and Γ π for he orgnal backward SD They can also be nerpreed as he bes H 2,+1 -approxmaons of Z <+1 and Γ <+1 by F -measurable random varables vewed as consan processes on, +1, e +1 Z Z 2 d +1 Proposon 21 We have n 1 = +1 Γ Γ 2 d +1 = nf Z L 2 Ω,F = nf Γ L 2 Ω,F +1 Z Z 2 d Γ Γ 2 d Y Y 2 d C 2 n 1 and Z Z H 2 + Γ Γ H 2 ɛn 214 where ɛn as n Moreover, so ha rr n Y, Z, U C 2 n 1/2 + Z Z H 2 + Γ Γ H 2, 215 rr n Y, Z, U n Proof We adap he argumens of 6 Recall from Remark 22 ha Y π = Ȳ π hx π, Ȳ π, Z π, Γ π + Zs π dw s + Us π e µds, de on, +1 and ha Ȳ π = Y π For L = Y, Z or U, we se δl := L L π I follows from he defnon of Z π and Ū π n 212, Jensen s nequaly and he bound on ρ ha Z Z π 2 + Γ Γ π 2 C 2 n δz 2 H + δu 2 2 L 216,+1 2 λ,,+1 For, +1, we deduce from Iô s Lemma, he Lpschz propery of h, 29 and 216 ha δy 2 + δz 2 H + δu 2 2 L,+1 2 λ,,+1 +1 δy α δy s 2 ds + C 2 n 2 + α B + B π 217 where α s some posve consan o be chosen laer, and B, B π s defned as B := +1 Ys Y 2 + Z s Z s 2 + Γ s Γ s 2 ds B π := n 1 δy 2 + δz 2 H + δu 2 2 L,+1 2 λ,,+1 1

12 Usng Gronwall s Lemma, follows ha δy 2 δy C 2 n 2 + α B + B π e α/n 218 Pluggng hs nequaly n 217 and akng α and n large enough leads o δy 2 + η δz 2 H + δu 2 2 L 1 + C 2,+1 2 λ,,+1 n δy C2 n 2 + B + n 1 δy 2, wh η > For n large enough, combnng he lasnequaly wh he deny δy n = gx T gxt π and he esmae 29 leads o δy 2 C 2 n 1 + B n 1 where B := j= B j, 22 whch plugged no 219 mples δy 2 + η δz 2 H + δu 2 2 L,+1 2 λ,,+1 δy C 2 n 2 + B n + B Summng up over and usng 218 and 22, we fnally oban rr n Y, Z, U 2 C 2 n 1 + B 221 Snce Y solves 23, Y Y 2 C 2 hx r, Y r, Z r, Γ r 2 + Z r 2 + U r e 2 λde dr Combnng he Lpschz propery of h wh 25, follows ha n 1 +1 = Y Y 2 d C 2 n Ths s exacly he frs par of 214 whch combned wh 221 leads o 215 I remans o prove he second par of 214 Snce Z s F-adaped, here s a sequence of adaped processes Z n n such ha Z n = Z n on each, +1 and Z n converges o Z n H 2 By Remark 24, we observe ha Z Z 2 H 2 Z Zn 2 H 2, and applyng he same reasonng o Γ concludes he proof 11

13 Remark 25 If σ =, whch mples Z =, or h does no dependen on Z, he erm B n he above proof reduces o B = +1 Ys Y 2 + Γ s Γ s 2 ds In hs case, he asseron 215 of Proposon 21 can be replaced by rr n Y, Z, U C 2 n 1/2 + Γ Γ H Remark 26 In hs Remark, we explan how o adap he proof of Proposon 21 o he explc scheme defned n 213 Frs, we can fnd some Ẑπ H 2 and Û π L 2 λ such ha Ỹ π π +1 = Ỹ +1 F + Ẑs π dw s + Ûs π e µde, ds We hen defne Ŷ π on, +1 by Ŷ π = Ỹ π h X π, Ỹ π +1, Z π, Γ π Observe ha Ŷ π +1 = Ỹ π +1 Z π = n for all < n Moreover and +1 Ẑ π s ds F F + hx s, Y s, Z s, Γ s = hx, Y +1, Z, Γ F Ẑ π s dw s + +1, Γπ = n ˆΓπ s ds F + hx, Y, Z, Γ hx, Y +1, Z, Γ F + hx s, Y s, Z s, Γ s hx, Y, Z, Γ where by he Lpschz connuy of h and of Theorem 21 below hx, Y, Z, Γ hx, Y, Z, Γ F 2 +1 C2/n, and +1 hxs, Y s, Z s, Γ s hx, Y, Z, Γ 2 ds +1 C2 n 2 + Z s Z 2 + Γ s Γ 2 ds, Û π s e µde, ds by of Theorem 21 and 26 Usng hese remarks, he proof of Proposon 21 can be adaped n a sraghforward way Ths mples ha he approxmaon error due o he explc scheme s also upper-bounded by C2 n 1/2 + Z Z H 2 + Γ Γ H 2 12

14 24 Pah-regulary and convergence rae under addonal assumpons In vew of Proposon 21, he dscrezaon error converges o zero In order o conrol s speed of convergence, remans o sudy Z Z 2 H + Γ Γ 2 2 H In hs secon, 2 we shall appeal o one of he addonal assumpons : H 1 : For each e, he map x R d βx, e adms a Jacoban marx βx, e such ha he funcon x, ξ R d R d ax, ξ; e := ξ βx, e + I d ξ sasfes one of he followng condon unformly n x, ξ R d R d ax, ξ; e ξ 2 K 1 or ax, ξ; e ξ 2 K 1 H 2 : σ, b, β, e, h and g are Cb 1 unformly n e funcons wh K-Lpschz connuous dervaves, Remark 27 Observe for laer use ha he condon H 1 mples ha, for each x, e R d, he marx βx, e + I d s nverble wh nverse bounded by K Ths ensure he nversbly of he frs varaon process X of X, see Remark 32 Moreover, f q s a smooh densy on R d wh compac suppor, hen he approxmang funcons β k, k N, defned by β k x, e := k d β x, eqkx xd x R d are smooh and also sasfy H 1 We can now sae he man resul of hs paper Theorem 21 The followng holds For all < n sup Y Y 2 C2 n 1 and sup Γ Γ 2,+1,+1 C 2 n so ha Γ Γ 2 S C 2 2 n 1 and Γ Γ 2 H C 2 2 n 1 Assume ha H 1 holds Then n 1 +1 = Z Z 2 d C2 n

15 so ha Z Z 2 H C 2 2 n 1 Assume ha H 2 holds Then, for all < n and, +1, Z Z 2 C2 n 1, 225 so ha Z Z 2 H C 2 2 n 1 Ths regulary propery wll be proved n he subsequen secons Combned wh Proposon 21 and Remark 25, provdes an upper bound for he convergence rae of our backward mplc scheme Corollary 21 Assume ha eher H 1 holds, or H 2 holds, or σ =, or h s ndependen of Z Then, rr n Y, Z, U C2 n 1/2 Remark 28 In vew of Remark 26, he resul of Corollary 21 can be exended o he explc scheme defned n Possble xensons I wll be clear from he proofs ha all he resuls of hs paper hold f we le he maps b, σ, β, and h depend on whenever hese funcons are 1/2-Hölder n and he oher assumpons are sasfed unformly n In hs case, he backward scheme 21 s modfed by seng Ȳ π π = Ȳ +1 F + 1 n h, X π, Ȳ π, Z π, Γ π The uler approxmaon X π of X could be replaced by any oher adaped approxmaon sasfyng 29 Le M be he soluon of he SD M = M + b M M r dr + β M M r, e µde, dr where b M : R k R k and β M, e : R k R k, k 1, are Lpschz connuous unformly n e wh β M, bounded, and consder he sysem { X = X + bm r, X r dr + σm r, X r dw r + Y = gm T, X T + T h M r, Θ r dr T Z r dw r T βm r, X r, e µde, dr U 226 re µde, dr 14

16 where b, σ, β, e and h are K-Lspchz, unformly n e and β, s bounded Here, he dscree-me approxmaon of Y s gven by Ȳ π n = gm π n, X π n, Ȳ π π = Ȳ +1 F + 1 n h M π, X π, Ȳ π, Z π, Γ π, where M π, X π s he uler scheme of M, X Consderng M, X as an R k+d dmensonal forward process, we can clearly apply he resuls of Proposon 21 Moreover, we clam ha Theorem 21 holds as well as resp f H 1 resp H 2 holds for bm,, σm,, βm,, gm, and hm, as funcons of x, y, z, γ unformly n m R k Ths comes from he fac ha he dynamcs of M are ndependen of X and ha he Mallavn dervave of M wh respec o he Brownan moon equals zero Ths parcular feaure mples ha he proofs of Secon 33 and Secon 4 work whou any modfcaon n hs conex v In 22, see also 25, he auhors consder a sysem of he form { X = X + bm r, X r dr + σm r, X r dw r Y = gm T, X T + T h M r, Θ r dr T Z r dw r T U re µde, dr 227 where M s an F µ -adaped purely dsconnuous jump process In 22, s shown ha a large class of sysems of coupled semlnear parabolc paral dfferenal equaons can be rewren n erms of sysems of BSD of he form 227, where he backward componens are decoupled However, her parcular consrucon mples ha b, σ, h and g are no Lpschz n her frs varable m In hs remark, we explan how o consder hs parcular framework Hereafer, we assume ha he pah of M can be smulaed exacly, whch s he case n 22 Then, recallng ha λ < so ha µ has as only a fne number of jumps on, T, we can nclude he jump mes of M n he uler scheme X π of X Thus, even f b and σ are no Lpschz n her frs varable m, we can sll defne an approxmang scheme X π of X such ha sup X X π 2,+1 C 2 +1 whenever bm, and σm, are Lpschz n x and bm, + σm, s bounded, unformly n m We now explan how o consruc a convergen scheme for he backward componen even when g and h are no Lpschz n m We assume ha hm, s Lpschz and hm, s bounded, unformly n m We make he same assumpon on gm, The 15

17 approxmaon s defned as follows: Z π π := n Ȳ +1 W +1 F Γ π π := n Ȳ ρe µde, +1, +1 F Ȳ π π +1 := Ȳ +1 F + h M s, X π, Ȳ π +1, Z π, Γ π ds F 228 for, +1, wh he ermnal condon Ȳ π n = gm n, X π n Wh hs scheme he proof of Proposon 21 can be modfed as follows We keep he same defnon for Z π and U π bu we now defne Y π as Y π = Ȳ π n + Zs π dw s + +1 h M s, X π, Ȳ π +1, Z π, Γ π ds F U π s e µds, de Le us nroduce he processes H T and H T defned, for, +1, by H := hm, X, Y, Z, Γ +1, H := n h M s, X, Y, Z, Γ ds F Observe ha hm, Θ n +1 h M s, X, Y +1, Z, Γ ds F can be wren as hm, Θ H + H H + H +1 n h M s, X, Y +1, Z, Γ ds F Recall from of hs secon ha of Theorem 21 holds for 227 Followng he argumens of Remark 26, we ge H +1 n By of Theorem 21 and 26, +1 hm, Θ H 2 d C 2 h M s, X, Y +1, Z, Γ ds F 2 C 2 n +1 n 2 + Z Z 2 + Γ Γ 2 d We hen deduce from he same argumens as n he proof of Proposon 21 ha rr n Y, Z, U C2 n 1/2 + Z Z H 2 + Γ Γ H 2 + H H H 2, where Z Z H 2 + Γ Γ H 2 + H H H 2 ɛn for some map ɛ such ha ɛn when n Ths shows ha he approxmaon scheme s convergen Recall from of hs secon ha he resuls of Theorem 21 for hs sysem Snce here β =, follows ha Z Z H 2 + Γ Γ H 2 of hs secon We leave he sudy of H H H 2 16 o furher research C 2n 1 2, see

18 3 Mallavn calculus for FBSD In hs secon, we prove ha he soluon Y, Z, U of 23 s smooh n he Mallavn sense under he addonal assumpons C X 1 : b, σ and β, e are C 1 b C Y 1 : g and h are C 1 b unformly n e We shall also show ha her dervaves are smooh under he sronger assumpons C X 2 : b, σ and β, e are Cb 2 wh second dervaves bounded by K, unformly n e C Y 2 : g and h are Cb 2 wh second dervaves bounded by K Ths wll allow us o provde represenaon and regulary resuls for Y, Z and U n Secon 4 Under C X 1 -C Y 1, hese resuls wll mmedaely mply of Theorem 21, whle of Theorem 21 wll be obaned by adapng he argumens of 29 under he addonal assumpon H 1 Under C X 2 -C Y 2, hese resuls wll also drecly mply of Theorem 21 The proof of Theorem 21 wll hen be compleed by appealng o an approxmaon argumen Ths secon s organzed as follows Frs we derve some properes for he Mallavn dervaves of sochasc negrals wh respec o µ Nex, we recall some well known resuls on he Mallavn dervaves of he forward process X Fnally, we dscuss he Mallavn dfferenably of he soluon of Generales We sar by nroducng some addonal noaons We denoe by D he Mallavn dervave operaor wh respec o he Brownan moon and by ID 1,2 he space of random varables H L 2 Ω, F T, P; R such ha D H exss for all T and sasfy H 2 ID := H 2 T + D 1,2 s H 2 ds < As usual we exend hese noaons o vecor or marx valued processes by akng he Mallavn dervave componenwse and by consderng he suable norm We hen defne H 2 ID 1,2 as he se of elemens ξ H 2 such ha ξ ID 1,2 for almos all T and such ha, afer possbly passng o a measurable verson, T ξ 2 H 2 ID 1,2 := ξ 2 H + D 2 s ξ 2 H 2ds < We also defne L 2 λ ID1,2 as he compleon of he se { } L 2 λ ID 1,2 := Vec ψ = ξϑ : ξ H 2 ID 1,2, F W, ϑ L 2 λf µ, ψ L 2 λ ID 1,2 < 17

19 for he norm ψ 2 L 2 λ ID1,2 := ψ 2 L 2 λ + T D s ψ 2 L 2 λds Here, H 2 ID 1,2, F W resp L 2 λ Fµ denoes he se of F W -adaped resp F µ -adaped elemens of H 2 ID 1,2 resp L 2 λ Moreover, we exend he defnon of H 2 and L 2 λ o processes wh values n M d and R d n a naural way The wo followng Lemmas are generalzaons of Lemma 33 and Lemma 34 n 22 whch correspond o he case where s fne, see also Lemma 23 n 21 for he case of Iô negrals Lemma 31 Assume ha ψ L 2 λ ID1,2 Then, and D s H := H := T T ψ e µde, d ID 1,2 D s ψ e µde, d for all s T Proof Assume ha ψ = ξϑ where ξ H 2 ID 1,2, F W, ϑ L 2 λ Fµ and ψ L 2 λ ID 1,2 < Then, T ψ e µde, d = T ξ ϑ eµde, d Snce λ <, we oban by condonng by µ ha T D s ξ ϑ eµde, d = T T ξ D s ξ ϑ eµde, d, ϑ eλded whle, see 2, T D s ξ ϑ eλded = T D s ξ ϑ eλded = T D s ξ ϑ eλded Ths proves he requred resul when ψ L 2 λ ID 1,2 For he general case, we consder a sequence ψ n n n L 2 λ ID 1,2 whch converges n L 2 λ ID1,2 o ψ Then H n := T ψn e µde, d s a Cauchy sequence n ID 1,2 whch converges o H Thus, H ID 1,2 Snce D s H n s T converges n H 2 o T D sψ e µde, d s T, hs proves he requred resul 18

20 Lemma 32 Fx ξ, ψ H 2 L 2 λ and assume ha T T H := ξ dw + ψ e µde, d ID 1,2 Then, ξ, ψ H 2 ID 1,2 L 2 λ ID1,2 and D s H := ξ s + T d =1 where ξ denoes he ranspose of ξ T D s ξ dw + D s ψ e µde, d, Proof Le SW denoe he se of random varables of he form T T H W = φ f 1 dw,, f κ dw wh κ 1, φ C b and f :, T R d s a bounded measurable map for each κ Then, he se H := Vec { H W H µ : H W SW, H µ L Ω, F µ T, H W H µ = } s dense n ID 1,2 {H L 2 Ω, F, P : H = } for ID 1,2 Thus, suffces o prove he resul for H of he form H W H µ where H W SW, H µ L Ω, F µ T and H W H µ = By he represenaon heorem, here exss ψ L 2 λ such ha H µ = H µ + T ψ e µde, d and by Ocone s formula, see eg Proposon 135 n 19, H W = H W + Thus follows from Iô s Lemma ha H = T H µ D H W F W T D H W F W T dw + H W dw ψ e µde, d where H µ = H µ F and H W = H W F Furhermore he wo negrands belong respecvely o H 2 ID 1,2 and L 2 λ ID1,2 Thus, Lemma 31 above and 146 n 2 conclude he proof 19

21 32 Mallavn calculus on he Forward SD In hs secon, we recall well-known properes concernng he dfferenably n he Mallavn sense of he soluon of a Forward SD In he case where β = he followng resuls saed n eg 19 The exenson o he case β s easly obaned by condonng by µ, see eg 24 for explanaons n he case where s fne, or by combnng Lemma 31 wh a fxed pon procedure as n he proof of Theorem 221 n 19, see also Proposon 32 below From now on, gven a marx A, we shall denoe by A s -h column For k d, we denoe by D k he Mallavn dervave wh respec o W k Proposon 31 Assume ha C X 1 holds, hen X ID 1,2 for all T For all s T and k d, Ds k X adms a verson χ s,k whch solves on s, T χ s,k = σ k X s + s bx r χ s,k r dr+ s d j=1 σ j X r χ s,k r dw j r + s βx r, eχ s,k r µdr, de If moreover C X 2 holds, hen Ds k X ID 1,2 for all s, T and k d For all u T and l d, DuD l s k X adms a verson χ u,l,s,k whch solves on u s, T χ u,l,s,k = σ k X s χ u,l s + σ l X u χ s,k u d + bx r χ u,l,s,k r + bx r χ u,l r χ s,k r dr + + s s s =1 d σ j X r χ u,l,s,k r + j=1 d =1 βx r, eχ u,l,s,k r + σ j X r χ u,l r χ s,k r dwr j 31 d =1 βx r, e χ u,l r χ s,k r µdr, de Remark 31 Fx p 2 and r s u T Under C X 1, follows from Lemma 51 appled o X and χ s ha χ s p S p C p 1 + X p 32 χ s u χ s p C p u 1 + X p 33 χ s χ r p S p C p s r 1 + X p 34 If moreover C X 2 holds hen smlar argumens show ha χ r,s p S p C p 1 + X 2p, 35 where χ r,s = χ r,l,s,k l,k d 2

22 Remark 32 Under C X 1, we can defne he frs varaon process X of X whch solves on, T X = I d + + bx r X r dr + d σ j X r X r dwr j j=1 βx r, e X r µdr, de 36 Moreover, under H 1, see Remark 27, X 1 s well defned and solves on, T d X 1 = I d X 1 r bx r σ j X r σ j X r dr + X 1 r j=1 βx r, eλdedr d j=1 X 1 r σ j X r dw j r X 1 r βx r, e + I d 1 βx r, eµde, dr 37 Ths can be checked by smply applyng Iô s Lemma o he produc X X 1, see 19 p 19 for he case where β = Remark 33 Fx p 2 Under H 1 -C X 1, follows from Remark 27 and Lemma 51 appled o X and X 1 ha X S p + X 1 S p C p 38 Remark 34 Assume ha H 1 -C X 1 holds and observe ha χ s = χ s,k k d and X solve he same equaon up o he condon a me s By unqueness of he soluon on, T, follows ha χ s r = X r X s 1 σx s 1 s r for all s, r T Mallavn calculus on he Backward SD In hs secon, we generalze he resul of Proposon 31 n 22 Le us denoe by B 2 ID 1,2 he se of rples Y, Z, U B 2 such ha Y ID 1,2 for all T and Z, U H 2 ID 1,2 L 2 λ ID1,2 Proposon 32 Assume ha C X 1 -C Y 1 holds The rples Y, Z, U belongs o B 2 ID 1,2 For each s T and k d, he equaon Υ s,k T = gx T χ s,k T + T hθ r Φ s,k r dr 21 T ζr s,k dw r Vr s,k e µde, dr 31

23 wh Φ s,k := χ s,k, Υ s,k, ζ s,k, Γ s,k and Γ s,k := ρev s,k eλde, adms a unque soluon Moreover, Υ s,k, ζ s,k, V s,k s, T s a verson of Ds k Y, Ds k Z, Ds k U s, T Assume furher ha C X 2 -C Y 2 holds Then, for each s T and k d, D k s Y, D k s Z, D k s U belongs o B 2 ID 1,2 For each u T and l d, he equaon Υ u,l,s,k = + χ u,l T T T HgXT χ s,k T + gx T χ u,l,s,k T hθ r Φ u,l,s,k + D luθ r HhΘr D ks Θ r dr ζ u,l,s,k dw r T V u,l,s,k r e µde, dr 311 where Φ u,l,s,k := χ u,l,s,k, Υ u,l,s,k, ζ u,l,s,k, Γ u,l,s,k wh Γ u,l,s,k := ρev u,l,s,k eλde, and Hg resp Hh denoes he Hessan marx of g resp h, adms a unque soluon Moreover, Υ u,l,s,k, ζ u,l,s,k, V u,l,s,k u,s, T s a verson of DuD l s k Y, Z, U u,s, T Proof For ease of noaons, we only consder he case d = 1 and om he ndexes k and l n he above noaons We proceed as n Proposon 53 n 12 Combned wh C 1 X -C1 Y and 32, Lemma 52 mples ha Υ s, ζ s, V s s well defned for each s T and ha we have sup Υ s, ζ s, V s p B C p p 1 + X p for all p s T We now defne he sequence Θ n := X, Y n, Z n, Γ n as follows Frs, we se Y, Z, U :=,, Then, gven Θ n 1, we defne Y n, Z n, U n as he unque soluon n B 2 of T Y n = gx T + T T hθ n 1 r dr Zr n dw r Ur n e µde, dr and se Γ n = ρeu n eλde From he proof of Lemma 24 n 26, Y n, Z n, U n n s a Cauchy sequence n B 2 whch converges o Y, Z, U Moreover, usng Lemma 32 and an nducve argumen, one obans ha Y n, Z n, U n B 2 ID 1,2 For s T, se Υ s,n, ζ s,n, V s,n := D s Y n, D s Z n, D s U n, Φ s,n := χ s, Υ s,n, ζ s,n, Γ s,n, Ξ s,n := χ s, Υ s,n, ζ s,n, U s,n and Ξ s := χ s, Υ s, ζ s, U s, where Γ s,n := ρev s,n eλde By Lemma 32 agan, we have T Υ s,n = gx T χ s T + hθ n 1 r Φ s,n 1 r dr T T ζr s,n dw r Vr s,n e µde, dr

24 Fx I N o be chosen laer, se δ := T/I and τ := δ for I By 51 of Lemma 52, we have G s,n := Ξ s Ξ s,n 4 S 4 B 4 τ,τ +1 where C 4 Υ s τ +1 Υ s,n τ A s,n 1 + B s,n A s,n 1 := { hθ n 1 hθ}φ s 4 H 4 τ,τ +1 τ+1 B s,n 1 := τ hθ n 1 r 4 {Φ s r Φ s,n 1 }dr r Recallng ha ρ and he dervaves of h are bounded, we deduce from Cauchy-Schwarz and Jensen s nequaly ha B s,n 1 C 4 δ 2 G s,n 1, 315 whch combned wh an nducve argumen and leads o sup G s,n < for all n 316 s T Snce he dervaves of h are also connuous and Θ n 1 converges o Θ n S 2 B 2, we deduce from ha, afer possbly passng o a subsequence, lm sup A s,n 1 = 317 n s T I follows from ha for I large enough here s some α < 1 such ha for any ε > we can fnd N, ndependen of s, such ha G s,n C 4 Υ s τ +1 Υ s,n 1 τ ε + αg s,n 1 for n N 318 Snce Υ s T = Υs,n 1 T, we deduce ha for = I 1 and n N sup G s,n s T I 1 ε + α n N sup s T G s,n I 1 By 316, follows ha sup s T G s,n I 1 as n In vew of 318, a sraghforward nducon argumen shows ha, for all I 1, sup s T G s,n as n so ha, summng up over, we ge sup Ξ s Ξ s,n S 4 B 4 s T n 319 Snce Y n, Z n, U n converges o Y, Z, U n B 2, hs shows ha Y, Z, U B 2 ID 1,2 and ha here s a verson of DY, DZ, DU gven by Υ, ζ, V 23

25 In vew of and C X 2 -C Y 2, follows from Lemma 52 ha Υ u,s, ζ u,s, V u,s s well defned for u, s T and ha we have sup Υ u,s, ζ u,s, V u,s p B C p p 1 + X 2p for all p 2 32 u,s T Usng Lemma 32, 313 and an nducve argumen, we hen deduce ha DY n, DZ n, DU n B 2 ID 1,2 and T Υ u,s,n = χ u T HgX T χ s T + gx T χ u,s T + + T Φ u,n 1 r HhΘ n 1 r Φ s,n 1 r dr T hθ n 1 r Φr u,s,n 1 dr T ζr u,s,n dw r Vr u,s,n e µde, dr, where Υ u,s,n, ζ u,s,n, V u,s,n, Φ u,s,n := D u Υ s,n, ζ s,n, V s,n, Φ s,n By, Y n, Z n, U n goes o Y, Z, U n B 2 and Υ s,n, ζ s,n, V s,n converges o Υ s, ζ s, V s n B 4 Moreover, 319 mples sup n 1 so ha, by domnaed convergence, C Y 2 and 32, sup Υ s,n, ζ s,n, V s,n 4 B <, s T Φ u,n HhΘ n Φ s,n Φ u HhΘΦ s H 2 + hθ n hθ Φ u,s H 2, n afer possbly passng o a subsequence The res of he proof follows sep by sep he argumens of excep ha we now work on S 2 B 2 nsead of S 4 B 4 Proposon 33 Assume ha C X 1 -C Y 1 holds For each k d, he equaon T T T Y k = gx T XT k + hθ r Φ k rdr Zr k dw r Ur k e µde, dr 322 wh Φ k = X k, Y k, Z k, Γ k and Γ k := ρe U k eλde, adms a unque soluon Y k, Z k, U k Moreover, here s a verson of ζ s,k, Υ s,k, V s,k s, T gven by { Y, Z, U X s 1 σ k X s 1 s } s, T where Y s he marx whose k-column s gven by Y k and Z, U are defned smlarly Proof In vew of Proposon 32 and 39, hs follows mmedaely from he unqueness of he soluon of 31 Remark 35 I follows from Lemma 52 and 38 ha Y, Z, U B p C p for all p

26 4 Represenaon resuls and pah regulary for he BSD In hs secon, we use he above resuls o oban some regulary for he soluon of he BSD 23 under C X 1 -C Y 1 -H 1 or C X 2 -C Y 2 Smlar resuls under H 1 or H 2 wll hen be obaned by usng an approxmaon argumen Fx u, s,, x, T 3 R d and k, l d In he sequel, we shall denoe by X, x he soluon of 22 on, T wh nal condon X, x = x, and by Y, x, Z, x, U, x he soluon of 23 wh X, x n place of X We defne smlarly Υ s,k, x, ζ s,k, x, V s,k, x, Y, x, Z, x, U, x and Υ u,l,s,k, x, ζ u,l,s,k, x, V u,l,s,k, x Observe ha, wh hese noaons, we have X, X, Y, X, Z, X, U, X = X, Y, Z, U 41 Represenaon We sar hs secon by provng useful bounds for he deermnsc maps defned on, T R d by u, x := Y, x, u, x := Y, x, v s,k, x := Υ s,k, x and w u,l,s,k, x := Υ u,l,s,k, x, where u, s, T 2 and k, l d Proposon 41 Assume ha C X 1 and C Y 1 hold, hen, u, x + v s,k, x C x and u, x C 2 41 for all s, T, k d and x R d Assume ha C X 2 and C Y 2 hold, hen, w u,l,s,k, x C x 2, 42 for all u, s, T, l, k d and x R d Proof When, x =, X, he resul follows from 25 n Remark 21, 312, 32 and 323 The general case s obaned smlarly by changng he nal condon on X Proposon 42 Assume ha C X 1 and C Y 1 hold There s a verson of Z gven by Υ T whch sasfes Z p S p C p 1 + X p 43 25

27 Assume furher ha C X 2 and C Y 2 hold, hen, for each k d, here s a verson of ζ s,k s, T gven by Υ,l,s,k l d s, T whch sasfes sup ζ s,k p S C p p 1 + X 2p 44 s T Proof Here agan we only consder he case d = 1 and om he ndexes k, l By Proposon 32, Y, Z, U belongs o B 2 ID 1,2 and follows from Lemma 32 ha D s Y = Z s s hθ r D s Θ r dr + s D s Z r dw r + s D s U r e µde, dr, 45 for < s T Takng s = leads o he represenaon of Z Thus, afer possbly passng o a suable verson, we have Z = D Y = Υ By unqueness of he soluon of for any nal condon n L 2 Ω, F a, we have Υ = v, X The bound on Z hen follows from Proposon 41 combned wh 25 of Remark 21 Under C X 2 and C Y 2, he same argumens appled o Υ s, ζ s, V s nsead of Y, Z, U leads o he second clam, see of Proposon 32, of Proposon 41 and recall 25 Proposon 43 Defne Ũ by Ũ e := u, X + βx, e lm r u r, X r Then Ũ s a verson of U and sasfes Assume ha C X 1 and C Y 1 holds Defne Ũ by sup Ue p S C p p 1 + X p 46 e Ũe := u, X + βx, e lm r u r, X r Then Ũ s a verson of U and sasfes sup Ue p S C p p 47 e Assume ha C X 1 and C Y 1 holds, hen, for each k d, here s a verson of V s,k s, T gven by Ṽ s,k s, T defned as I sasfes Ṽ s,k e := v s,k, X + βx, e lm r v s,k r, X r sup sup V s,k e p S C p p 1 + X p 48 e s T 26

28 Remark 41 We wll see n Proposon 44 below ha u s connuous under C X 1 so ha C Y 1 and U e := u, X + βx, e u, X One could smlarly show ha v s,k and u are connuous under C X 2 and C Y 2 so ha V s,k e := v s,k, X + βx, e v s,k, X Ũe := u, X + βx, e u, X However, snce hs resuls no requred for our man heorem, we do no provde s proof Proof of Proposon 43 By unqueness of he soluon of for any nal condon n L 2 Ω, F, P; R d a me, U eµde, {} = Y Y = Hence, T Ũe U e 2 µde, d =, whch, by akng expecaon, mples T Ũe U e 2 λded Ũ eµde, {} = The bound on U follows from 41 and 25 The wo oher clams are proved smlarly by usng Pah regulary Proposon 44 Assume ha C X 1 and C Y 1 hold Then, { u 1, x 1 u 2, x 2 2 C x x 1 x 2 2} for all 1 2 T and x 1, x 2 R 2d Proof For A denong X,Y,Z or U we se A := A, x for = 1, 2 and δa := A 1 A 2 By 56 of Lemma 51, we derve δx 2 S 2 2,T C 2 { x1 x x } 49 27

29 Pluggng hs esmae n 51 of Lemma 52 leads o δy, δz, δu 2 B 2 2,T C 2 { x1 x x } 41 Now, observe ha u 1, x 1 u 2, x 2 2 = Y 1 1 Y Y 1 C 2 2 Y Y 1 2 Y Pluggng 43 and 46 n 27, we ge Y 1 2 Y C x , whch, combned wh 41, leads o he frs clam Corollary 41 Assume ha C X 1 and C Y 1 hold There s a verson of Y, U such ha sup Y r Y s 2 + sup sup U r e U s e 2 r s, e r s, C X 2 s, for all s T If moreover C X 2 and C Y 2 hold, hen here s a verson of Z such ha Z Z s 2 C X 4 s, for all s T Proof Observe ha Y = u, X by unqueness of he soluon of Thus, pluggng 25 and 26 n Proposon 44 gves he upper-bound on sup r s, Y r Y s 2 The upper-bound on sup e sup r s, U r e U s e 2 s obaned smlarly by usng he represenaon of U gven n Remark 41 By Proposon 42, a verson of Z s gven by Υ so ha Z Z s 2 C 2 Υ Υ s 2 + Υ s Υ s s 2 By 59 of Lemma 52, 32, 44 and 48, we have Υ s Υ s s 2 C X 4 s By pluggng 34 n 51 of Lemma 52, we hen deduce ha Υ Υ s 2 C X 2 s 28

30 Proposon 45 Assume ha H 1 -C X 1 -C Y 1 hold Then for all n 1 n 1 +1 = Z Z 2 C 2 n 1 Proof 1 We denoe by x h resp y h, z h, γ h he graden of h wh respec o s x varable resp y, z, γ We frsnroduce he processes Λ and M defned by Λ := exp y hθ r dr, M := 1 + M r z hθ r dw r Snce h has bounded dervaves, follows from Iô s Lemma and Proposon 42 ha T Λ M Z = M T Λ T gx T χ T + x hθ r χ r + γ hθ r Γ r Λr dr F By Remark 34 and Proposon 33, we deduce ha T Λ M Z = M T Λ T gx T X T + F r Λ r dr F X 1 σx where he process F s defned by F r = x hθ r X r + γ hθ r Γ r for r T I follows ha Λ M Z = { G F } F r Λ r dr X 1 σx 411 where G := M T Λ T gx T X T + T F r Λ r dr By 38 and 47, we deduce ha G p Cp for all p Se m s := G F s and le ζ, Ṽ H2 L 2 λ wh values n Md R d be defned such ha m s = G T ζ r dw r T s s Ṽ r e µde, dr Applyng 412 and Lemma 52 o m, ζ, Ṽ mples ha m, ζ, Ṽ B p C p for all p

31 Usng C X 1, 38, 47, 413, applyng Lemma 51 o M 1 and usng Iô s Lemma, we deduce from he las asseron ha can be wren as where Z := ΛM 1 m Z = Z + µ r dr + F r Λ r dr X 1 σ r dw r + and µ, σ and β are adaped processes sasfyng where β r e µde, dr, Z p S p C p for all p 2, 414 A p,t C p for all p A p s, := µ p + σ p + β p H p H p L p s, s, λ,s,, s T 2 Observe ha Z = Z σx P as snce he probably of havng a jump a me s equal o zero I follows ha, for all n and, +1, Z Z 2 C 2 I 1, + I 2, 416 where I 1, := Z Z 2 σx 2 and I 2, := σx σx 2 Z 2 Observng ha I 1, = Z Z 2 F σx 2 +1 C 2 µ r 2 + σ r 2 + β r e 2 λde dr σx 2 we deduce from Hölder nequaly, 25 and he lnear growh assumpon on σ ha n 1 +1 = T I 1,d C 2 n 1 µ r 2 + σ r 2 + β r e 2 λde dr sup σx 2 T C 2A 4,T 1 2 n

32 Usng he Lpschz connuy of σ, we oban I 2, C 2 X X 2 Z Now observe ha for each k, l d X k X k 2 Z l 2 C 2 Z l Z l 2 X k 2 + X k Z l X k Zl Argung as above, we oban n 1 +1 = Z l Z l 2 X k 2 C2 1 + A 4,T 1 2 n 1 42 Moreover, we deduce from he lnear growh condon on b, σ, β and 25, 414 and 415 ha X k Zl can be wren as X k Z l = X k Z l + ˆµ kl r dr + ˆσ kl r dw r + ˆβ kl r e µde, dr where ˆµ kl, ˆσ kl and ˆβ kl are adaped processes sasfyng ˆµ kl H 2 + ˆσ kl H 2 + ˆβ kl L 2 λ C 2 I follows ha n 1 +1 = X k Z l X k Zl 2 whch combned wh 418, 419 and 42 leads o n 1 +1 = C 2 n 1 ˆµ kl 2 H + 2 ˆσkl 2 H + ˆβ kl 2 2 L 2 λ I 2,d C 21 + A 4,T 1 2 n The proof s concluded by pluggng n 416 and recallng 415 We now complee he proof of Theorem 21 Proof of Theorem 21 1 We frs prove Observe ha he second asseron s a drec consequence of 224 and Remark 24 We frs show ha 224 holds under H 1 and C Y 1 We consder a Cb densy q on R d wh compac suppor and se b k, σ k, β k, ex = k R d b, σ, β, e x q kx x d x d For large k N, hese funcons are bounded by 2K a Moreover, hey are K-Lpschz and Cb 1 Usng he connuy of σ, one also easly checks ha σk s sll nverble By H 1 and Remark 27, for each e and x R d, I d + β k x, e s nverble wh 31

33 unformly bounded nverse We denoe by X k, Y k, Z k, U k he soluon of wh b, σ, β replaced by b k, σ k, β k Snce b k, σ k, β k converges ponwse o b, σ, β, one easly deduces from Lemma 51 and Lemma 52 ha X k, Y k, Z k, U k converges o X, Y, Z, U n S 2 B 2 Snce he resul of Proposon 45 holds for X k, Y k, Z k, U k unformly n k, hs shows ha holds under H 1 and C Y 1 We now prove ha 224 holds under H 1 Le X, Y k, Z k, U k be he soluon of wh h k nsead of h, where h k s consruced by consderng a sequence of molfers as above For large k, h k s bounded by 2K By Lemma 52, Y k, Z k, U k converges o Y, Z, U n S 2 B 2 whch mples by argung as above 2 The same approxmaon argumen shows ha of Corollary 41 holds rue whou C X 1 -C Y 1 Snce ρ s bounded and λ <, hs leads o 223 Now observe ha sup Γ Γ 2 2 sup Γ Γ Γ Γ 2,+1,+1 where, by Jensen s nequaly and he fac ha Γ Γ Γ 2 +1 n 2 Γ Γ s ds n s F -measurable, +1 Thus, 223 mples Γ Γ 2 S 2 C 2 n 1 and Γ Γ 2 H 2 C 2 n 1 Γ Γ s 2 ds 3 Iem s proved smlarly by usng of Corollary 41 5 Appendx: A pror esmaes For sake of compleeness, we provde n hs secon some a pror esmaes on soluons of forward and backward SD s wh jumps provde all he deals The proofs beng sandard, we do no Proposon 51 Gven ψ L 2 λ, le M be defned on, T by M = ψ se µds, de Then, for all p 2, k p ψ p L p λ,,t M p S p,t K p ψ p L p λ,,t 51 where k p, K p are posve numbers ha depend only on p, λ and T Proof 1 We frs prove he lef hand-sde Observe ha for a sequence a I of non-negave numbers we have α 1 α a α max a a a for all α 1 52 I I I 32 I

34 I follows ha ψ p L p λ,,t T = ψ s e p µde, ds T ψ s e 2 µde, ds p 2, snce p/2 1, and he resul follows from Burkholder-Davs-Gundy nequaly see eg 23 p We now prove he rgh hand-sde nequaly for p 1 We follow he nducve argumen of 5 For p 1, 2, we deduce from Burkholder-Davs-Gundy nequaly and 52 ha sup M s p s T T K p p ψ s e 2 2 µde, ds snce 2/p 1 Ths mples he requred resul T K p ψ s e p µde, ds We now assume ha he nequaly s vald from some p > 1 and prove has also rue for 2p Se M = ψ se 2 µde, ds for, T Then, M, M T = M T + T ψ se 2 λdeds Applyng Burkholder-Davs-Gundy nequaly, we oban sup s T M s 2p M, M p T where T p M, M p T K p M T p + ψ s e 2 λdeds and K p denoes a generc posve number ha depends only on p Applyng 51 o M, we oban M T p T K p ψ s e 2p λdeds On he oher hand, follows from Hölder nequaly ha T ψ s e 2 λdeds T 1 ψ s e 2p p λdeds T λ 1 q where q = p/p 1, recall ha p > 1 Combnng he wo lasnequales leads o he requred resul We now consder some measurable maps b : Ω, T R d R d σ : Ω, T R d M d β : Ω, T R d R d f : Ω, T R R d L 2,, λ; R, = 1, 2 33

35 Here L 2,, λ; R s endowed wh he naural norm ae 2 λde 1 2 Omng he dependence of hese maps wh respec o ω Ω, we assume ha for each T b,, σ,, β,, e and f, are as K-Lpschz connuous unformly n e for β We also assume ha f,, b, s F-progressvely measurable, and σ,, β, s F-predcable, = 1, 2 Gven some real number p 2, we assume ha b,, σ, and f, are n H p, and ha β,, s n L p λ For 1 2 T, X L 2 Ω, F, P; R d for = 1, 2, we now denoe by X he soluon on, T of X = X + b s, X sds + σ s, X sdw s + β s, e, X s µde, ds 53 Lemma 51 { } X 1 p C S p p X 1 p + b 1, p + σ 1, p + β 1,, p H p H p L p 1,T 1,T 1,T λ, 1,T 54 Moreover, for all 1 s T, sup Xu 1 Xs 1 p s u where A 1 p s defned as X 1 p + sup b 1 s, p + 1 s T sup σ 1 s, p + 1 s T C p A 1 p s, 55 { } sup β 1 s,, e p λde 1 s T, and, for 2 T, δx p S p 2,T C p X 1 X 2 p + A 1 p 2 1 T p + C p δ b d + δ σ p + δ β p H p L p 2,T λ, 2,T 2 56 where δx := X 1 X 2, δ b = b 1 b 2, X 1 and δ σ, δ β are defned smlarly Lemma 52 Le f be equal o f 1 or f 2 Gven Ỹ Lp Ω, F T, P; R, he backward SD T Y = Ỹ + fs, Y s, Z s, U s ds + T Z s dw s + T 34 U s e µde, ds 57

36 has a unque soluon Y, Z, U n B 2 I sasfes T Y, Z, U p B C p p Ỹ p + Moreover, f A p := Ỹ p + sup T f, p <, hen p f, d { } sup Y u Y s p C p A p s p + Z p + U p H p L p s u s, λ,s, Fx Ỹ 1 and Ỹ 2 n L p Ω, F T, P; R and le Y, Z, U be he soluon of 58 wh Ỹ, f n place of Ỹ, f, = 1, 2 Then, for all T, T δy, δz, δu p C B p p δỹ p +,T p δ f r dr where δỹ := Ỹ 1 Ỹ 2, δy := Y 1 Y 2, δz := Z 1 Z 2, δu := U 1 U 2 and δ f := f 1 f 2, Y 1, Z 1, U 1 51 Proof of Lemma 51 Applyng Burkholder-Davs-Gundy nequaly see eg 23 p 175 and usng Proposon 51, we ge T sup Xs 1 p C p X 1 p + s 1,T 1 p b 1 s, Xs 1 ds + C p σ 1, X 1 p + β 1, X 1, p H p L p 1,T λ, 1,T The esmae 54 s hen deduced by usng he Lpschz properes of b 1, σ 1, β 1 and Gronwall s Lemma The esmae 55 s obaned by applyng he same argumens o he process X 1 Xs 1 p on s, To oban he las asseron 56, we frs apply he above argumen o δx = X 1 X 2 on 2, T Then, decomposng b 1, X 1 b 2, X 2 as δ b + b 2, X 1 b 2, X 2 and dong he same for σ and β, he Lpschz properes of b2, σ 2, β 2 combned wh Gronwall s lemma leads o T p sup δx s p C p X 1 2 X 2 p + δ b d + δ σ p + δ β p H p L p s 2,T 2 2,T λ, 2,T We hen conclude by usng he 55 Proof of Lemma 52 See 26 and 2 for exsence and unqueness We dvde, T n N nervals τ, τ +1 of equal lengh δ := T/N For τ s τ +1 τ+1 Y s Y τ+1 + fr, Y r, Z r, U r dr F s, 35

37 whch, by Doob and Jensen s nequales, mples sup Y s p C p Y τ+1 p + s τ +1 τ+1 p fr, Y r, Z r, U r dr Moreover, follows from Burkholder-Davs-Gundy nequaly see eg 23 p 175 and Proposon 51 ha Z p + U p H p L p,τ +1 λ,,τ +1 τ+1 p C p Y τ+1 p + fr, Y r, Z r, U r dr + sup Y s p s τ +1 Thus, usng Hölder and Jensen s nequales, we oban τ+1 p Y, Z, U p C B p p Y τ+1 p + fr, Y r, Z r, U r dr,τ +1 T p C p { Y τ+1 p + f, τ+1 d + Y p S p u,τ +1 du } + δ p/2 Z p + U p H p L p,τ +1 λ,,τ +1 by he Lpschz connuy assumpon on f For δ smaller han 2C p 2/p, we hen ge Y, Z, U p B p,τ +1 C p { Y τ+1 p T p + d f, + Usng Gronwall s Lemma, we deduce ha Y p S p τ,τ +1 C p { Y τ+1 p T + τ+1 p } f, d Pluggng hs esmae no he prevous upper bound, we fnally ge Ths leads o 58 Y, Z, U p B p τ,τ +1 T p C p Y τ+1 p + f, d By Burkholder-Davs-Gundy nequaly and Proposon 51, we have p sup Y u Y s p C p fr, Y r, Z r, U r dr s u s { } + C p Z p + U p H p L p s, λ,s, } Y p S p u,τ +1 du Usng he Lpschz connuy assumpon on f ogeher wh 58 leads o 59 The esmae 51 s obaned by applyng smlar argumens o δy, δz, δu 36

38 References 1 Anonell F and A Kohasu-Hga 2 Flraon sably of backward SD s Sochasc Analyss and Is Applcaons, 18, Barles G, R Buckdahn and Pardoux 1997 Backward sochasc dfferenal equaons and negral-paral dfferenal equaons Sochascs Sochascs Repors, 6, Bally V, and G Pages 22 A quanzaon algorhm for solvng dscree me muldmensonal opmal soppng problems Bernoull, 9 6, Becherer D 25 Bounded soluons o Backward SD s wh Jumps for Uly Opmzaon and Indfference Hedgng Preprn, Imperal College London 5 Bcheler K and J Jacod 1983 Calcul de Mallavn pour des dffusons avec sau: exsence d une densé dans le cas undmensonel Sémnare de Probablé, 17, Bouchard B and N Touz 24 Dscree-Tme Approxmaon and Mone- Carlo Smulaon of Backward Sochasc Dfferenal quaons Sochasc Processes and her Applcaons, 111 2, Brémaud P 1981 Pon Processes and Queues - Marngale Dynamcs, Sprnger- Verlag, New-York 8 Brand P, B Delyon, and J Mémn 21 Donsker-ype heorem for BSD s lecronc Communcaons n Probably, 6, Chevance D 1997 Numercal Mehods for Backward Sochasc Dfferenal quaons In Numercal mehods n fnance, d LCG Rogers and D Talay, Cambrdge Unversy Press, Coque F, V Mackevčus, and J Mémn 1998 Sably n D of marngales and backward equaons under dscrezaon of flraon Sochasc Processes and her Applcaons, 75, Douglas J Jr, J Ma, and P Proer 1996 Numercal Mehods for Forward- Backward Sochasc Dfferenal quaons Annals of Appled Probably, 6, l Karou N, S Peng and M-C Quenez 1997 Backward sochasc dfferenal equaons n fnance Mahemacal fnance, 7 1,

39 13 yraud-losel A 25 Backward Sochasc Dfferenal quaons wh nlarged Flraon Opon Hedgng of an nsder rader n a fnancal marke wh Jumps To appear n Sochasc processes and her Applcaons 14 Fujwara T and H Kuna 1989 Sochasc dfferenal equaons of Jump ype and Lévy processes n dffeomorphsm group J Mah Kyoo Unv, 25 1, Gobe, JP Lemor and X Warn 25 Rae of convergence of emprcal regresson mehod for solvng generalzed BSD preprn cole Polyechnque, RI Longsaff F A and R S Schwarz 21 Valung Amercan Opons By Smulaon : A smple Leas-Square Approach Revew of Fnancal Sudes, 14, Ma J, P Proer, J San Marn, and S Torres 22 Numercal Mehod for Backward Sochasc Dfferenal quaons Annals of Appled Probably, 12 1, Ma J, P Proer, and J Yong 1994 Solvng forward-backward sochasc dfferenal equaons explcly - a four sep scheme Probably Theory and Relaed Felds, 98, Nualar D 1995 The Mallavn Calculus and Relaed Topcs Sprnger Verlag, Berln 2 Nualar D and Pardoux 1988 Sochasc calculus wh ancpang negrands Prob Theory and Rel Felds, 78, Pardoux and S Peng 1992 Backward sochasc dfferenal equaons and quaslnear parabolc paral dfferenal equaons Lecure Noes n Conrol and Inform Sc, 176, Pardoux, F Pradelles and Z Rao 1997 Probablsc nerpreaon for a sysem of semlnear parabolc paral dfferenal equaons Ann Ins H Poncare, 33 4, Proer P 199 Sochasc negraon and dfferenal equaons Sprnger Verlag, Berln 24 Forser B, Lükebohmer and J Techmann 25 Calculaon of he greeks for jump-dffusons Preprn 38

Discrete Time Approximation and Monte-Carlo Simulation of Backward Stochastic Differential Equations

Discrete Time Approximation and Monte-Carlo Simulation of Backward Stochastic Differential Equations Dscree Tme Approxmaon and Mone-Carlo Smulaon of Backward Sochasc Dfferenal Equaons Bruno Bouchard Unversé Pars VI, PMA, and CREST Pars, France bouchard@ccrjusseufr Nzar Touz CREST Pars, France ouz@ensaefr

More information

Part II CONTINUOUS TIME STOCHASTIC PROCESSES

Part II CONTINUOUS TIME STOCHASTIC PROCESSES Par II CONTINUOUS TIME STOCHASTIC PROCESSES 4 Chaper 4 For an advanced analyss of he properes of he Wener process, see: Revus D and Yor M: Connuous marngales and Brownan Moon Karazas I and Shreve S E:

More information

Relative controllability of nonlinear systems with delays in control

Relative controllability of nonlinear systems with delays in control Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.

More information

A NUMERICAL SCHEME FOR BSDES. BY JIANFENG ZHANG University of Southern California, Los Angeles

A NUMERICAL SCHEME FOR BSDES. BY JIANFENG ZHANG University of Southern California, Los Angeles The Annals of Appled Probably 24, Vol. 14, No. 1, 459 488 Insue of Mahemacal Sascs, 24 A NUMERICAL SCHEME FOR BSDES BY JIANFENG ZHANG Unversy of Souhern Calforna, Los Angeles In hs paper we propose a numercal

More information

Existence and Uniqueness Results for Random Impulsive Integro-Differential Equation

Existence and Uniqueness Results for Random Impulsive Integro-Differential Equation Global Journal of Pure and Appled Mahemacs. ISSN 973-768 Volume 4, Number 6 (8), pp. 89-87 Research Inda Publcaons hp://www.rpublcaon.com Exsence and Unqueness Resuls for Random Impulsve Inegro-Dfferenal

More information

On One Analytic Method of. Constructing Program Controls

On One Analytic Method of. Constructing Program Controls Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna

More information

A-posteriori estimates for backward SDEs

A-posteriori estimates for backward SDEs A-poseror esmaes for backward SDEs Chrsan Bender 1, Jessca Sener 1 Aprl 4, 01 Suppose an approxmaon o he soluon of a backward SDE s pre-compued by some numercal algorhm. In hs paper we provde a-poseror

More information

A numerical scheme for backward doubly stochastic differential equations

A numerical scheme for backward doubly stochastic differential equations Bernoull 191, 213, 93 114 DOI: 1.315/11-BEJ391 A numercal scheme for backward doubly sochasc dfferenal equaons AUGUSTE AMAN UFR Mahémaques e Informaque, Unversé de Cocody, BP 582 Abdjan 22, Côe d Ivore.

More information

GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim

GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim Korean J. Mah. 19 (2011), No. 3, pp. 263 272 GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS Youngwoo Ahn and Kae Km Absrac. In he paper [1], an explc correspondence beween ceran

More information

V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS

V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon

More information

ON THE WEAK LIMITS OF SMOOTH MAPS FOR THE DIRICHLET ENERGY BETWEEN MANIFOLDS

ON THE WEAK LIMITS OF SMOOTH MAPS FOR THE DIRICHLET ENERGY BETWEEN MANIFOLDS ON THE WEA LIMITS OF SMOOTH MAPS FOR THE DIRICHLET ENERGY BETWEEN MANIFOLDS FENGBO HANG Absrac. We denfy all he weak sequenal lms of smooh maps n W (M N). In parcular, hs mples a necessary su cen opologcal

More information

Epistemic Game Theory: Online Appendix

Epistemic Game Theory: Online Appendix Epsemc Game Theory: Onlne Appendx Edde Dekel Lucano Pomao Marcano Snscalch July 18, 2014 Prelmnares Fx a fne ype srucure T I, S, T, β I and a probably µ S T. Le T µ I, S, T µ, βµ I be a ype srucure ha

More information

( ) () we define the interaction representation by the unitary transformation () = ()

( ) () we define the interaction representation by the unitary transformation () = () Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger

More information

John Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany

John Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy

More information

CH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC

CH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC CH.3. COMPATIBILITY EQUATIONS Connuum Mechancs Course (MMC) - ETSECCPB - UPC Overvew Compably Condons Compably Equaons of a Poenal Vecor Feld Compably Condons for Infnesmal Srans Inegraon of he Infnesmal

More information

HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD

HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,

More information

Solution in semi infinite diffusion couples (error function analysis)

Solution in semi infinite diffusion couples (error function analysis) Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of

More information

( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model

( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model BGC1: Survval and even hsory analyss Oslo, March-May 212 Monday May 7h and Tuesday May 8h The addve regresson model Ørnulf Borgan Deparmen of Mahemacs Unversy of Oslo Oulne of program: Recapulaon Counng

More information

CS286.2 Lecture 14: Quantum de Finetti Theorems II

CS286.2 Lecture 14: Quantum de Finetti Theorems II CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2

More information

SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β

SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β SARAJEVO JOURNAL OF MATHEMATICS Vol.3 (15) (2007), 137 143 SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β M. A. K. BAIG AND RAYEES AHMAD DAR Absrac. In hs paper, we propose

More information

P R = P 0. The system is shown on the next figure:

P R = P 0. The system is shown on the next figure: TPG460 Reservor Smulaon 08 page of INTRODUCTION TO RESERVOIR SIMULATION Analycal and numercal soluons of smple one-dmensonal, one-phase flow equaons As an nroducon o reservor smulaon, we wll revew he smples

More information

Let s treat the problem of the response of a system to an applied external force. Again,

Let s treat the problem of the response of a system to an applied external force. Again, Page 33 QUANTUM LNEAR RESPONSE FUNCTON Le s rea he problem of he response of a sysem o an appled exernal force. Agan, H() H f () A H + V () Exernal agen acng on nernal varable Hamlonan for equlbrum sysem

More information

. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue.

. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue. Lnear Algebra Lecure # Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons

More information

Volatility Interpolation

Volatility Interpolation Volaly Inerpolaon Prelmnary Verson March 00 Jesper Andreasen and Bran Huge Danse Mares, Copenhagen wan.daddy@danseban.com brno@danseban.com Elecronc copy avalable a: hp://ssrn.com/absrac=69497 Inro Local

More information

Linear Response Theory: The connection between QFT and experiments

Linear Response Theory: The connection between QFT and experiments Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure

More information

Online Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading

Online Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng

More information

Method of upper lower solutions for nonlinear system of fractional differential equations and applications

Method of upper lower solutions for nonlinear system of fractional differential equations and applications Malaya Journal of Maemak, Vol. 6, No. 3, 467-472, 218 hps://do.org/1.26637/mjm63/1 Mehod of upper lower soluons for nonlnear sysem of fraconal dfferenal equaons and applcaons D.B. Dhagude1 *, N.B. Jadhav2

More information

. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue.

. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue. Mah E-b Lecure #0 Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons are

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm H ( q, p, ) = q p L( q, q, ) H p = q H q = p H = L Equvalen o Lagrangan formalsm Smpler, bu

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm Hqp (,,) = qp Lqq (,,) H p = q H q = p H L = Equvalen o Lagrangan formalsm Smpler, bu wce as

More information

Comparison of Differences between Power Means 1

Comparison of Differences between Power Means 1 In. Journal of Mah. Analyss, Vol. 7, 203, no., 5-55 Comparson of Dfferences beween Power Means Chang-An Tan, Guanghua Sh and Fe Zuo College of Mahemacs and Informaon Scence Henan Normal Unversy, 453007,

More information

Online Appendix for. Strategic safety stocks in supply chains with evolving forecasts

Online Appendix for. Strategic safety stocks in supply chains with evolving forecasts Onlne Appendx for Sraegc safey socs n supply chans wh evolvng forecass Tor Schoenmeyr Sephen C. Graves Opsolar, Inc. 332 Hunwood Avenue Hayward, CA 94544 A. P. Sloan School of Managemen Massachuses Insue

More information

DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL

DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL Sco Wsdom, John Hershey 2, Jonahan Le Roux 2, and Shnj Waanabe 2 Deparmen o Elecrcal Engneerng, Unversy o Washngon, Seale, WA, USA

More information

[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5

[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5 TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres

More information

Lecture 18: The Laplace Transform (See Sections and 14.7 in Boas)

Lecture 18: The Laplace Transform (See Sections and 14.7 in Boas) Lecure 8: The Lalace Transform (See Secons 88- and 47 n Boas) Recall ha our bg-cure goal s he analyss of he dfferenal equaon, ax bx cx F, where we emloy varous exansons for he drvng funcon F deendng on

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 5 Lecure 0 Canoncal Transformaons (Chaper 9) Wha We Dd Las Tme Hamlon s Prncple n he Hamlonan formalsm Dervaon was smple δi δ Addonal end-pon consrans pq H( q, p, ) d 0 δ q ( ) δq ( ) δ

More information

On the numerical treatment ofthenonlinear partial differentialequation of fractional order

On the numerical treatment ofthenonlinear partial differentialequation of fractional order IOSR Journal of Mahemacs (IOSR-JM) e-iss: 2278-5728, p-iss: 239-765X. Volume 2, Issue 6 Ver. I (ov. - Dec.26), PP 28-37 www.osrjournals.org On he numercal reamen ofhenonlnear paral dfferenalequaon of fraconal

More information

SELFSIMILAR PROCESSES WITH STATIONARY INCREMENTS IN THE SECOND WIENER CHAOS

SELFSIMILAR PROCESSES WITH STATIONARY INCREMENTS IN THE SECOND WIENER CHAOS POBABILITY AD MATEMATICAL STATISTICS Vol., Fasc., pp. SELFSIMILA POCESSES WIT STATIOAY ICEMETS I TE SECOD WIEE CAOS BY M. M A E J I M A YOKOAMA AD C. A. T U D O LILLE Absrac. We sudy selfsmlar processes

More information

Should Exact Index Numbers have Standard Errors? Theory and Application to Asian Growth

Should Exact Index Numbers have Standard Errors? Theory and Application to Asian Growth Should Exac Index umbers have Sandard Errors? Theory and Applcaon o Asan Growh Rober C. Feensra Marshall B. Rensdorf ovember 003 Proof of Proposon APPEDIX () Frs, we wll derve he convenonal Sao-Vara prce

More information

FTCS Solution to the Heat Equation

FTCS Solution to the Heat Equation FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence

More information

The Finite Element Method for the Analysis of Non-Linear and Dynamic Systems

The Finite Element Method for the Analysis of Non-Linear and Dynamic Systems Swss Federal Insue of Page 1 The Fne Elemen Mehod for he Analyss of Non-Lnear and Dynamc Sysems Prof. Dr. Mchael Havbro Faber Dr. Nebojsa Mojslovc Swss Federal Insue of ETH Zurch, Swzerland Mehod of Fne

More information

Outline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model

Outline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon

More information

Dynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005

Dynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005 Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc

More information

Approximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy

Approximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy Arcle Inernaonal Journal of Modern Mahemacal Scences, 4, (): - Inernaonal Journal of Modern Mahemacal Scences Journal homepage: www.modernscenfcpress.com/journals/jmms.aspx ISSN: 66-86X Florda, USA Approxmae

More information

THE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS

THE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS THE PREICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS INTROUCTION The wo dmensonal paral dfferenal equaons of second order can be used for he smulaon of compeve envronmen n busness The arcle presens he

More information

The Pricing of Basket Options: A Weak Convergence Approach

The Pricing of Basket Options: A Weak Convergence Approach The Prcng of Baske Opons: A Weak Convergence Approach Ljun Bo Yongjn Wang Absrac We consder a lm prce of baske opons n a large porfolo where he dynamcs of baske asses s descrbed as a CEV jump dffuson sysem.

More information

NATIONAL UNIVERSITY OF SINGAPORE PC5202 ADVANCED STATISTICAL MECHANICS. (Semester II: AY ) Time Allowed: 2 Hours

NATIONAL UNIVERSITY OF SINGAPORE PC5202 ADVANCED STATISTICAL MECHANICS. (Semester II: AY ) Time Allowed: 2 Hours NATONAL UNVERSTY OF SNGAPORE PC5 ADVANCED STATSTCAL MECHANCS (Semeser : AY 1-13) Tme Allowed: Hours NSTRUCTONS TO CANDDATES 1. Ths examnaon paper conans 5 quesons and comprses 4 prned pages.. Answer all

More information

Notes on the stability of dynamic systems and the use of Eigen Values.

Notes on the stability of dynamic systems and the use of Eigen Values. Noes on he sabl of dnamc ssems and he use of Egen Values. Source: Macro II course noes, Dr. Davd Bessler s Tme Seres course noes, zarads (999) Ineremporal Macroeconomcs chaper 4 & Techncal ppend, and Hamlon

More information

Density Matrix Description of NMR BCMB/CHEM 8190

Density Matrix Description of NMR BCMB/CHEM 8190 Densy Marx Descrpon of NMR BCMBCHEM 89 Operaors n Marx Noaon Alernae approach o second order specra: ask abou x magnezaon nsead of energes and ranson probables. If we say wh one bass se, properes vary

More information

Tight results for Next Fit and Worst Fit with resource augmentation

Tight results for Next Fit and Worst Fit with resource augmentation Tgh resuls for Nex F and Wors F wh resource augmenaon Joan Boyar Leah Epsen Asaf Levn Asrac I s well known ha he wo smple algorhms for he classc n packng prolem, NF and WF oh have an approxmaon rao of

More information

Existence of Time Periodic Solutions for the Ginzburg-Landau Equations. model of superconductivity

Existence of Time Periodic Solutions for the Ginzburg-Landau Equations. model of superconductivity Journal of Mahemacal Analyss and Applcaons 3, 3944 999 Arcle ID jmaa.999.683, avalable onlne a hp:www.dealbrary.com on Exsence of me Perodc Soluons for he Gnzburg-Landau Equaons of Superconducvy Bxang

More information

On computing differential transform of nonlinear non-autonomous functions and its applications

On computing differential transform of nonlinear non-autonomous functions and its applications On compung dfferenal ransform of nonlnear non-auonomous funcons and s applcaons Essam. R. El-Zahar, and Abdelhalm Ebad Deparmen of Mahemacs, Faculy of Scences and Humanes, Prnce Saam Bn Abdulazz Unversy,

More information

Testing a new idea to solve the P = NP problem with mathematical induction

Testing a new idea to solve the P = NP problem with mathematical induction Tesng a new dea o solve he P = NP problem wh mahemacal nducon Bacground P and NP are wo classes (ses) of languages n Compuer Scence An open problem s wheher P = NP Ths paper ess a new dea o compare he

More information

Density Matrix Description of NMR BCMB/CHEM 8190

Density Matrix Description of NMR BCMB/CHEM 8190 Densy Marx Descrpon of NMR BCMBCHEM 89 Operaors n Marx Noaon If we say wh one bass se, properes vary only because of changes n he coeffcens weghng each bass se funcon x = h< Ix > - hs s how we calculae

More information

On elements with index of the form 2 a 3 b in a parametric family of biquadratic elds

On elements with index of the form 2 a 3 b in a parametric family of biquadratic elds On elemens wh ndex of he form a 3 b n a paramerc famly of bquadrac elds Bora JadrevĆ Absrac In hs paper we gve some resuls abou prmve negral elemens p(c p n he famly of bcyclc bquadrac elds L c = Q ) c;

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4 CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped

More information

@FMI c Kyung Moon Sa Co.

@FMI c Kyung Moon Sa Co. Annals of Fuzzy Mahemacs and Informacs Volume 8, No. 2, (Augus 2014), pp. 245 257 ISSN: 2093 9310 (prn verson) ISSN: 2287 6235 (elecronc verson) hp://www.afm.or.kr @FMI c Kyung Moon Sa Co. hp://www.kyungmoon.com

More information

e-journal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov

e-journal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov June 7 e-ournal Relably: Theory& Applcaons No (Vol. CONFIDENCE INTERVALS ASSOCIATED WITH PERFORMANCE ANALYSIS OF SYMMETRIC LARGE CLOSED CLIENT/SERVER COMPUTER NETWORKS Absrac Vyacheslav Abramov School

More information

Ordinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s

Ordinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s Ordnary Dfferenal Equaons n Neuroscence wh Malab eamples. Am - Gan undersandng of how o se up and solve ODE s Am Undersand how o se up an solve a smple eample of he Hebb rule n D Our goal a end of class

More information

CHAPTER 10: LINEAR DISCRIMINATION

CHAPTER 10: LINEAR DISCRIMINATION CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g

More information

Lecture 6: Learning for Control (Generalised Linear Regression)

Lecture 6: Learning for Control (Generalised Linear Regression) Lecure 6: Learnng for Conrol (Generalsed Lnear Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure 6: RLSC - Prof. Sehu Vjayakumar Lnear Regresson

More information

Variants of Pegasos. December 11, 2009

Variants of Pegasos. December 11, 2009 Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on

More information

Track Properities of Normal Chain

Track Properities of Normal Chain In. J. Conemp. Mah. Scences, Vol. 8, 213, no. 4, 163-171 HIKARI Ld, www.m-har.com rac Propes of Normal Chan L Chen School of Mahemacs and Sascs, Zhengzhou Normal Unversy Zhengzhou Cy, Hennan Provnce, 4544,

More information

Li An-Ping. Beijing , P.R.China

Li An-Ping. Beijing , P.R.China A New Type of Cpher: DICING_csb L An-Png Bejng 100085, P.R.Chna apl0001@sna.com Absrac: In hs paper, we wll propose a new ype of cpher named DICING_csb, whch s derved from our prevous sream cpher DICING.

More information

A financial market with interacting investors: does an equilibrium exist?

A financial market with interacting investors: does an equilibrium exist? A fnancal marke wh neracng nvesors: does an equlbrum exs? Chrsoph Fre Dep. of Mah. and Sa. Scences Unversy of Albera Edmonon AB 6G G Canada cfre@ualbera.ca Gonçalo dos Res echnsche Unversä Berln Insu für

More information

2/20/2013. EE 101 Midterm 2 Review

2/20/2013. EE 101 Midterm 2 Review //3 EE Mderm eew //3 Volage-mplfer Model The npu ressance s he equalen ressance see when lookng no he npu ermnals of he amplfer. o s he oupu ressance. I causes he oupu olage o decrease as he load ressance

More information

Department of Economics University of Toronto

Department of Economics University of Toronto Deparmen of Economcs Unversy of Torono ECO408F M.A. Economercs Lecure Noes on Heeroskedascy Heeroskedascy o Ths lecure nvolves lookng a modfcaons we need o make o deal wh he regresson model when some of

More information

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!) i+1,q - [(! ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal

More information

Survival Analysis and Reliability. A Note on the Mean Residual Life Function of a Parallel System

Survival Analysis and Reliability. A Note on the Mean Residual Life Function of a Parallel System Communcaons n Sascs Theory and Mehods, 34: 475 484, 2005 Copyrgh Taylor & Francs, Inc. ISSN: 0361-0926 prn/1532-415x onlne DOI: 10.1081/STA-200047430 Survval Analyss and Relably A Noe on he Mean Resdual

More information

3. OVERVIEW OF NUMERICAL METHODS

3. OVERVIEW OF NUMERICAL METHODS 3 OVERVIEW OF NUMERICAL METHODS 3 Inroducory remarks Ths chaper summarzes hose numercal echnques whose knowledge s ndspensable for he undersandng of he dfferen dscree elemen mehods: he Newon-Raphson-mehod,

More information

Chapter 6: AC Circuits

Chapter 6: AC Circuits Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.

More information

ANOVA FOR DIFFUSIONS AND ITO PROCESSES. By Per Aslak Mykland and Lan Zhang

ANOVA FOR DIFFUSIONS AND ITO PROCESSES. By Per Aslak Mykland and Lan Zhang Submed o he Annals of Sascs ANOVA FOR DIFFUSIONS AND ITO PROCESSES By Per Aslak Mykland and Lan Zhang The Unversy of Chcago, and Carnege Mellon Unversy and Unversy of Illnos a Chcago Io processes are he

More information

Dual Approximate Dynamic Programming for Large Scale Hydro Valleys

Dual Approximate Dynamic Programming for Large Scale Hydro Valleys Dual Approxmae Dynamc Programmng for Large Scale Hydro Valleys Perre Carpener and Jean-Phlppe Chanceler 1 ENSTA ParsTech and ENPC ParsTech CMM Workshop, January 2016 1 Jon work wh J.-C. Alas, suppored

More information

Comb Filters. Comb Filters

Comb Filters. Comb Filters The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of

More information

How about the more general "linear" scalar functions of scalars (i.e., a 1st degree polynomial of the following form with a constant term )?

How about the more general linear scalar functions of scalars (i.e., a 1st degree polynomial of the following form with a constant term )? lmcd Lnear ransformaon of a vecor he deas presened here are que general hey go beyond he radonal mar-vecor ype seen n lnear algebra Furhermore, hey do no deal wh bass and are equally vald for any se of

More information

arxiv: v1 [cs.sy] 2 Sep 2014

arxiv: v1 [cs.sy] 2 Sep 2014 Noname manuscrp No. wll be nsered by he edor Sgnalng for Decenralzed Roung n a Queueng Nework Y Ouyang Demoshens Tenekezs Receved: dae / Acceped: dae arxv:409.0887v [cs.sy] Sep 04 Absrac A dscree-me decenralzed

More information

Robust and Accurate Cancer Classification with Gene Expression Profiling

Robust and Accurate Cancer Classification with Gene Expression Profiling Robus and Accurae Cancer Classfcaon wh Gene Expresson Proflng (Compuaonal ysems Bology, 2005) Auhor: Hafeng L, Keshu Zhang, ao Jang Oulne Background LDA (lnear dscrmnan analyss) and small sample sze problem

More information

TitleA random walk analogue of Levy's th. Studia scientiarum mathematicarum H Citation

TitleA random walk analogue of Levy's th. Studia scientiarum mathematicarum H Citation TleA random walk analogue of Levy's h Auhor(s) Fuja, Takahko Suda scenarum mahemacarum H Caon 3-33 Issue 008-06 Dae Type Journal Arcle Tex Verson auhor URL hp://hdlhandlene/10086/15876 Ths s an auhor's

More information

A New Generalized Gronwall-Bellman Type Inequality

A New Generalized Gronwall-Bellman Type Inequality 22 Inernaonal Conference on Image, Vson and Comung (ICIVC 22) IPCSIT vol. 5 (22) (22) IACSIT Press, Sngaore DOI:.7763/IPCSIT.22.V5.46 A New Generalzed Gronwall-Bellman Tye Ineualy Qnghua Feng School of

More information

PHYS 705: Classical Mechanics. Canonical Transformation

PHYS 705: Classical Mechanics. Canonical Transformation PHYS 705: Classcal Mechancs Canoncal Transformaon Canoncal Varables and Hamlonan Formalsm As we have seen, n he Hamlonan Formulaon of Mechancs,, are ndeenden varables n hase sace on eual foong The Hamlon

More information

Supplementary Material to: IMU Preintegration on Manifold for E cient Visual-Inertial Maximum-a-Posteriori Estimation

Supplementary Material to: IMU Preintegration on Manifold for E cient Visual-Inertial Maximum-a-Posteriori Estimation Supplemenary Maeral o: IMU Prenegraon on Manfold for E cen Vsual-Ineral Maxmum-a-Poseror Esmaon echncal Repor G-IRIM-CP&R-05-00 Chrsan Forser, Luca Carlone, Fran Dellaer, and Davde Scaramuzza May 0, 05

More information

Scattering at an Interface: Oblique Incidence

Scattering at an Interface: Oblique Incidence Course Insrucor Dr. Raymond C. Rumpf Offce: A 337 Phone: (915) 747 6958 E Mal: rcrumpf@uep.edu EE 4347 Appled Elecromagnecs Topc 3g Scaerng a an Inerface: Oblque Incdence Scaerng These Oblque noes may

More information

arxiv: v1 [math.pr] 6 Mar 2019

arxiv: v1 [math.pr] 6 Mar 2019 Local law and Tracy Wdom lm for sparse sochasc block models Jong Yun Hwang J Oon Lee Wooseok Yang arxv:1903.02179v1 mah.pr 6 Mar 2019 March 7, 2019 Absrac We consder he specral properes of sparse sochasc

More information

Appendix H: Rarefaction and extrapolation of Hill numbers for incidence data

Appendix H: Rarefaction and extrapolation of Hill numbers for incidence data Anne Chao Ncholas J Goell C seh lzabeh L ander K Ma Rober K Colwell and Aaron M llson 03 Rarefacon and erapolaon wh ll numbers: a framewor for samplng and esmaon n speces dversy sudes cology Monographs

More information

Graduate Macroeconomics 2 Problem set 5. - Solutions

Graduate Macroeconomics 2 Problem set 5. - Solutions Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K

More information

Optimal Investment under Relative Performance Concerns

Optimal Investment under Relative Performance Concerns Opmal Invesmen under Relave Performance Concerns Glles-Edouard ESPINOSA and Nzar TOUZI Cenre de Mahémaques Applquées Ecole Polyechnque Pars Absrac We consder he problem of opmal nvesmen when agens ake

More information

Higher-order numerical scheme for linear quadratic problems with bang bang controls

Higher-order numerical scheme for linear quadratic problems with bang bang controls Compu Opm Appl DOI 1.17/s1589-17-9948-z Hgher-order numercal scheme for lnear quadrac problems wh bang bang conrols T. Scarnc 1 V. M. Velov Receved: 3 June 17 The Auhors 17. Ths arcle s an open access

More information

Advanced Macroeconomics II: Exchange economy

Advanced Macroeconomics II: Exchange economy Advanced Macroeconomcs II: Exchange economy Krzyszof Makarsk 1 Smple deermnsc dynamc model. 1.1 Inroducon Inroducon Smple deermnsc dynamc model. Defnons of equlbrum: Arrow-Debreu Sequenal Recursve Equvalence

More information

FI 3103 Quantum Physics

FI 3103 Quantum Physics /9/4 FI 33 Quanum Physcs Aleander A. Iskandar Physcs of Magnesm and Phooncs Research Grou Insu Teknolog Bandung Basc Conces n Quanum Physcs Probably and Eecaon Value Hesenberg Uncerany Prncle Wave Funcon

More information

A NEW TECHNIQUE FOR SOLVING THE 1-D BURGERS EQUATION

A NEW TECHNIQUE FOR SOLVING THE 1-D BURGERS EQUATION S19 A NEW TECHNIQUE FOR SOLVING THE 1-D BURGERS EQUATION by Xaojun YANG a,b, Yugu YANG a*, Carlo CATTANI c, and Mngzheng ZHU b a Sae Key Laboraory for Geomechancs and Deep Underground Engneerng, Chna Unversy

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and hs arcle appeared n a journal publshed by Elsever. he aached copy s furnshed o he auhor for nernal non-commercal research and educaon use, ncludng for nsrucon a he auhors nsuon and sharng wh colleagues.

More information

2 Aggregate demand in partial equilibrium static framework

2 Aggregate demand in partial equilibrium static framework Unversy of Mnnesoa 8107 Macroeconomc Theory, Sprng 2009, Mn 1 Fabrzo Perr Lecure 1. Aggregaon 1 Inroducon Probably so far n he macro sequence you have deal drecly wh represenave consumers and represenave

More information

J i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.

J i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes. umercal negraon of he dffuson equaon (I) Fne dfference mehod. Spaal screaon. Inernal nodes. R L V For hermal conducon le s dscree he spaal doman no small fne spans, =,,: Balance of parcles for an nernal

More information

Lecture 2 M/G/1 queues. M/G/1-queue

Lecture 2 M/G/1 queues. M/G/1-queue Lecure M/G/ queues M/G/-queue Posson arrval process Arbrary servce me dsrbuon Sngle server To deermne he sae of he sysem a me, we mus now The number of cusomers n he sysems N() Tme ha he cusomer currenly

More information

M. Y. Adamu Mathematical Sciences Programme, AbubakarTafawaBalewa University, Bauchi, Nigeria

M. Y. Adamu Mathematical Sciences Programme, AbubakarTafawaBalewa University, Bauchi, Nigeria IOSR Journal of Mahemacs (IOSR-JM e-issn: 78-578, p-issn: 9-765X. Volume 0, Issue 4 Ver. IV (Jul-Aug. 04, PP 40-44 Mulple SolonSoluons for a (+-dmensonalhroa-sasuma shallow waer wave equaon UsngPanlevé-Bӓclund

More information

arxiv: v5 [math.pr] 31 Mar 2015

arxiv: v5 [math.pr] 31 Mar 2015 STOCHASTIC CONTROL REPRESENTATIONS FOR PENALIZED BACKWARD STOCHASTIC DIFFERENTIAL EQUATIONS GECHUN LIANG arxv:132.48v5 [mah.pr 31 Mar 215 Absrac. Ths paper shows ha penalzed backward sochasc dfferenal

More information

Noise prevents collapse of Vlasov Poisson point charges

Noise prevents collapse of Vlasov Poisson point charges Nose prevens collapse of Vlasov Posson pon charges Franços Delarue, Franco Flandol, Daro Vncenz To ce hs verson: Franços Delarue, Franco Flandol, Daro Vncenz. Nose prevens collapse of Vlasov Posson pon

More information

Lecture VI Regression

Lecture VI Regression Lecure VI Regresson (Lnear Mehods for Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure VI: MLSC - Dr. Sehu Vjayakumar Lnear Regresson Model M

More information

Chapter 2 Linear dynamic analysis of a structural system

Chapter 2 Linear dynamic analysis of a structural system Chaper Lnear dynamc analyss of a srucural sysem. Dynamc equlbrum he dynamc equlbrum analyss of a srucure s he mos general case ha can be suded as akes no accoun all he forces acng on. When he exernal loads

More information

Teaching Notes #2 Equilibrium with Complete Markets 1

Teaching Notes #2 Equilibrium with Complete Markets 1 Teachng Noes #2 Equlbrum wh Complee Markes 1 Pero Verones Graduae School of Busness Unversy of Chcago Busness 35909 Sprng 2005 c by Pero Verones Ths Verson: November 17, 2005 1 These eachng noes draw heavly

More information