ebook img

Convergence and stability of two classes of theta-Milstein schemes for stochastic differential equations PDF

0.25 MB·English
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Convergence and stability of two classes of theta-Milstein schemes for stochastic differential equations

Convergence and stability of two classes of theta-Milstein schemes for stochastic differential equations 5 Xiaofeng Zong, Fuke Wu, Guiping Xu, 1 ∗ † ‡ 0 2 January 16, 2015 n a J 5 1 Abstract ] This paper examines convergence and stability of the two classes of theta-Milstein schemes A for stochastic differential equations (SDEs) with non-global Lipschitz continuous coefficients: N the split-step theta-Milstein (SSTM) scheme and the stochastic theta-Milstein (STM) scheme. . h For θ [1/2,1], this paper concludes that the two classes of theta-Milstein schemes converge t ∈ a strongly to the exact solution with the order 1. For θ [0,1/2], under the additional linear m ∈ growthconditionforthedriftcoefficient,thesetwoclassesofthetheta-Milsteinschemesarealso [ strongly convergent with the standard order. This paper also investigates exponential mean- 1 square stability of these two classes of the theta-Milstein schemes. For θ (1/2,1], these two v ∈ 5 theta-Milstein schemes can share the exponential mean-square stability of the exact solution. 9 For θ [0,1/2], similar to the convergence,under the additional linear growth condition, these 6 ∈ two theta-Milstein schemes can also reproduce the exponential mean-square stability of the 3 0 exact solution. . 1 0 5 Keywords: SDEs; Strong convergence rate; Exponential mean-square stability; Stochastic 1 theta-Milstein scheme; Split-step theta-Milstein scheme. : v i X r a ∗Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, Peoples Republic of China, [email protected]. The research of this author was supported in part bythe National Natural Science Foundationsof China (No. 11422110 and No. 61473125) †School of Mathematics and Statistics, Huazhong University of Science and Technology, Wuhan, Hubei 430074, P.R. China, [email protected]. The research of this author was supported in part by the National Natural Science Foundationsof China (No. 11422110 and No. 61473125). ‡School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, Hubei 430074, P.R. China, [email protected]. The research of this author was supported in part by the National Natural Science Foundation of China (Grant No. 61272014). 1 1 Introduction During the last decades, SDEs have become increasingly important tools to describe the real world since stochastic models have wide applications in biological systems, neural network, financial engineering and wireless communications. Most SDEs cannot be solved explicitly, so numerical approximations become important tools to study stochastic models. When a numerical scheme is put forward, it is crucial that this numerical scheme can converge to the exact solution. Moreover, it also need to describe the asymptotic properties of the exact solution such as boundedness and stability. Most of the existing convergence theory for numerical methods of SDEs requires the global Lipschitz condition (see [1–3]). However, many well-known stochastic systems do not satisfy the globalLipschitzcondition,forexample,thestochasticDuffing-vanderPoloscillator [4,5],stochastic Lorenz equation [5,6], experimental psychology model [5], stochastic Ginzburg-Landau equation [1,5], stochastic Lotka-Volterra equations [1,5,7] and volatility processes [1,5] and so on. For some SDEs without the global Lipschitz condition, the classical explicit numerical schemes may not converge to the exact solution in the strong mean-square sense (for example Euler-Maruyama (EM) scheme and Milstein scheme, please see [8,9]). Hence, numerical approximations for SDEs without the global Lipschitz condition have received more and more attention in recent years. For the SDEs with the one-sided Lipschitz condition (which is weaker than the global Lipschitz condition) on the drift term and the global Lipschitz condition on the diffusion term, Hu [10] examined convergence of the backward Euler-Maruyama (BEM) scheme and obtained that the optimal rate of convergence is 0.5. Under an additional polynomial condition, Higham et al. [11,12] andBastanietal.[13]provedthatBEMandsplit-stepBEMschemes converge stronglytotheexact solution with theoptimal rate 0.5. Mao and Szpruch[14] showed that under a dissipative condition on the drift coefficient and the super linear growth condition on the diffusion coefficient, the BEM scheme is convergent with strong order of a half. Under a monotone condition, strong convergence of BEM scheme and theta-EM scheme were investigated by [15,16]. Recently, there are various explicit Euler schemes with one half order were proposed to approximate the SDEs with non-global Lipschitz coefficients, see [17–20] and the references therein. However, it is still an important and difficult work to look for more appropriate conditions to obtain the strong convergence rate of the numerical schemes for SDEs without the global Lipschitz condition. The explicit Milstein scheme for SDEs developed by Milstein [2] can obtain a strong order of convergencehigherthanEuler-typeschemes. Huetal.[21]extendedthisschemetosolveSDEswith timedelay. ImplicitMilsteinschemesundertheglobalLipschitzconditionwerestudiedbyTianand Burrage [22], Wang et al. [23], Alcock & Burrage [24]. Thetamed Milstein scheme was investigated in [25] for SDEs with non-global Lipschitz coefficients. Recently, Higham et al. [26] proposed a new Milstein scheme, named as (θ,σ)-Milstein scheme, and investigated its strong convergence when SDEs hold polynomial growth for the diffusion term. However, the strong convergence rates of the implicit Milstein schemes for SDEs with non-global Lipschitz coefficients has not yet been well investigated. 2 Stability of numerical solutions is another central problem for numerical analysis. The mean- square stability of numerical methods for linear stochastic differential equations have been studied by[27–29]. FornonlinearSDEs,Highametal.[30]showedthattheBEMandthesplit-stepBEMcan reproducethe mean-square exponential stability of theexact solution. Recently, without the global Lipschitz, Huang [31] and authors [32,33] presented conditions under which the stochastic theta method and split-step theta method can not only reproduce the exponential mean-square stability of the exact solution, but also preserve the bound of the Lyapunov exponent for sufficient small stepsize, which measures the decay rate of the numerical solutions. However, there is little work on the mean-square stability of the theta-Milstein schemes for SDEs with non-Lipschitz continuous coefficients. The main aim is to examine the boundedness and the convergence rate as well as the expo- nential mean-square stability of theta Milstein schemes for SDEs with non-Lipschitz continuous coefficients. This paper is organized as follows. The next section presents some necessary nota- tions andpreliminaries, andthen introducesthestochastic theta-Milstein scheme andthesplit-step theta-Milstein scheme. Section 3 establishes the uniform boundedness of the pth moments of the theta-Milstein schemes and shows that for θ [1/2,1], these two classes of theta-Milstein schemes ∈ are bounded in the sense of moment, but for θ [0,1/2], the linear growth condition on drift is ∈ added to obtain the moment boundedness of the theta-Milstein schemes. Section 4 proves that the theta-Milstein schemes strongly converge to the exact solution with the order 1. The final section investigates the exponential mean-square stability of these two classes of theta-Milstein schemes. 2 Notations and preliminaries Throughout this paper, unless otherwise specified, we use the following notations. Let denote |·| both the Euclidean norm in Rn. If x is a vector, its transpose is denoted by xT and the inner product is denoted by x,y = xTy for x,y Rn. a b represents max a,b and a b denotes h i ∈ ∨ { } ∧ min a,b . N represents the positive integer set, namely, N = 1,2,3,... . Let (Ω,F,P) be a + + { } { } complete probability space with a filtration F satisfying the usual conditions, that is, it is t t 0 { }≥ rightcontinuous andincreasingwhileF contains allP-nullsets. Let(w(t)) beaone-dimensional 0 t 0 ≥ Brownian motion defined on this probability space. Let f,g : Rn Rn be Borel measurable functions. Let us consider the n-dimensional SDE of 7→ the form dx(t) = f(x(t))dt+g(x(t))dw(t), t > 0 (2.1) with initial data x(0) = x Rn. Assume that f and g satisfy the following assumption: 0 ∈ Assumption 2.1. Assume that the functions f,g C1 and there exist constants µ R and c > 0 ∈ ∈ such that for any x,y Rn ∈ x y,f(x) f(y) µ x y 2, (2.2) h − − i ≤ | − | g(x) g(y)2 cx y 2. (2.3) | − | ≤ | − | 3 Remark 2.1. From conditions (2.2) and (2.3), we have the following monotone condition x,f(x) g(x)2 α+β x 2, x Rn, (2.4) h i∨| | ≤ | | ∈ where 1 1 α:= f(0)2 2g(0)2 and β := (µ+ ) 2c. 2| | ∨ | | 2 ∨ It is well-known that existence and uniqueness of the global solution of the SDE (2.1) can be guaranteed by the local Lipschitz condition and the monotone condition (or general LV condition) (see [34]). Since f,g C1 implies that f and g satisfy the local Lipschitz condition, the monotone ∈ condition (2.4) can guarantee the existence and uniqueness of the gloal solution for the SDE (2.1). This implies that Assumption 2.1 can guarantee theexistence and uniqueness of theglobal solution of the SDE (2.1). According to the monotone condition (2.4), we can present the following lemma (see Lemma 3.2 in [11]). Lemma 2.2. Under Assumption 2.1, for each p 2 there is C = C(p,T)> 0 such that ≥ E sup x(t)p C(1+E x p). 0 | | ≤ | | 0 t T h ≤ ≤ i In what follows, for the purpose of simplicity, let C represent a generic positive constant inde- pendent of the stepsize ∆, whose value may change with each appearance. Fixed any time T > 0 and given a stepsize ∆ = T/N for certain integer N, we introduce the split-step theta-Milstein (SSTM) approximation y = z +θf(y )∆, k k k (2.5) ( zk+1 = zk +f(yk)∆+g(yk)∆wk + 12L1g(yk)(|∆wk|2−∆), k = 0,1,2,...,N. where y = x(0), z = y θf(y )∆, θ [0,1], L1 = g(x) ∂ and ∆w := w((k+1)∆) w(k∆) be 0 0 0− 0 ∈ ∂x k − theBrownianincrement. Thisscheme z canbeconsideredasanextensionfromthesplit-step k k 0 { } ≥ theta methoddeveloped by ourpreviouswork[31]. Itis interesting thattheapproximation y k k 0 { } ≥ in (2.5) is in fact the stochastic theta-Milstein (STM) approximation 1 y = y +θf(y )∆+(1 θ)f(y )∆+g(y )∆w + L1g(y )(∆w 2 ∆), (2.6) k+1 k k+1 k k k k k − 2 | | − which can be proved by substituting z = y θf(y )∆ into the second equation in (2.5). The k k k − STM (2.6), investigated in [35] for linear scalar SDEs, can be consider as the special case σ = 0 of the (θ,σ)-Milstein scheme developed by Higham et al. [26]. When θ = 0, z and y are k k 0 k k 0 { } ≥ { } ≥ the classical Milstein approximation proposed in Milstein [2]. When θ = 1, y becomes the k k 0 { } ≥ drift-implicit Milstein scheme, which was investigated in [36]. Since theta-Milstein schemes (2.5) and (2.6) are semi-implicit when θ (0,1], to guarantee that they are well defined, we restrict the ∈ stepsize ∆ satisfying θµ∆ < 1. This, together with the one-sided Lipschitz condition (2.2), the equation y = z+θ∆f(y) has unique solution y = F (z) for any z Rn. ∆,θ ∈ 4 3 Uniform boundedness of pth moments In order to investigate the boundedness of pth moments and convergence of the two classes theta- Milstein approximations, we need the following assumption, which is standard for the classical Milstein scheme. Assumption 3.1. Assume that the functions f,g C2 and there exists a constant σ such that for ∈ any x,y Rn ∈ L1g(x) L1g(y)2 σ x y 2. (3.1) | − | ≤ | − | Then let us investigate the pth moment boundedness of the theta-Milstein approximations for θ [1/2,1] and θ [0,1/2), respectively. ∈ ∈ Theorem 3.1. Let Assumptions 2.1 and 3.1 hold, θ [1/2,1] and let ∆ < ∆ = 1/(2θβ). Then ∗ ∈ for each p 2 ≥ E sup z p C (3.2) k | | ≤ k∆ [0,T] h ∈ i and E sup y p C. (3.3) k | | ≤ k∆ [0,T] h ∈ i Proof. By the second equation in (2.5), 1 z 2 = z 2+ f(y )2∆2+ L1g(y )(∆w 2 ∆)2 k+1 k k k k | | | | | | 4| | | − | +2∆zTf(y )+ g(y )∆w ,L1g(y )(∆w 2 ∆) k k h k k k | k| − i 1 +2 z +f(y )∆,g(y )∆w + L1g(y )(∆w 2 ∆) + g(y )2 ∆w 2 k k k k k k k k h 2 | | − i | | | | = z 2+2∆yTf(y )+2g(y )2 ∆w 2+(1 2θ)f(y )2∆2 | k| k k | k | | k| − | k | 1 2 + L1g(y )2(∆w 2 ∆)2+ y (1 θ)z ,g(y )∆w k k k k k k 2| | | | − θh − − i 1 + y (1 θ)z ,L1g(y )(∆w 2 ∆) , k k k k θh − − | | − i where we used the equation z = y θf(y )∆. Note that θ [1/2,1]. By (2.4), we have k k k − ∈ 1 z 2 z 2+2(α+β y 2)∆+2g(y )2 ∆w 2+ L1g(y )2(∆w 2 ∆)2 k+1 k k k k k k | | ≤ | | | | | | | | 2| | | | − 2 1 θ 1 + y ,g(y )∆w 2 − z ,g(y )∆w + y ,L1g(y )(∆w 2 ∆) k k k k k k k k k θh i− θ h i θh | | − i 1 θ − z ,L1g(y )(∆w 2 ∆) , k k k − θ h | | − i 5 which implies k k z 2 z 2+2αT +β∆ y 2+2 g(y )2 ∆w 2 k+1 0 i i i | | ≤ | | | | | | | | i=0 i=0 X X k k 1 2 + y ,L1g(y )(∆w 2 ∆) + y ,g(y )∆w i i i i i i θ h | | − i θ h i i=0 i=0 X X k k 1 θ 1 2 − z ,g(y )∆w + L1g(y )2(∆w 2 ∆)2 i i i i i − θ h i 2 | | | | − i=0 i=0 X X k 1 θ − z ,L1g(y )(∆w 2 ∆) . i i i − θ h | | − i i=0 X Recall the elementary inequality: for x , ,x 0, p 1, l =1,2,...,N, 1 l ··· ≥ ≥ l l p x lp 1 xp. i ≤ − i (cid:16)Xi=1 (cid:17) Xi=1 We therefore have k k 1 p p z 2p (z 2+2αT)p +βp∆p y 2 +2p g(y )2 ∆w 2 8p 1| k+1| ≤ | 0| | i| | i | | i| − (cid:16)Xi=0 (cid:17) (cid:16)Xi=0 (cid:17) k k p p +2p y ,L1g(y )(∆w 2 ∆) +4p y ,g(y )∆w i i i i i i h | | − i h i (cid:12)Xi=0 (cid:12) (cid:12)Xi=0 (cid:12) (cid:12) (cid:12) (cid:12) (cid:12) k k (cid:12) p (cid:12) (cid:12) (cid:12) p +2p z ,g(y )∆w +2 p L1g(y )2(∆w 2 ∆)2 i i i − i i h i | | | | − (cid:12)Xi=0 (cid:12) (cid:16)Xi=0 (cid:17) (cid:12) (cid:12) k (cid:12) (cid:12) p + z ,L1g(y )(∆w 2 ∆) . (3.4) i i i h | | − i (cid:12)Xi=0 (cid:12) (cid:12) (cid:12) Note that y is F - measurable(cid:12) while ∆w is independent of(cid:12)F . Hence, for any integer m < N, i i i i k k p E sup g(y )2 ∆w 2 Np 1E sup g(y )∆w 2p i i − i i | | | | ≤ | | 0 k m 0 k m (cid:16) ≤ ≤ Xi=0 (cid:17) h ≤ ≤ Xi=0 i m = Np 1E g(y )∆w 2p − i i | | hXi=0 i m = Np 1 E g(y )2pE ∆w 2p − i i | | | | i=0 X m C∆ E[α+β y 2]p i ≤ | | i=0 X m C∆ E[αp+βp y 2p] i ≤ | | i=0 X m C +C∆ E[y 2p], (3.5) i ≤ | | i=0 X 6 where we also used (2.4). Using the Burkholder-Davis-Gundy inequality, we have k m p p/2 E sup yTL1g(y )(∆w 2 ∆) CE y 2 L1g(y )2∆2 i i | i| − i ≤ | i| | i | 0 k m h ≤ ≤ (cid:12)Xi=0 (cid:12) i hXi=0 i (cid:12) (cid:12) m (cid:12) (cid:12) C∆p(m+1)p/2 1 E[y 2 L1g(0)2 +σ y 2]p/2 − i i ≤ | | | | | | i=0 X m C∆p/2+C∆p/2+1 E[y 2p], (3.6) i ≤ | | i=0 X k m p p/2 E sup yTg(y )∆w CE y 2 g(y )2∆ i i i ≤ | i| | i | 0 k m h ≤ ≤ (cid:12)Xi=0 (cid:12) i hXi=0 i (cid:12) (cid:12) m (cid:12) (cid:12) C∆p/2(m+1)p/2 1E y p[α+β y 2]p/2 − i i ≤ | | | | i=0 X m C +C∆ [1+E[y 2p], (3.7) i ≤ | | i=0 X k m p p/2 E sup zTg(y )∆w CE z 2 g(y )2∆ i i i ≤ | i| | i | 0 k m h ≤ ≤ (cid:12)Xi=0 (cid:12) i hXi=0 i (cid:12) (cid:12) m (cid:12) (cid:12) C∆p/2(m+1)p/2 1E z p[α+β y 2]p/2 − i i ≤ | | | | i=0 X m m C∆ [1+E[y 2p]+C∆ E[z 2p], (3.8) i i ≤ | | | | i=0 i=0 X X and k m p p/2 E sup zTL1g(y )(∆w 2 ∆) CE z 2 L1g(y )2∆2 i i | i| − i ≤ | i| | i | 0 k m h ≤ ≤ (cid:12)Xi=0 (cid:12) i hXi=0 i (cid:12) (cid:12) m (cid:12) (cid:12) C∆p(m+1)p/2 1 E[z 2 L1g(0)2 +σ y 2]p/2 − i i ≤ | | | | | | i=0 X m m C +C∆ E[y 2p]+C∆ E[z 2p]. (3.9) i i ≤ | | | | i=0 i=0 X X 7 Similarly, we have k k p E sup L1g(y )2(∆w 2 ∆)2 Np 1E sup L1g(y )(∆w 2 ∆)2p i i − i i | | | | − ≤ | | | − | 0 k m 0 k m (cid:16) ≤ ≤ Xi=0 (cid:17) h ≤ ≤ Xi=0 i m = Np 1E L1g(y )(∆w 2 ∆)2p − i i | | | − | hXi=0 i m Np 1 E L1g(y )2pE (∆w 2 ∆)2p − i i ≤ | | | | | − | i=0 X m = C∆ E[L1g(0)2 +σ y 2]p i | | | | i=0 X m C∆ E[L1g(0)2p +σ y 2p] i ≤ | | | | i=0 X m C +C∆ E[y 2p]. (3.10) i ≤ | | i=0 X Combining (3.5)-(3.10) with (3.4) yields m m E sup z 2p C +C∆ E[y 2p]+C∆ E[y 2p] k i i | | ≤ | | | | 0 k m+1 h ≤ ≤ i Xi=0 Xi=0 m m C +C∆ E sup y 2p +C∆ E sup z 2p . (3.11) k k ≤ | | | | 0 k i 0 k i Xi=0 h ≤ ≤ i Xi=0 h ≤ ≤ i Using z = y θf(y )∆ and (2.4), we have k k k − z 2 = y 2 2θyTf(y )∆+θ2∆2 f(y )2 | k| | k| − k k | k | (1 2θ∆β)y 2 2θ∆α, k ≥ − | | − that is, (1 2θ∆β)y 2 z 2+2θ∆α, (3.12) k k − | | ≤ | | which together with (3.11) implies that for ∆ < ∆ ∗ m E sup z 2p C +C∆ E sup z 2p . k k | | ≤ | | 0 k m+1 0 k i h ≤ ≤ i Xi=0 h ≤ ≤ i Using the discrete-type Gronwall inequality and noting that (m+1)∆ T give ≤ E sup z 2p C. (3.13) k | | ≤ 0 k m+1 h ≤ ≤ i This together with (3.12) gives the desired assertion (3.3). The following theorem gives the moment boundedness for θ [0,1/2). ∈ 8 Theorem 3.2. Let Assumptions 2.1 and 3.1 hold, θ [0,1/2) and let ∆ < ∆ = 1/(2θβ) (∆ = 1 1 ∈ ∞ if θ = 0). If function f satisfies the linear growth condition f(x)2 K(1+ x 2), (3.14) | | ≤ | | then for each p 2 ≥ E sup y p C (3.15) k | | ≤ k∆ [0,T] h ∈ i and E sup z p C. (3.16) k | | ≤ k∆ [0,T] h ∈ i Proof. By (2.5), 1 z 2 = z 2+2 z ,f(y )∆+g(y )∆w + L1g(y )(∆w 2 ∆) k+1 k k k k k k k | | | | h 2 | | − i 1 2 + f(y )∆+g(y )∆w + L1g(y )(∆w 2 ∆) . (3.17) k k k k k 2 | | − (cid:12) (cid:12) (cid:12) (cid:12) Note that (cid:12) (cid:12) z = y θf(y )∆. (3.18) k k k − Substituting this into (3.17) produces 1 z 2 z 2+2 y ,f(y )∆+g(y )∆w + L1g(y )(∆w 2 ∆) k+1 k k k k k k k | | ≤ | | h 2 | | − i 1 +θ2∆2 f(y )2+2f(y )∆+g(y )∆w + L1g(y )(∆w 2 ∆)2 k k k k k k | | | 2 | | − | z 2+2yTf(y )∆+2yTg(y )∆w +yTL1g(y )(∆w 2 ∆) ≤ | k| k k k k k k k | k| − i +7∆2 f(y )2+6g(y )∆w 2+3L1g(y )(∆w 2 ∆)2 k k k k k | | | | | | | − | z 2+(2α+7f(0)2∆)∆+(2β +7K∆)y 2∆ k k ≤ | | | | | | +2yTg(y )∆w +yTL1g(y )(∆w 2 ∆) k k k k k | k| − i +6g(y )∆w 2+3L1g(y )(∆w 2 ∆)2, k k k k | | | | | − | which implies k z 2 z 2+(2α+7f(0)2∆)T +(2β +7K∆)∆ y 2 k+1 0 i | | ≤ | | | | | | i=0 X k k +2 yTg(y )∆w + yTL1g(y )(∆w 2 ∆) i i i i i | i| − i i=0 i=0 X X k k +6 g(y )∆w 2+3 L1g(y )(∆w 2 ∆)2. (3.19) i i i i | | | | | − | i=0 i=0 X X 9 Similar to (3.4), we have k 1 p z 2p (z 2+(2α+7f(0)2∆)T)p+(2β +7K∆)p∆p y 2 6p 1| k+1| ≤ | 0| | | | i| − (cid:16)Xi=0 (cid:17) k k p p +2p yTg(y )∆w + yTL1g(y )(∆w 2 ∆) i i i i i | i| − i (cid:12)Xi=0 (cid:12) (cid:12)Xi=0 (cid:12) (cid:12) (cid:12) (cid:12) (cid:12) k k (cid:12) (cid:12) p (cid:12) (cid:12) p +6p g(y )∆w 2 +3p L1g(y )(∆w 2 ∆)2 . (3.20) i i i i | | | | | − | (cid:16)Xi=0 (cid:17) (cid:16)Xi=0 (cid:17) Combining (3.5)-(3.7), (3.10) with (3.20) yields m E sup z 2p C +C∆ E[y 2p], k i | | ≤ | | 0 k m+1 h ≤ ≤ i Xi=0 which together with (3.12) implies m m E sup z 2p C +C∆ E[y 2p] C +C∆ E[ sup z 2p]. k i k | | ≤ | | ≤ | | 0 k m+1 0 k i h ≤ ≤ i Xi=0 Xi=0 ≤ ≤ Note that (m+1)∆ T. Using the discrete-type Gronwall inequality gives the desired assertion ≤ (3.16). Similarly, using (3.12) and (3.16) gives another desired assertion (3.15). Remark 3.1. Forθ [0,1/2), thelineargrowthcondition(3.14)maybenecessaryforguaranteeing ∈ the moment boundednessof the theta-Milstein schemes. This fact can be found in [32, Lemma 3.2] and [8,9]. 4 Convergence of the theta-Milstein approximations Let us now introduce appropriate continuous-time interpolations corresponding to the discrete numerical approximations. More accurately, let us define the continuous solutions z(t) and y(t) for t [t ,t ) as follows k k+1 ∈ 1 z(t) = z(t )+(t t )f(y )+g(y )(w(t) w(t ))+ L1g(y )(w(t) w(t )2 (t t )), k k k k k k k k − − 2 | − | − −  y(t)= F (z(t)),  ∆,θ (4.1)  with z(0) = z = y θ∆f(y ), where t = k∆. Note that z(t) = y(t) θf(y(t))∆. Then the 0 0 0 k − − continuous-time approximations z(t) and y(t) are F - measurable. In our analysis it will be more t natural to work with the equivalent definition of z(t) t t t s z(t) = z(0)+ f(y(sˇ))ds+ g(y(sˇ))dw(s)+ L1g(y(uˇ))dw(u)dw(s), (4.2) Z0 Z0 Z0 Zsˇ where sˇ= t for s [t ,t ). Note that z(t ) = z and y(t ) = y . We refer to z(t) and y(t) as k k k+1 k k k k ∈ the continuous-time extensions of the discrete approximations z and y , respectively. k k 10

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.