Abstract and Applied Analysis

Volume 2014 (2014), Article ID 565812, 11 pages

http://dx.doi.org/10.1155/2014/565812

## Numerical Schemes for Stochastic Differential Equations with Variable and Distributed Delays: The Interpolation Approach

Systems Engineering Institute, South China University of Technology, Guangzhou 510640, China

Received 10 October 2013; Accepted 30 December 2013; Published 24 February 2014

Academic Editor: Patricia J. Y. Wong

Copyright © 2014 Xueyan Zhao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

A kind of the Euler-Maruyama schemes in discrete forms for stochastic differential equations with variable and distributed delays is proposed. The linear interpolation method is applied to deal with the values of the solutions at the delayed instants. The assumptions of this paper on the coefficients and related parameters are somehow weaker than those imposed by the related past literature. The error estimations for the Euler-Maruyama schemes are given, which are proved to be the same as those for the fundamental Euler-Maruyama schemes.

#### 1. Introduction

It is well known that most stochastic differential equations (SDEs) arising in many applications are nonlinear and cannot be solved explicitly, so the construction of efficient computational methods is of great importance. Hence, in the past decades, the numerical approximation schemes for SDEs have been widely investigated and a lot of fundamental results have been obtained [1–6]. Among the proposed methods, the Euler-Maruyama scheme is one of the most typical schemes. This method has been generalized to some complex SDEs, for example, SDEs with delays terms [7–14], the neutral terms [15], the impulsive terms [16], the terms with Markovian switching [17, 18], and the equations driven by Poisson’s processes [19–21]. Of course, the approximation schemes for SDEs have been generalized to the SDEs with variable delays and some classical results have been obtained [22–24].

For the case with variable delays, the main difficulty in the construction of the approximation schemes is how to estimate the values of the solutions at the delayed instants. To overcome this problem, [11, 22] proposed to use the approximate values at the nearest grid points on the left of the delayed arguments. That amounted to a simple interpolation of the undetermined approximate values of the solutions at nonmesh points by piecewise constant polynomials whose values are taken at the left endpoints of the intervals containing the delayed arguments. Of course, by this method, some variants of the Euler-Maruyama schemes for SDEs have been obtained [12, 13, 18, 19, 21, 24].

In this paper, we consider the time-varying stochastic models with both variable delays and distributed delays. To approximate the values of the solutions at the delayed times, we use an interpolation method. To find the approximate values of the involved integrals, we use the rectangular method or the trapezoidal method. It should be pointed out that our model is a kind of time-varying one, we impose no Hölder continuity for the initial data in this paper, and our schemes are in the discrete forms, which are practical in real applications.

#### 2. Preliminaries

In the paper, let be a complete probability space with a filtration satisfying the usual conditions; that is, it is right continuous and contains all -null sets. Let be an -dimensional Wiener process defined on the probability space . will be a positive constant which stands for the upper bound for the bounded delays involved in the equations, and . denotes the space of continuous functions from to with norm , where is any kind of norms for vectors. Let and be two instants with , . For a given function , the associated function is defined as , . Denote .

For the general theory of functional differential equations, the readers are referred to [25], and for the general theory of stochastic functional differential equations the readers are referred to [6].

Given an Itô SDE with variable and distributed delays where and the state , the solution is a stochastic process in , with the given initial data . and are continuous in their arguments, , , , . We have that , . Define .

The numerical scheme of (1) has not been investigated so far in the related literature; we will propose a kind of numerical schemes for (1), with fewer assumptions for its parameters, that is, the coefficients, the delays, and the initial data, except the ordinary basic assumptions.

Assume that the coefficients and satisfy the local Lipschitz condition and linear growth condition.Local Lipschitz condition: for arbitrary given positive number , there is a related constant such that for all and with , .Linear growth condition: there exists a positive constant such that for all and , .

The other parameters , , and satisfy the following Lipschitz conditions.For , there exists a constant such that There exists a constant such that for , , with .

*Remark 1. *In fact, if and are such that and are bounded, the local Lipschitz condition implies the linear growth condition , where

It is known that [6], under assumptions and , there exists a unique continuous solution on to (1) for each initial datum , which is denoted by in this paper, satisfying for arbitrary constant .

#### 3. The Variant Euler-Maruyama Approximation for SDEs with Variable and Distributed Delays

