Research Article | Open Access

# Implicit Numerical Solutions for Solving Stochastic Differential Equations with Jumps

**Academic Editor:**Maoan Han

#### Abstract

To realize the applications of stochastic differential equations with jumps, much attention has recently been paid to the construction of efficient numerical solutions of the equations. Considering the fact that the use of the explicit methods often results in instability and inaccurate approximations in solving stochastic differential equations, we propose two implicit methods, the *Î¸*-Taylor method and the balanced *Î¸*-Taylor method, for numerically solving the stochastic differential equation with jumps and prove that the numerical solutions are convergent with strong order 1.0. For a linear scalar test equation, the mean-square stability regions of the methods are derived. Finally, numerical examples are given to evaluate the performance of the methods.

#### 1. Introduction

Stochastic differential equations (SDEs) have been one of the most important mathematical tools for dealing with many problems in a variety of practical areas. However, SDEs are in general so complex that the analytical solutions can rarely be obtained. Thus, it is a common way to numerically solve SDEs. Since the explicit numerical methods often result in instability and inaccurate approximations to the solutions unless the step-size is very small, it is often necessary to use some implicit methods in numerically solving SDEs.

Generally speaking, there are two kinds of implicit numerical methods. One is the semi-implicit methods in which the drift components are computed implicitly while the diffusion components are computed explicitly. Higham [1, 2] studied the stochastic -method for SDEs and SDEs with jumps (SDEJs). When , the stochastic -method is the backward Euler method. The backward Euler method is discussed in [3â€“5] and the references therein. Hu and Gan [6] proposed a class of drift-implicit one-step methods for neutral stochastic delay differential equations with jump diffusion. Higham and Kloeden [3, 7] constructed the split-step backward Euler method and the compensated split-step backward Euler method for SDEJs. Ding et al. [8] introduced the split-step -method which is more general than the split-step backward Euler method. Wang and Gan [9] studied split-step one-leg methods for SDEs. Buckwar and Sickenberger [10] compared the mean-square stability properties of the -Maruyama and -Milstein methods for SDEs.

The other is the fully implicit methods in which both the drift components and the diffusion components are computed implicitly. Since implicit stochastic terms in the implicit methods lead to infinite absolute moments of the numerical solution, extensive research has been done to address this issue [11â€“26]. For example, Milstein et al. [11] proposed the balanced implicit method for the numerical solutions of SDEs. Burrage and Tian [12] suggested three implicit Taylor methods: the implicit Euler-Taylor method with strong order 0.5, the implicit Milstein-Taylor method with strong order 1.0, and the implicit Taylor method with strong order 1.5. Kahl and Schurz [16] introduced the balanced Milstein method for ordinary SDEs. Wang and Liu [20, 21] proposed the semi-implicit Milstein method and the split-step backward balanced Milstein method for stiff stochastic systems. Furthermore, Haghighi and Hosseini [23] developed a class of general split-step balanced numerical methods for SDEs.

Let be a complete probability space with the filtration satisfying the usual conditions that is right-continuous and contains all -null sets. In this paper, we consider the stochastic differential equations with jumps of the form where is -adapted Wiener process and is a scalar poisson process with intensity and is independent of . Hu and Gan [22, 25] proposed the balanced method for SDEJs (1) and stochastic pantograph equations with jumps, respectively, and proved that the numerical solution converges to the analytical solution with rate . The asymptotic stability of the balanced method for SDEJs (1) was obtained in [26]. To obtain higher order numerical schemes and improve the accuracy of the numerical solutions, we propose two kinds of implicit Taylor methods and prove that the numerical solutions converge to the true solutions of SDEJs (1) with rate .

The rest of the paper is arranged as follows. In Section 2, we introduce the -Taylor methods and the fully implicit balanced -Taylor methods for SDEJs (1). The strong convergence properties of these implicit methods are proved in Section 3. The mean-square stability of the numerical solutions is discussed in Section 4. Some numerical experiments are performed in Section 5 to evaluate the performance of the proposed numerical methods.

#### 2. The Numerical Methods

