Stationary in Distributions of Numerical Solutions for Stochastic Partial Differential Equations with Markovian Switching
Abstract
We investigate a class of stochastic partial differential equations with Markovian switching. By using the Euler-Maruyama scheme both in time and in space of mild solutions, we derive sufficient conditions for the existence and uniqueness of the stationary distributions of numerical solutions. Finally, one example is given to illustrate the theory.
1. Introduction
The theory of numerical solutions of stochastic partial differential equations (SPDEs) has been well developed by many authors [1–5]. In [2], Debussche considered the error of the Euler scheme for the nonlinear stochastic partial differential equations by using Malliavin calculus. Gyöngy and Millet [3] discussed the convergence rate of space time approximations for stochastic evolution equations. Shardlow [5] investigated the numerical methods of the mild solutions for stochastic parabolic PDEs derived by space-time white noise by applying finite difference approach.
Since only a few SPDEs with Markovian switching have explicit formulae, numerical (approximate) schemes of SPDEs with Markovian switching are becoming more and more popular. In this paper, we will study the stationary distribution of numerical solutions of SPDEs with Markovian switching. Bao et al. [10] investigated the stability in distribution of mild solutions to SPDEs. Bao and Yuan [11] discussed the numerical approximation of stationary distribution for SPDEs. For the stationary distribution of numerical solutions of stochastic differential equations in finite-dimensional space, Mao et al. [12] utilized the Euler-Maruyama scheme with variable step size to obtain the stationary distribution and they also proved that the probability measures induced by the numerical solutions converge weakly to the stationary distribution of the true solution. But since the mild solutions of SPDEs with Markovian switching do not have stochastic differential, a significant consequence of this fact is that the Itô formula cannot be used for mild solutions of SPDEs with Markovian switching directly. Consequently, we generalize the stationary distribution of numerical solutions of the finite dimensional stochastic differential equations with Markovian switching to that of infinite dimensional cases.
Motived by [11–13], we will show in this paper that the mild solutions of SPDE with Markovian switching (1) have a unique stationary distribution for sufficiently small step size. So this paper is organised as follows: in Section 2, we give necessary notations and define Euler-Maruyama scheme of mild solutions. In Section 3, we give some lemmas and the main result in this paper. Finally, we will give an example to illustrate the theory in Section 4.
2. Statements of Problem
- (A1)
(A, 𝒟(A)) is a self-adjoint operator on H generating a C0-semigroup {eAt} t≥0, such that ∥eAt∥≤e−αt for some α > 0. In this case, −A has discrete spectrum 0 < ρ1 ≤ ρ2 ≤ ⋯≤lim i→∞ ρi = ∞ with corresponding eigenbasis {ei} i≥1 of H.
- (A2)
Both f and g are globally Lipschitz continuous. That is, there exists a constant L > 0 such that
() - (A3)
There exist μ > 0 and λj > 0, (j = 1,2, …, N) such that
()
Remark 1. We observe that (A2) implies the following linear growth conditions:
Remark 2. We also establish another property from (A3):
Remark 3. It is known that the weak convergence of probability measures is a metric concept with respect to classes of test function. In other words, a sequence of probability measures {Pk} k≥1 of 𝒫(H × 𝕊) converges weakly to a probability measure P0 ∈ 𝒫(H × 𝕊) if and only if lim k→∞ d𝕃(Pk, P0) = 0.
Definition 4. The mild solution Z(t) = (X(t), r(t)) of (4) is said to have a stationary distribution π(·×·) ∈ 𝒫(H × 𝕊) if the probability measure ℙt((x, i), (·×·)) converges weakly to π(·×·) as t → ∞ for every i ∈ 𝕊, and every x ∈ U, a bounded subset of H, that is,
By Theorem 3.1 in [10] and Theorem 3.1 in [14], we have the following.
Theorem 5. Under (A1)–(A3), the Markov process Z(t) has a unique stationary distribution π(·×·) ∈ 𝒫(H × 𝕊).
We now introduce an Euler-Maruyama based computational method. The method makes use of the following lemma (see [15]).
Lemma 6. Given Δ > 0, then {r(kΔ), k = 0,1, 2, …} is a discrete Markov chain with the one-step transition probability matrix
Given a fixed step size Δ > 0 and the one-step transition probability matrix P(Δ) in (16), the discrete Markov chain {r(kΔ), k = 0,1, 2, …} can be simulated as follows: let r(0) = i0, and compute a pseudorandom number ξ1 from the uniform (0,1) distribution.
Lemma 7. is a homogeneous Markov process with the transition probability kernel ℙn,Δ((x, i), A × {j}).
To highlight the initial value, we will use notation .
Definition 8. For a given stepsize Δ > 0, is said to have a stationary distribution {πn,Δ(·×·)} ∈ 𝒫(Hn × 𝕊) if the k-step transition probability kernel converges weakly to πn,Δ(·×·) as k → ∞, for every (x, i) ∈ Hn × 𝕊, that is,
We will establish our result of this paper in Section 3.
Theorem 9. Under (A1)–(A3), for a given stepsize Δ > 0, and arbitrary x ∈ Hn, i ∈ 𝕊, has a unique stationary distribution πn,Δ(·×·) ∈ 𝒫(Hn × 𝕊).
3. Stationary in Distribution of Numerical Solutions
In this section, we shall present some useful lemmas and prove Theorem 9. In what follows, C > 0 is a generic constant whose values may change from line to line.
For any initial value (x, i), let Yn,x,i(t) be the continuous Euler-Maruyama solution of (20) and starting from (x, i) ∈ H × 𝕊. Let Xx,i(t) be the mild solution of (4) and starting from (x, i) ∈ H × 𝕊.
Lemma 10. Under (A1)–(A3), then
Proof. Write Yn,x,i(t) = Yn(t), Yn,x,i(⌊t⌋) = Yn(⌊t⌋). From (20), we have
Lemma 11. Under (A1)–(A3), if , then there is a constant C > 0 that depends on the initial value x but is independent of Δ, such that the continuous Euler-Maruyama solution of (20) has
Proof. Write Yn,x,i(t) = Yn(t), ri(kΔ) = r(kΔ). From (20), we have the following differential form:
Let . By the generalised Itô formula, for any θ > 0, we derive from (30) that
Lemma 12. Let (A1)–(A3) hold. If , then
Proof. Write Yn,x,i(t) = Yx(t), Yn,y,i(t) = Yy(t), ri(kΔ) = r(kΔ). From (20), it is easy to show that
We can now easily prove our main result.
4. Corollary and Example
- (A4)
For each j ∈ 𝕊, there exists a pair of constants βj and δj such that, for x, y ∈ H,
() -
Moreover, 𝒜 : = − diag (2β1 + δ1, …, 2βN + δN) − Γ is a nonsingular M-matrix [8].
Corollary 13. Under (A1), (A2), and (A4), for a given stepsize Δ > 0, and arbitrary x ∈ Hn, i ∈ 𝕊, has a unique stationary distribution πn,Δ(·×·) ∈ 𝒫(Hn × 𝕊).
Proof. In fact, we only need to prove that (A3) holds. By (A4), there exists (λ1, λ2, …, λN) T > 0, such that (q1, q2, …, qN) T = 𝒜(λ1, λ2, …, λN) T > 0.
Set μ = min 1≤j≤N qj, by (66), we have
In the following, we give an example to illustrate the Corollary 13.
Example 14. Consider
We take H = L2(0, π) and A = ∂2/∂ξ2 with domain , then A is a self-adjoint negative operator. For the eigenbasis ek(ξ) = (2/π) 1/2sin(kξ), ξ ∈ [0, π], Aek = −k2ek, k ∈ ℕ. It is easy to show that
Let W(t) be a scalar Brownian motion, let r(t) be a continuous-time Markov chain values in 𝕊 = 1,2, with the generator
Moreover, g satisfies
Defining f(x, j) = B(j)x, then
It is easy to see that 𝒜 is a nonsingular M-matrix. Thus, (A4) holds. By Corollary 13, we can conclude that (68) has a unique stationary distribution πn,Δ(·×·).
Acknowledgment
This work is partially supported by the National Natural Science Foundation of China under Grants 61134012 and 11271146.