Without loss of generality, let be the step size with . Let us take a partition for the existing interval of the solution as where and is the floor function. In this paper, we take the partition as .

For the interval , by (1) we have where

For variable delay, the points may not hit a previous time step. In consequence, there is no previously calculated approximate value of the solution available. To overcome this problem, we propose to take the linear interpolation of values of the function involved at the two endpoints of an interval as the approximate value of the function at a point of the interval.

With the above analytic derivation, denote

Our variant Euler-Maruyama scheme for (1) with step size is where are determined by the linear interpolation for function approximation as the approximate values of , respectively, and and are determined by the trapezoidal method or by the rectangular method as given in Remark 4, for numerical integrals as the approximate values of the integrals and , respectively.

*Remark 2. *In real applications, one may take simply, where is an integer.

*Remark 3. *With the above notations, we have the following facts:(1) is the approximation of ;(2), , and ;(3)for or , we have and , respectively;(4), , , and are well defined because or due to ;(5).

*Remark 4. *If we approximate the involved integrals by the rectangular method, then
where and are the same as those defined in (13).

#### 4. Mean Square Estimation for Truncation Errors of the Euler-Maruyama Schemes

In this section, we analyze the local and global truncation errors of the Euler-Maruyama schemes. For the sake of clarity, we take the case that the integrals and are approximated by the trapezoidal method. We describe the truncation errors in mean square and analyze the errors directly by the discrete schemes themselves.

##### 4.1. Notations for Error Estimations

The notations proposed here will stand for errors, parameters, and coefficients, respectively, and the coefficients will be used to express the error estimations and the parameters will be used to express the coefficients.

Firstly, as mentioned above, we have an estimation

Define , and for the case similarly to the cases for . By the given initial data and the linear interpolation method, we know that , , and , , and , for .

Define an upper bound sequence by the iteration

It is obvious that , where , and the sequence is increasing, .

Denote .

Based on these, we also have the following sets of notations.

Truncation errors of the schemes: consider for . Obviously, corresponds to the analytic truncation error .

By the way, at the end of this paper, we will give an estimation for the local truncation error of the schemes, which will be denoted by , for the case that the integrals involving distributed delays are approximately computed by the trapezoidal method.

Parameters: consider

##### 4.2. Lemmas

To obtain mean square estimation for global truncation errors and local truncation errors of the Euler-Maruyama schemes, we need the following lemma.

Lemma 5. *For the schemes (11)–(14), one has the following estimation:
*

*Proof. *We prove the conclusion by induction. By the above analysis, the conclusion is true for .

Assume that the conclusion is true for some .

By the computation scheme and the Markov property of the solutions of the Itô stochastic differential equations, we have

By the computation scheme, one can easily show that, if for , then we have , , and . Based on these, we have
and then

By induction, the conclusion of the theorem is true: that is, we have the estimation for .

*Remark 6. *Of course, at the same time, we have the following estimation:

*Remark 7. *By , for , , we have

*4.3. Mean Square Estimation for Global Truncation Errors*

*Now we can state mean square estimation for global truncation errors of the Euler-Maruyama schemes and the order of the Euler-Maruyama schemes.*

*Theorem 8. If the step size is taken such that , then one has global truncation error estimation or say , ; that is, the order of the scheme is .*

*Proof. *The proof of the theorem is a little more difficult than those reported in the related past literature for error analysis, due to the appearance of the argument in coefficients and , as well as the error of the schemes for numerical computations of the involved integrals and . We prove the conclusion of the theorem by induction.

Firstly, for , we have ; that is, the conclusion of the theorem is true for .

Secondly, for the terms , , , and , we have, respectively,
due to .

Denote

By the definition of , we have

By computations, we have
and similarly

Inserting (29) and (30) into (28), then we have

By the above notations and the given Lipschitz condition, we have

Let , ; we have
and thus we have
due to ; by (34) then it follows that

At the same time, by the computation method for and , that is, the trapezoidal method, we have decomposition
where

For , we have

By the given equation, for and , we have
and then we have
due to . Similarly we have

Inserting (40) and (41) into (38), we have
and similarly we have

For the same reasons, we have
Consequently we have
In fact, since , as mentioned above, we have

With the above estimations, for every , we have a common estimation
Similarly we have
and then we obtain
where

By iterating and observing that , we have

The proof is complete.

*Remark 9. *Besides, by the above derivation, we also have estimations for and in another form: