Analytic Approximation of the Solutions of Stochastic Differential Delay Equations with Poisson Jump and Markovian Switching
Abstract
We are concerned with the stochastic differential delay equations with Poisson jump and Markovian switching (SDDEsPJMSs). Most SDDEsPJMSs cannot be solved explicitly as stochastic differential equations. Therefore, numerical solutions have become an important issue in the study of SDDEsPJMSs. The key contribution of this paper is to investigate the strong convergence between the true solutions and the numerical solutions to SDDEsPJMSs when the drift and diffusion coefficients are Taylor approximations.
1. Introduction
Recently there has been an increasing interest in the study of stochastic differential delay equations with Poisson jump and Markovian switching (SDDEsPJMSs). Svīshchuk and Kazmerchuk [1] investigated stability of stochastic differential delay equations with linear Poisson jumps and Markovian switchings. While Luo [2] discussed the comparison principle and several kinds of stability of Itô stochastic differential delay equations with Poisson jump and Markovian switching. Besides, Li and Chang [3] discussed the convergence of the numerical solutions of stochastic differential delay equations with Poisson jump and Markovian switching. In the present paper we will further research this topic and our focus is on the convergence of numerical solution to stochastic differential delay equation with Poisson jump and Markovian switching when the coefficients are Taylor approximations.
Stochastic differential delay equation with Poisson jump and Markovian switching may be considered as extension of stochastic differential delay equation with Poisson jump. Of course, it may also be regarded as an generalization of stochastic differential delay equation with Markovian switching. Similar to stochastic differential delay equations with Poisson jump, explicit solutions can hardly be obtained for the stochastic differential delay equations with Poisson jump and Markovian switching. Thus appropriate numerical approximation schemes such as the Euler (or Euler-Maruyama) are needed if we apply them in practice or to study their properties. There is an extensive literature concerning the approximate schemes for either stochastic differential delay equations with Poisson jump or stochastic differential delay equations with Markovian switching [4–12].
However, the rate of convergence to the true solution by the numerical solution is different for different numerical schemes [13]. Recently, Janković and Ilić [14] have investigated the rate of convergence between the true solution and numerical solution of the stochastic differential equations in the sense of the Lp-norm when the drift and diffusion coefficients are Taylor approximations, up to arbitrary fixed derivatives. Moreover, Jiang et al. [15] generalized the Taylor method to stochastic differential delay equations with Poisson jump. Since the rate of convergence for such a numerical method is faster than the result obtained in [13], in this paper, we intend to generalize the above method to the SDDEsPJMSs case and consider the strong convergence between the true solution and numerical; solution to SDDEsPJMSs if the drift and diffusion coefficients are Taylor approximations, up to arbitrary fixed derivatives. To the best of our knowledge, so far there seem to be no existing results. Therefore, the aim of this paper is to close this gap.
In Section 2, we introduce necessary notations and approximation scheme. Then comes our main result that the Taylor approximate solutions will converge to the true solutions of SDDEsPJMSs. The proof of this main result is rather technical so we present several lemmas in Section 3 and then complete the proof in Section 4.
2. Approximation Scheme and Hypotheses
Throughout this paper, we let (Ω, ℱ, {ℱt} t≥0, P) be a complete probability space with a filtration {ℱt} t≥0 satisfying the usual conditions (i.e., it is increasing and right-continuous while ℱ0 contains all P-null sets). Let C([−τ, 0]; R) be the family of continuous function ξ from [−τ, 0] to R with the norm ∥ξ∥ = sup −τ≤t≤0 | ξ(t)|. We also denote by the family of all bounded, ℱ0-measurable, C([−τ, 0]; R)-valued random variables and denote by the family of all ℱt-measurable, C([−τ, 0]; R)-valued random variables ξ = {ξ(t):−τ ≤ t ≤ 0} satisfying sup −τ≤t≤0E | ξ(t)|p < κ < ∞, where κ is a positive constant.
In the paper, , and denote, respectively, jth-order partial derivatives of f, g and h with respect to x. Further, to ensure the existence and uniqueness of the solution to (2.2), we impose the following hypotheses.
for x1, x2, y1, y2 ∈ R and i ∈ S.
(H3) f, g, and h have Taylor approximations in the second argument, up to m1th, m2th, and m3th derivatives, respectively.
In order to show the strong convergence of the numerical solutions and the exact solutions to (2.2), we will need the following assumption.
Remark 2.1. (H1) shows that the exact solutions to (2.2) admit finite moments; see [15]. If m1 = m2 = m3 = 0, then (H1) shows also that the numerical solutions and the exact solutions admit finite moments (see, [1, 3]).
We can now state our main result of this paper.
Theorem 2.2. Under assumptions(H1)–(H5), for any p ≥ 2, then
The proof of this theorem is rather technical. We will present a number of useful lemmas in Section 3 and then complete the proof in Section 4.
3. Lemmas
Throughout our analysis, Ci, i = 1,2, … denote generic constants, independent of h. In order to prove the main theorem, the following lemmas are useful.
Lemma 3.1. If assumptions(H1), (H3), (H4), and (H5)hold, then, for2 ≤ ρ ≤ (m + 1)p,
Proof. For notation simplicity reason, let us denote that
Lemma 3.2. If assumptions (H1)–(H5) hold, then, for 2 ≤ ρ ≤ (m + 1)p,
Proof. Clearly, for any t ≥ 0, there exists an integer k ≥ 0 such that t ∈ [tk, tk+1). In what follows, we split the following three cases to complete the proof.
Case 1. If −τ ≤ tk − τ ≤ t − τ ≤ 0, we then have, from (H2),
Case 2. If 0 ≤ tk − τ ≤ t − τ, then, by Lemma 3.1, we have
Case 3. If −τ ≤ tk − τ ≤ 0 ≤ t − τ, note that
Lemma 3.3. If assumptions (H1) and (H5) hold, then, for p ≥ 2,
4. Proof of Theorem 2.2
This proof is therefore complete.
Remark 4.1. If m1 = m2 = m3 = 0, then the approximate scheme (2.7) is reduced to Euler-Maruyama method for stochastic differential delay equations with Poisson Jump and Markovian switching, which has been discussed in [3].
Remark 4.2. As is well known, Taylor approximation is effectively applicable in engineering if the equations can be solved explicitly. If not, since polynomials are very useful analytic functions, the approximation in the paper can be useful in other applications of stochastic Taylor expansion, especially in the construction of various time discrete approximations of Itô processes by using Itô-Taylor expansion such as Euler-Maruyama approximation and Milstein approximation, which has order 1/2 and 1, respectively [3, 8, 13]. All these show that numerical methods based on Taylor expansions of higher degrees could be improved by combining them with analytic approximations presented in this paper.
Acknowledgments
The project reported here was supported by the Foundation of Wuhan Polytechnic University and Zhongnan University of Economics and Law for Zhenxing.