- Research
- Open Access
- Published:
Numerical solutions of neutral stochastic functional differential equations with Markovian switching
Advances in Difference Equations volume 2019, Article number: 81 (2019)
Abstract
Until now, the theories about the convergence analysis, the almost surely and mean square exponential stability of the numerical solution for neutral stochastic functional differential equations with Markovian switching (NSFDEwMSs) have been well established, but there are very few research works concentrating on the stability in distribution of numerical solution. This paper will pay attention to the stability in distribution of numerical solution of NSFDEwMSs. The strong mean square convergence analysis is also discussed.
1 Introduction
Neutral functional differential equations (NFDEs) are a class of differential equations, in which the state not only depends on the past and the current values, but also involves the derivatives with delays [6]. Since NFDEs have their extensive applications in chemical process, the theory of aeroelasticity, Lotka–Volterra systems, steam or water pipes, heat exchangers, and partial element equivalent circuits [7], many excellent studies (see, e.g., [15, 18] and the references therein) have presented the basic theory of NFDEs. When NFDEs are subject to the environmental external disturbances, they can be characterized by neutral stochastic functional differential equations (NSFDEs) [10, 17]. Such equations have been applied in science and engineering. The existence-uniqueness theorem and the asymptotic behavior for NSFDEs have been extensively discussed, see [9, 10] and their cited references. To our knowledge, it is difficult to obtain the explicit solutions of most of NSFDEs. So the numerical solutions become a very useful tool. Consequently, studying the numerical solution of NSFDEs is becoming more and more important. The common difference scheme is the Euler–Maruyama (EM) method due to its convenient computations and implementations, for example, see [11, 12] and the references therein. In [21], influenced by Mao’s work [12], Wu et al. analyzed the EM scheme of NSFDEs and gave the strong convergence between the exact solution and the numerical solution.
In many practical systems, due to component failures, subsystem interconnection changes and sudden environmental interferences may cause structural and parameter abrupt changes. In order to solve this problem, hybrid systems driven by continuous-time Markov chain have been introduced. All of these systems have a typical feature: the state has continuous values and the jumping parameters take some discrete values [1, 22], and thus such systems can be taken as the special case of hybrid systems [20]. By using the Lyapunov function approach, the exponential stability in moment, the almost surely exponential stability and the almost surely asymptotic stability for neutral stochastic delay differential equations with Markovian switching (NSDDEwMSs) were discussed in [5, 13], respectively. Some basic theoretical results and useful approaches on numerical solution for stochastic delay differential equations with Markovian switching (SDDEwMSs) were systematically introduced in [14]. In [8, 26], the EM method and the convergence of numerical solutions for NSDDEwMSs on the basis of the local Lipschitz condition were developed. Recently, the exponential stability of the EM method for NSFDEs with jumps was analyzed in [16]. The almost surely and mean square exponential stability of numerical solutions for NSFDEs were considered in [23, 27]. In [28], Zong et al. analyzed the mean square exponential stability of the numerical solutions for NSFDEs.
Most of these papers discussed in [16, 23, 27, 28] are related with the asymptotic stability in mean square or in probability, which means that the numerical solution will tend to zero in mean square or in probability as time t approaches infinity. Nevertheless, the asymptotic behavior sometimes is too strong, and under these circumstances to know if the numerical solution will converge in distribution or not is very useful. These properties are referred to as the asymptotic stability in distribution. The asymptotic stability in distribution of the exact solution and the numerical solution for stochastic functional differential equations with Markovian switching (SFDEwMSs) was presented in [2, 3, 25] and their cited references. Some results on the asymptotic stability in distribution of the exact solution for NSFDEwMSs were analyzed in [4]. In [24], although the stability in distribution of numerical solution for stochastic differential equations was considered, the asymptotic stability in distribution of the numerical solution to NSFDEwMSs was not developed yet, due to the difficulty stemming from the simultaneous presence of the neutral item and the Markovian switching. This paper will fill this gap.
In this paper, we study the EM numerical solutions of the following NSFDEwMSs:
with the initial data \(y_{0}= \xi \in L_{\mathcal{{F}}_{0}}^{p}([- \tau ,0]; \Re ^{n})\) and \(r(0)=i_{0}\in S\), where \(\mathcal{D}(\cdot ,\cdot )\) and \(f(\cdot ,\cdot ): \mathcal{C}([-\tau , 0]; \Re ^{n}) \times \mathcal{S} \to \Re ^{n}\), and \(g( \cdot ,\cdot ): \mathcal{C}([-\tau , 0]; \Re ^{n}) \times \mathcal{S} \to \Re ^{n\times m}\), \(y(t) \in \Re ^{n} \) for each t and \(y_{t}=y(t+ \theta ): -\tau \le \theta \le 0\). Our primary objective is to extend the method developed in [19, 21], and [24] to NSFDEwMSs and to study the stability in distribution as well as the strong convergence for numerical approximations when \(f(\cdot ,\cdot )\) and \(g(\cdot ,\cdot )\) satisfy both the global Lipschitz condition and the monotonicity condition, and \(\mathcal{D}( \cdot ,\cdot )\) is a contractive mapping.
We should point out that although the EM method used in this paper is borrowed from [21], in which the convergence in finite time was studied, in this paper we impose different conditions from those in [21] and investigate the long-term behavior of the numerical solutions. Besides, the difficulty stemming from the co-occurrence of the neutral term and the Markovian switching can be overcome in this paper. For the self-contained result, the strong mean square convergence analysis of the numerical solution to NSFDEwMSs is also introduced under our assumptions.
This paper consists of the following sections. In Sect. 2, some necessary results are introduced and the definition of the EM approximate solution to NSFDEwMSs is given. We present the main results and give the technique proofs in Sect. 3. We show the relationship between the invariant measure of the numerical solution and that of the exact solution in Sect. 4. In Sect. 5, we give an example to illustrate the results. For the self-contained result, the strong convergence of the approximation solutions for NSFDEwMSs under our assumptions is discussed as an appendix.
2 Euler–Maruyama method: numerical schemes and preparatory lemmas
Throughout this paper, let \((\varOmega , \mathcal{F}, \{\mathcal{F}_{t} \}_{t\ge 0}, P)\) be a complete probability space with a filtration \(\{\mathcal{F}_{t}\}_{t\ge 0}\) satisfying the usual conditions (i.e., it is increasing and right-continuous, while \(\mathcal{F}_{0}\) contains all P-null sets). Let \(w(t)=(w_{1}(t),w_{2}(t), \ldots , w_{m}(t))^{T}\), \(t \geq 0\), be an m-dimensional Brownian motion defined on the probability space with \(\tilde{v}^{T}\) denoting the transpose of a vector ṽ. Let \(|\cdot |\) be the Euclidean norm in \(\Re ^{n}\) and \(\Re ^{n\times m}\). If A is a vector or matrix, its transpose is denoted by \(A^{T}\). For a matrix A, its trace norm is denoted by \(|A|=\sqrt{\operatorname{trace}(A^{T}A)}\). Denote by \(\mathcal{C}=\mathcal{C}([-\tau ,0]; \Re ^{n})\) the family of continuous functions φ from \([-\tau , 0]\) to \(\Re ^{n}\) with the norm \(\|\varphi \|=\sup_{-\tau \le \theta \le 0}|\varphi (\theta )|\). Let \(L_{\mathcal{{F}}_{0}}^{p}([-\tau , 0]; \Re ^{n})\) denote the family of \(\mathcal{F}_{0}\)-measurable \(\mathcal{C}([-\tau ,0]; \Re ^{n})\)-valued random variables ξ such that \(E\|\xi \|^{p}:=E( \sup_{-\tau \le t\le 0}|\xi (t)|^{p}) <\infty \) (\(p\geq 2\)). If \(x(t)\) is an \(\Re ^{n}\)-valued stochastic process for any \(t \in [- \tau , \infty )\), denote \(x_{t}=\{x(t+\theta ): -\tau \le \theta \le 0\}\) for any \(t\ge 0\). Let \(r(t)\) (\(t \geq 0\)) be a right-continuous Markov chain on the probability space taking values in a finite state space \(\mathcal{S}=\{1,2, \ldots , N\}\) with the generator \(\varGamma =( \gamma _{ij})_{n \times n}\) given by
where \(\delta >0\). Here, \(\gamma _{ij}\) is the transition rate from i to j and \(\gamma _{ij}>0\) if \(i \neq j\), while
In this paper, it is always assumed that the Markov chain \(r(\cdot )\) is independent of the Brownian motion \(w(\cdot )\). It is well known that almost every sample path of \(r(\cdot )\) is a right-continuous step function with a finite number of simple jumps in any finite subinterval of \(\Re _{+} :=[0,\infty )\).
In this paper, we consider the following n-dimensional NSFDEwMSs:
with the initial data \(y_{0}= \xi \in L_{\mathcal{{F}}_{0}}^{p}([- \tau ,0]; \Re ^{n})\) and \(r(0)=i_{0}\in \mathcal{S}\), where
Assumption 1
For any \(\varphi , \phi \in \mathcal{C} \), there exist \(\lambda _{1}>0\), \(\lambda _{2}>0\), \(\lambda _{3}>0\), \(\kappa \in (0,1) \), and a probability measure \(\rho (\cdot )\) on \([-\tau ,0]\) such that
and
Assumption 1 can guarantee the existence and uniqueness of the solution for (1). It is seen from (4) that
By (3), we have
where \(a=2|f(0,i)|^{2}\vee 2|g(0,i)|^{2}\).
For any \(\epsilon >0\), from (2), (3), and (4), we have
Assumption 2
For any \(\xi \in L_{\mathcal{{F}}_{0}}^{p}([- \tau , 0]; \Re ^{n})\), there exists a nondecreasing function \(\alpha (\cdot )\) such that, for any \(p\geq 2\),
with the property \(\alpha (u)\rightarrow 0\) as \(u\rightarrow 0^{+}\).
Theorem 2.1
Under Assumptions 1 and 2, NSFDEwMSs (1) have a unique continuous solution \(y(t)\) on \(t\geqslant -\tau \). Moreover, the solution has the property that
for any \(T>0\), where C̄ is a positive constant only dependent on τ, κ, T, and \(\lambda _{3}\). In other words, the pth (\(p\geq 2\)) moment of the solution is finite.
Proof
The proof is almost similar to Theorem 2.4 of [5], so it is omitted here. □
Let \(r_{k}^{\Delta }=r(k\Delta )\) for \(k\ge 0\). We can use the one-step transition probability matrix \(P(\Delta ) =( P_{ij}(\Delta ))_{n \times n} = e^{\Delta \varGamma } \) to simulate the discrete Markov chain \(\{r_{k}^{\Delta }, k=0, 1, 2, \ldots \}\), where the details can be found in [14]. We can now define the EM approximate solution to NSFDEwMSs (1). Let the step size \(\Delta \in (0,1)\) be a fraction of T and τ (\(T>0\)), namely, \(\Delta =\frac{T }{N}=\frac{ \tau }{M}\) for some integer \(N>T\) and \(M>\tau \). The discrete EM approximate solution \(\bar{X}(k\Delta )\), \(-M\le k\le N\) is defined as follows:
where \(\Delta w_{k}=w((k+1)\Delta )-w(k\Delta )\) and \(\bar{X}_{k \Delta }=\{\bar{X}_{k\Delta }(\theta ): -\tau \le \theta \le 0\}\) is a \(\mathcal{C}\)-valued random variable defined as follows:
for \(i\Delta \le \theta \le (i+1)\Delta \), \(i=-M, \ldots , -1\), where in order for \(\bar{X}_{-\Delta }\) to be well defined, we set \(\bar{X}(-(M+1) \Delta )=\xi (-M\Delta )\). Let \(t_{k}=k \Delta \), \(k=0, 1, \ldots ,N-1\), and define
In our analysis, it will be more convenient to use continuous-time approximations. We first introduce the \(\mathcal{C}\)-valued step process
and then we define the continuous EM approximate solution as follows: let \(X(t)=\xi (t)\) for \(-\tau \leq t \leq 0\), and let \([\frac{t}{ \Delta }]\) be the integer part of \(\frac{t}{\Delta }\), while for \(t\in [[\frac{t}{\Delta }]\Delta ,([\frac{t}{\Delta }]+1)\Delta )\),
where \(\bar{\mathcal{D}}(t)=\mathcal{D} (\bar{X}_{([\frac{t}{ \Delta }]-1)\Delta }+\frac{t-[\frac{t}{\Delta }]\Delta }{\Delta }( \bar{X}_{[\frac{t}{\Delta }]\Delta }-\bar{X}_{([\frac{t}{\Delta }]-1) \Delta }),\bar{r}(t) )\).
Obviously, (11) can be written as
Observe that \(X(t_{[\frac{t}{\Delta }]})=\bar{X}(t_{[\frac{t}{\Delta }]})\), that is, the discrete and continuous EM approximate solutions coincide at the gridpoints.
Rewriting (10), we have
which yields
Moreover, by [21], we have
where
Moreover, the same way as [2, Lemma 5.1], we have the following result.
Proposition 2.2
\((X_{k\Delta }, r_{k}^{\Delta })\), \(k\ge 0\), is a homogeneous Markov chain, that is,
3 Stability in distribution
In this section, we will establish two sufficient criteria on the stability in distribution for the Markov chain \((X_{k\Delta }, r_{k} ^{\Delta })\) with the initial data \((\xi , i)\). It should be pointed out that the continuous EM approximate solutions \(X(t)\) is a point, whereas \(X_{t}\) is a continuous function on the interval \([-\tau ,0]\). For the Markov chain \((X_{k\Delta }, r_{k}^{\Delta })\), we define the k-step transition probability for any Borel set A in \(\mathcal{C} \), \(\xi \in \mathcal{C}\) and \(i, j\in \mathcal{S}\) such that
Let \(\mathscr{P}(\mathcal{C} \times \mathcal{S})\) denote all probability measures on \(\mathcal{C} \times \mathcal{S}\). In order to characterize the stability in distribution, we need to introduce the following metric on the space \(\mathscr{P}(\mathcal{C} \times \mathcal{S})\). For any \(P_{1},P_{2}\in \mathscr{P}(\mathcal{C} \times \mathcal{S})\), define metric \(d_{\mathbb{L}}\)
and
Definition 3.1
The Markov chain \((X_{k\Delta }, r_{k}^{\Delta })\) is said to be stable in distribution if there exists a probability measure \(\pi ^{\Delta } \in \mathscr{P}(\mathcal{C} \times \mathcal{S})\) such that \(P_{k}^{ \Delta }((\xi , i); \cdot \times \cdot )\) converges weakly to \(\pi ^{\Delta }(\cdot \times \cdot )\) as \(k\longrightarrow \infty \), for any \(\xi \in \mathcal{C}\), \(i \in \mathcal{S}\), that is,
In order to highlight the initial value ξ, we may write \(y(t)\) and \(X(t)\) by \(y^{\xi }(t)\) and \(X^{\xi }(t)\), respectively.
Definition 3.2
Let \(p\geq 2\). The segment process \(X_{k\Delta }\) is said to have Property (P1) if, for any \(\xi \in \mathcal{C}\),
Moreover, the segment process \(X_{t}\) is said to have Property (P2) if
uniformly in \((\xi ,\eta )\in K\times K\), where K in (14) and (15) denotes any compact subset of \(\mathcal{C}\).
Theorem 3.1
If \(X_{k\Delta }\) has Properties (P1) and (P2), then \((X_{k\Delta }, r _{k}^{\Delta })\) is stable in distribution.
Since the proof of Theorem 3.1 is similar to [14, Theorem 5.43], we omit it here to save the space. Next, we will show that under Assumption 1, \(X_{k\Delta }\) has Properties (P1) and (P2) as long as the stepsize Δ is sufficiently small. The following result is therefore immediate.
Theorem 3.2
Assume that Assumption 1 holds. If
then \((X_{k\Delta }, r_{k}^{\Delta })\) is stable in distribution when the stepsize Δ is sufficiently small.
Therefore, in order to show that \((X_{k\Delta }, r_{k}^{\Delta })\) is stable in distribution, we only need to prove that \(X_{k\Delta }\) satisfies properties (P1) and (P2).
Lemma 3.3
and Δ is sufficiently small, then there exists a constant \(C>0\), which may be dependent on the initial value ξ such that the EM approximate solution has the property
where K is a compact set in \(\mathcal{C}\). In other words, \(X_{k\Delta }\) has Property (P1) provided the stepsize Δ is sufficiently small.
Proof
Recall the inequality that, for any \(p\geq 2\), \(\beta >0\),
which yields
From (5), (13), and \(\|\bar{X}_{-\Delta }\|\leq \| \bar{X}_{0}\|\), we can see that
Application of the Itô formula yields
It is obviously seen that \(I_{1}\) is only dependent on the initial data ξ. Now, we will give the estimations of \(I_{i}\) (\(i=2,\ldots ,5\)), respectively. Before estimating them, one important inequality can be computed as follows:
From Assumption 1 and (21), we have
and
It follows from (12) that, for any \(t\in [t_{[\frac{t}{ \Delta }]},t_{[\frac{t}{\Delta }]+1} )\) (\(t\geq 0\)),
where \(I_{31}= [12\lambda _{3}(M+2) E (|\bar{X}(t)|^{2} )+6a] \Delta \).
We now compute \(I_{32}\) and \(I_{33}\), respectively. From Assumptions 1 and 2, we have
and
where (4), (8), and the proof of Lemma 3.2 in [21] are used, \(D(l)=\frac{8\lambda _{3}}{1-\kappa } [(2l-1)!!N ]^{\frac{1}{l}}\), and \(l>1\) is an arbitrary integer.
In particular, when \(l=3\), (25) can be rewritten as
where \(C_{2}=\max \{ [C_{1}+D(3)+\frac{8\lambda _{3}}{1- \kappa } ]\frac{6\kappa ^{2}}{1-2\kappa }, \frac{6\kappa ^{2}}{1-2 \kappa }, \frac{6\kappa ^{2}[2a+4aD(3)]}{(1-\kappa )(1-2\kappa )} \}\).
where \(C_{3}=\max \{6a+C_{2},12\lambda _{3}(M+2)+C_{1}+C_{2} \}\).
Substituting (27) into (23) yields
where \(C_{4}=\max \{\frac{a+C_{3}}{\lambda },\frac{\lambda _{3}e ^{\lambda \tau }-C_{3}}{\lambda },C_{3}+\lambda _{3}(1+e^{\lambda \tau }) \}\).
From Assumption 1 and (21), we obtain
and
Substituting (22), (28)–(30) into (20) gives
where \(\bar{\lambda }=-\lambda _{1}+\lambda +C_{4}\Delta ^{\frac{1}{6}}+2 \epsilon +\epsilon \lambda _{3}+2\lambda _{3}+(2\lambda \kappa +\lambda \kappa ^{2}+\lambda _{2}+2\epsilon \kappa ^{2}+\epsilon \lambda _{3}+2 \kappa ^{2}+2\lambda _{3})e^{\lambda \tau }\).
Using (16), we can choose a suitable positive constant λ such that \(-\lambda _{1}+\lambda +2\lambda _{3}+(2\lambda \kappa +\lambda \kappa ^{2}+\lambda _{2}+2\kappa ^{2}+2\lambda _{3})e^{ \lambda \tau }<0\). Then, when \(\Delta >0\) and \(\epsilon >0\) are sufficiently small, it yields that \(\bar{\lambda }<0\). Hence
Substituting (31) into (18), we have
Choosing an appropriate positive constant β such that \(\beta -(1+\beta )k^{2}>0\), then for all \(t\geq -\tau \), we have
We now estimate the moment of the segment process \(X_{t}\). According to the Itô formula, for any \(t\geq \tau \) and \(-\tau \leq \theta \leq 0\), we have
where
By the Burkholder–Davis–Gundy inequality (see [10]), one obtains
Substituting (34) into (33), we have
Therefore, (32) and (35) lead to
Hence, the required assertion follows. The proof is therefore completed. □
Lemma 3.4
and Δ is sufficiently small, then the EM approximate solution has Property (P2), that is,
where K is a compact subset in \(\mathcal{C}\).
Proof
Considering the difference between two different approximate solutions starting from two different initial values, it follows from (12) that
By using the Itô formula, for any \(\lambda >0\),
Before estimating \(J_{i}\) (\(i=1,2,\ldots ,5\)), we note that
and
where the derivation process of (39) is similar to the one in (27), and \(C_{5}=\max \{(C_{1}+C_{2})(1+c)(E\|\xi \|^{2}+E\| \eta \|^{2}),12\lambda _{3}E\|\xi -\eta \|^{2},2C_{2},c(C_{1}+C_{2})(E \|\xi \|^{2}+E\|\eta \|^{2})\}\).
For two different given initial values ξ and η, it is easily seen that \(J_{1}\) is a constant. By Assumption 1,
and
From (39), we have
and
Then, substituting (40)–(43) into (38), we have
where \(\tilde{\lambda }=-\lambda _{1}+\lambda +\lambda _{3}+13\lambda _{3}\Delta ^{\frac{1}{6}}+(\lambda \kappa ^{2}+\lambda _{2}+\lambda _{3} \Delta ^{\frac{1}{6}}+4\kappa ^{2}+\lambda _{3})e^{\lambda \tau }\).
When Δ is sufficiently small such that \(\tilde{\lambda }<0\), using (37), we obtain
Then, from (44), (17), and (4), it yields
which implies
as required. □
Note that combining Lemma 3.3 and Lemma 3.4 with Theorem 3.2 can yield Theorem 3.1. In fact, \(\pi ^{\Delta }\) is the invariant measure of the Markov chain \((X_{k\Delta }, r_{k}^{ \Delta })\) when Δ is sufficiently small.
4 Convergence of the numerical invariant measures
The previous section shows that \(\{(X_{k\Delta }, r_{k}^{\Delta })\} _{k\ge 0}\) has a unique invariant measure sequence \(\pi ^{\Delta }( \cdot \times \cdot )\). In this section we will show that if the invariant measure sequence \(\pi ^{\Delta }(\cdot \times \cdot )\) converges weakly to a probability measure in \({\mathscr{P}}( \mathcal{C} \times \mathcal{S})\), then this probability measure is the invariant measure of the exact solution \(\pi (\cdot \times \cdot )\) of Eq. (1).
Let \(y(t)\) be the (exact) solution of Eq. (1), and let \(Y(t)=(y(t),r(t))\). Then \(Y(t)\) is a time homogeneous Markov process. If the process starts from \((\xi ,i)\in \mathcal{C}\times \mathcal{S}\), we denote the process by \(Y^{\xi ,i}(t)=(y^{\xi ,i}(t),r^{i}(t))\). Let \(P_{t}((\xi ,i),\cdot \times \cdot )\) be the probability measure induced by \(Y^{\xi ,i}(t)\), namely
Clearly, \(P_{t}((\xi ,i),\cdot \times \cdot )\) is also the transition probability measure of the Markov process \(Y(t)\). The process \(Y(t)\) is said to be stable in distribution if there exists \(\pi (\cdot \times \cdot ) \in {\mathscr{P}}(\mathcal{C}\times \mathcal{S})\) such that the probability measure \(P_{t}((\xi ,i), \cdot \times \cdot )\) converges weakly to \(\pi (\cdot \times \cdot )\) as \(t \to \infty \) for every \((\xi , i) \in \mathcal{C}\times \mathcal{S}\), that is,
It is easily seen that if \(Y(t)\) is stable in distribution, then \(\pi (\cdot \times \cdot )\) is the unique invariant measure of \(Y(t)\). Similar to the proof of [2, 19], we have the following.
Theorem 4.1
If Assumptions 1 and 2 hold, then the Markov process \(Y(t)\) is stable in distribution.
To reveal the important relationship between \(\pi ^{\Delta }\) and π, let us establish another lemma.
Lemma 4.2
Let Assumptions 1 and 2 hold and any fixed \((\xi , i)\in \mathcal{C} \times \mathcal{S}\). Then, for any given \(T>0\) and \(\chi >0\), there exists a sufficiently small scalar \(\Delta ^{*}>0\) such that
provided \(\Delta < \Delta ^{*}\) and \(k\Delta \le T\).
Proof
Let \(X^{(\xi , i), \Delta }(t)\) be the continuous EM approximate solution. Under Assumptions 1 and 2, in the Appendix, we can show that
Hence, there exists a sufficiently small scalar \(\Delta ^{*}>0\) such that
provided \(\Delta < \Delta ^{*}\) and \(k\Delta \le T\).
Therefore, for any \(f \in \mathbb{L}\),
The required assertion follows. □
We can now show that the numerical invariant measure sequence will weakly converge to the invariant measure of the exact solution.
Theorem 4.3
Under Assumptions 1 and 2, we have
Proof
Fix any \((\xi ,i) \in \mathcal{C}\times \mathcal{S}\), and let \(\chi >0\) be arbitrary. By Theorem 4.1, there exists \(T_{1}>0\) such that
By Theorem 3.2, there exists a pair of \(\Delta _{0}>0\) and \(T_{2}>0\) such that, for any \(\Delta <\Delta _{0}\) and \(k\Delta \ge T _{2}\),
Setting \(T=T_{1}\vee T_{2}\). By Lemma 4.2, there exists a constant \(\Delta ^{*} >0\) such that
provided \(\Delta < \Delta ^{*}\) and \(k\Delta \le T+1\). Now, for any \(\Delta <\Delta _{0} \wedge \Delta ^{*}\), letting \(k=[T/\Delta ]+1\) and using (50), (51), and (52), we derive
as required. □
Let us make a remark to close this section. Theorem 4.3 only gives the existence of invariant measure of the numerical solution to Eq. (1). The method to obtain the invariant measure has been provided. In addition, we can find from Theorem 4.3 that the numerical invariant measure sequence \(\pi ^{\Delta }\) will weakly converge to the invariant measure π of the exact solution. That is to say, this theorem gives us a numerical method to get the approximate invariant measure π for NSFDEwMSs (1).
5 Example
In this section, a numerical example is provided to illustrate the theoretical results established in the previous sections.
Example 5.1
Let \(w(t)\) be a scalar Brownian motion. Let \(r(t)\) be a right-continuous Markov chain taking values in \(\mathcal{S}=\{1,2\}\) with generator
where a, b are positive numbers such that \(\pi =(\frac{1}{2}, \frac{1}{2})\) is the stationary distribution of the Markov chain. Assume that \(w(t)\) and \(r(t)\) are independent. Consider a scalar neutral stochastic functional differential equation
where
and
It is easy to obtain that, when \(r(t)=1\),
and
Therefore, \(\lambda _{1}=0.2\), \(\lambda _{2}=0.1\), \(\lambda _{3}=0.01\), and \(\kappa =0.025\). Consequently,
Thus, for Eq. (53) when \(r(t)=1\), the conditions in Lemma 3.3 and Lemma 3.4 are fulfilled.
When \(r(t)=2\), similarly, we have
and
Therefore \(\lambda _{1}=0.4\), \(\lambda _{2}=0.22\), \(\lambda _{3}=0.04\), and \(\kappa =0.05\), which implies that
Thus, for Eq. (53) when \(r(t)=2\), the conditions in Lemma 3.3 and Lemma 3.4 are satisfied. By Theorem 3.2, there exists a sufficiently small \(\Delta \in (0,1)\) such that the EM approximate solution \((X_{k\Delta },r^{\Delta }_{k})\) is stable in distribution.
6 Conclusion
In this paper, the stability in distribution for the numerical solution of neutral stochastic functional differential equations with Markovian switching has been discussed by using the Euler–Maruyama method. The theoretical results obtained have been analyzed in detail and some sufficient conditions have been presented. Some existing results, for example [8, 21, 23,24,25,26,27,28], have been generalized. Meanwhile, the strong convergence for the theoretical solution and the numerical solution of such equations has been considered.
References
Anderson, W.J.: Continuous-Time Markov Chains. Springer, Berlin (1991)
Bao, J., Shao, J., Yuan, C.: Invariant measures for path-dependent random diffusions (2017). arXiv:1706.05638
Du, N.H., Dang, N.H., Dieu, N.T.: On stability in distribution of stochastic differential delay equations with Markovian switching. Syst. Control Lett. 65, 43–49 (2014)
Hu, G., Wang, K.: Stability in distribution of neutral stochastic functional differential equations with Markovian switching. J. Math. Anal. Appl. 385, 757–769 (2012)
Kolmanovskii, V., Koroleva, N., Maizenberg, T., Mao, X., Matasov, A.: Neutral stochastic differential delay equations with Markovian switching. Stoch. Anal. Appl. 21, 819–847 (2003)
Kolmanovskii, V.B., Nosov, V.R.: Stability of Functional Differential Equations. Academic Press, San Diego (1986)
Kuang, Y.: Delay Differential Equations with Applications in Population Dynamics. Academic Press, San Diego (1993)
Mao, W., Mao, X.: On the approximations of solutions to neutral SDEs with Markovian switching and jumps under non-Lipschitz conditions. Appl. Math. Comput. 230, 104–119 (2014)
Mao, X.: Exponential stability in mean square of neutral stochastic functional differential equations. Syst. Control Lett. 26, 245–251 (1995)
Mao, X.: Stochastic Differential Equations and Applications. Horwood, Chichester (1997)
Mao, X.: Stochastic functional differential equations with Markovian switching. Funct. Differ. Equ. 6, 375–396 (1999)
Mao, X.: Numerical solutions of stochastic functional differential equations. LMS J. Comput. Math. 6, 141–161 (2003)
Mao, X., Shen, Y., Yuan, C.: Almost surely asymptotic stability of neutral stochastic differential delay equations with Markovian switching. Stoch. Process. Appl. 34, 1385–1406 (2008)
Mao, X., Yuan, C.: Stochastic Differential Equations with Markovian Switching. Imperial College Press, London (2006)
Mazenc, F.: Stability analysis of time-varying neutral time-delay systems. IEEE Trans. Autom. Control 60, 540–546 (2015)
Mo, H., Li, M., Deng, F., Mao, X.: Exponential stability of the Euler–Maruyama method for neutral stochastic functional differential equations with jumps. Sci. China Inf. Sci. 61, 70214 (2018)
Mohammed, S.-E.A.: Stochastic Functional Differential Equations. Pitman, London (1984)
Ngoc, P.H.A.: Exponential stability of coupled linear delay time-varying differential difference equations. IEEE Trans. Autom. Control 63, 843–848 (2018)
Tan, L., Jin, W., Suo, Y.: Stability in distribution of neutral stochastic functional differential equations. Stat. Probab. Lett. 107, 27–36 (2015)
Teel, A.R., Subbaraman, A., Sferlazza, A.: Stability analysis for stochastic hybrid systems: a survey. Automatica 50, 2435–2456 (2014)
Wu, F., Mao, X.: Numerical solutions of neutral stochastic functional differential equations. SIAM J. Numer. Anal. 46, 1821–1841 (2008)
Yin, G., Zhu, C.: Hybrid Switching Diffusions: Properties and Applications. Springer, Berlin (2010)
Yu, Z.H.: Almost sure and mean square exponential stability of numerical solution for neutral stochastic functional differential equations. Int. J. Comput. Math. 92, 132–150 (2015)
Yuan, C., Mao, X.: Stability in distribution of numerical solutions for stochastic differential equations. Stoch. Anal. Appl. 22, 1133–1150 (2004)
Yuan, C., Zou, J., Mao, X.: Stability in distribution of stochastic differential delay equations with Markovian switching. Syst. Control Lett. 50, 195–207 (2003)
Zhou, S., Wu, F.: Convergence of numerical solutions to neutral stochastic delay differential equations with Markovian switching. Int. J. Comput. Appl. Math. 229, 85–96 (2009)
Zhou, S.B.: Exponential stability of numerical solution to neutral stochastic functional differential equation. Appl. Math. Comput. 266, 441–461 (2015)
Zong, X., Wu, F., Huang, C.: Exponential mean square stability of the θ approximations for neutral stochastic differential delay equations. Int. J. Comput. Appl. Math. 286, 172–185 (2015)
Acknowledgements
The authors sincerely thank the associate editor and the reviewers for their valuable suggestion and comments, which can greatly improve the quality of this work.
Availability of data and materials
Not applicable.
Authors’ information
Mrs. Yuru Hu is currently working towards her Master degree in the Department of Mathematics, School of Sciences, Nanchang University, China. Her interest field includes the numerical solution of stochastic differential equations. Dr Huabin Chen is an associate professor in the Department of Mathematics, School of Sciences, Nanchang University, China. His research fields are stochastic differential equations, stochastic systems and control, and hybrid systems. Dr Chenggui Yuan is a full professor in the Department of Mathematics, Swansea University, Swansea, UK. His research fields are stochastic differential equations, derivation principle, ergodicity and dynamical systems, etc.
Funding
This work is partially supported by the National Natural Science Foundation of China (61364005, 11401292, 61773401, 11561027, 11661039, 71371193), the Natural Science Foundation of Jiangxi Province of China (20161BAB211018, 20171BAB201007, 20171BCB23001), and the Foundation of Jiangxi Provincial Educations of China (GJJ150444, GJJ160061, GJJ14155).
Author information
Authors and Affiliations
Contributions
Mrs. YH is the first author of this paper who mainly wrote this paper. Dr HC has made some revisions. Professor CY has provided the idea of this writing and given some valuable suggestions on the revision. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
Theorem A.1
Under Assumptions 1 and 2, we have
Proof
We first note from Theorem 2.1 and Lemma 3.3 that there exists a positive constant H̄ such that
Let j be a sufficiently large integer, define the stopping times
where we set \(\inf \phi =\infty \) as usual. Letting \(e(t)=y(t)-X(t)\), it follows
By the Doob martingale inequality (see [10]), it yields that, for any \(t_{1}\leq T\),
For any \(s\in (0,t_{1}\wedge \rho _{j}]\), we derive
Let \(\bar{n}=[s/\Delta ]\), the integer part of \(s/\Delta \). Then
with \(t_{\bar{n}+1}\) being now set to be T.
Let \(I_{G}\) be the indicator function for set G. Moreover, in the remainder of the proof, C is a positive constant dependent on only s, \(\lambda _{3}\), ξ and \(\max_{1 \le i \le N}(-\gamma _{ii})\) but independent of Δ. In particular, it may change line by line. With these notations, we observe that
where in the last step we use the fact that \({\bar{X}}_{t_{k}}\) and \(I_{\{r(u) \neq r(t_{k})\}}\) are conditionally independent with respect to the σ-algebra generated by \(r(t_{k})\).
By (54) and Assumption 1, we have
where C denotes a positive constant independent of t, which may change from line to line.
Substituting (57) into (56) gives
On the other hand, by using the techniques developed in [12] and Assumption 1, we have
where \(\beta (\Delta )\) is dependent on Δ as defined in [12].
Therefore,
and the estimation about \(E\int _{0}^{s}|g(y_{u}, r(u))-g(\bar{X}_{u}, \bar{r}(u))|^{2}\,du\) can be similarly given. Here, the detailed process is omitted to save the space.
Then, by (10) and Assumption 1, we have
Substituting (59) and (60) into (55) yields
By the Gronwall inequality,
Letting \(j \rightarrow \infty \), we obtain
as required. □
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Hu, Y., Chen, H. & Yuan, C. Numerical solutions of neutral stochastic functional differential equations with Markovian switching. Adv Differ Equ 2019, 81 (2019). https://doi.org/10.1186/s13662-019-1957-z
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-019-1957-z
Keywords
- Euler–Maruyama method
- Stability in distribution
- Neutral stochastic functional differential equations
- Markov chain
- Strong convergence