Define a mesh on the time interval with and the step-size . is the numerical approximation to . Based on appropriate stochastic Taylor expansions, Maghsoodi [27] generalized the Milstein scheme to SDEJs and obtained the order strong Taylor scheme (Taylor for short) as where , , and .

Note that [28]. Given a jump time in , (). In addition, the random variable is dependent on , and its sample values can be calculated by where .

By changing the explicit deterministic term into implicit term, we have the following -Taylor method: Note that the -Taylor method (3) becomes the Taylor method (2) when .

Using the idea of the balanced implicit method and combining it with the -Taylor method, we have the following balanced -Taylor method: where with and called control functions.

#### 3. Convergence of the Implicit Taylor Methods

Let be the Euclidean norm in . If is a matrix, . Denote for . To prove the convergence of the numerical solutions, we make the following assumptions.

*Assumption 1. *The coefficient functions , , and satisfy the global Lipschitz condition
for a positive constant and any and the linear growth condition
for a positive constant and any .

*Assumption 2. *The and are bounded -matrix-valued functions. For any real numbers and with and for all step-size and , the matrix is reversible and satisfies , where is a unit matrix and is a positive constant.

In what follows, we will derive the strong convergence orders of the implicit Taylor methods for SDEJs (1).

##### 3.1. Convergence of the -Taylor Method

Define by replacing the numerical approximations with the exact solution values on the right-hand side of equation (3). Then, the local error of method (3) is defined by and the global error of method (3) is defined by .

Theorem 3. *Under Assumption 1, the -Taylor method (3) is consistent with order 2 in the mean and with order 1.5 in the mean square. That is, the local mean error and mean-square error of the -Taylor method (3) satisfy
**
where the constants and are independent of .*

* Proof. *To obtain the convergence rate of the -Taylor method, we firstly introduce the local Taylor numerical approximation which is defined by
Then, there exists some constant such that
Since
we obtain .

On the other hand, since
we have
Therefore, the result (9) is obtained.

Theorem 4. *Under Assumption 1, the -Taylor method (3) is convergent with order 1 in the mean square. That is, the global error satisfies
**
where is independent of .*

* Proof. *From the definitions of and , we have
where
Since is -measurable, we have from Theorem 3 that
where indicates the scalar product.

Noting that , , , , and is independent of , we have from Assumption 1 that
Hence,
where .

Noting that and are -measurable and and are independent of , we have
Therefore,
where . Thus,
From the above arguments, we obtain
Because , we can assume without loss of generality. Let . Then,
where .

##### 3.2. Convergence of the Balanced -Taylor Method

Define by replacing the numerical approximations with the exact solution values on the right-hand side of (4). Then, the local error of method (4) is and the global error of method (4) is .

Theorem 5. *Under Assumptions 1 and 2, the balanced -Taylor method (4) is consistent with order 2 in the mean and with order 1.5 in the mean square. That is, the local mean error and mean-square error of the balanced -Taylor method (4) satisfy
**
where the constants and are independent of .*

* Proof . *From Theorem 3, we have
From the definitions of and in (7) and (26), we can write
Since the components of the matrices and in are bounded, there exists a positive constant such that . Under Assumptions 1 and 2, we have
Therefore,
On the other hand, since
we have

Theorem 6. *Under Assumptions 1 and 2, the balanced -Taylor method (4) is convergent with order 1 in the mean square. That is, the global error satisfies
**
where is independent of .*

* Proof. *From the definitions of and , we have
where
Thus, there exists a constant such that
and there exists a constant such that
Thus,
From Theorem 5, we have
Therefore,
where . Because , we can assume without loss of generality. Let . Then,
where .

#### 4. Stability of the Implicit Taylor Methods

In this section, we will discuss the stability properties of the numerical methods introduced in Section 2. Consider a scalar linear test equation, where , , and are real constants. The solution of (43) is and is mean-square (MS) stable if [2].

The one-step scheme of the test equation (43) is The numerical method is MS-stable if where is called the MS-stability function of the numerical method.

If the Taylor method (2) is applied to the test equation (43), we obtain where Let , , and . Then the MS-stability function of the Taylor method is Thus, the strong Taylor method (2) for the linear test equation (43) is MS-stable if .

Applying the -Taylor method (3) to the test equation (43), we obtain where