The Truncated Euler-Maruyama Method for Stochastic Differential Delay Equations
Qian Guo, Xuerong Mao, Rongxian Yue

TL;DR
This paper investigates the strong convergence of a truncated Euler-Maruyama numerical method for stochastic differential delay equations under generalized Khasminskii-type conditions, extending previous probabilistic convergence results.
Contribution
It establishes the strong (L^p) convergence of the truncated EM method for SDDEs under broader conditions, filling a gap in existing numerical analysis.
Findings
Proves strong convergence in L^p norm.
Extends convergence results to generalized Khasminskii conditions.
Provides theoretical foundation for numerical solutions of SDDEs.
Abstract
The numerical solutions of stochastic differential delay equations (SDDEs) under the generalized Khasminskii-type condition were discussed by Mao [15], and the theory there showed that the Euler-Maruyama (EM) numerical solutions converge to the true solutions in probability. However, there is so far no result on the strong convergence (namely in L^p) of the numerical solutions for the SDDEs under this generalized condition. In this paper, we will use the truncated EM method developed by Mao [16] to study the strong convergence of the numerical solutions for the SDDEs under the generalized Khasminskii-type condition.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
The Truncated Euler–Maruyama Method for Stochastic Differential
Delay Equations
Qian Guo1, Xuerong Mao2, Rongxian Yue1
1 Department of Mathematics,
Shanghai Normal University, Shanghai, China.
2 Department of Mathematics and Statistics,
University of Strathclyde, Glasgow G1 1XH, U.K Corresponding author. E-mail: [email protected].
Abstract
The numerical solutions of stochastic differential delay equations (SDDEs) under the generalized Khasminskii-type condition were discussed by Mao [15], and the theory there showed that the Euler–Maruyama (EM) numerical solutions converge to the true solutions in probability. However, there is so far no result on the strong convergence (namely in ) of the numerical solutions for the SDDEs under this generalized condition. In this paper, we will use the truncated EM method developed by Mao [16] to study the strong convergence of the numerical solutions for the SDDEs under the generalized Khasminskii-type condition.
**Key words: ** Brownian motion, stochastic differential delay equation, Itô’s formula, truncated Euler–Maruyama, Khasminskii-type condition.
Mathematical Subject Classifications (2000): 60H10, 60J65.
1 Introduction
In the study of stochastic differential delay equations (SDDEs), the classical existence-and-uniqueness theorem requires the coefficients of the SDDEs satisfy the local Lipschitz condition and the linear growth condition (see, e.g., [4, 8, 11, 12, 21]). However, there are many SDDEs which do not satisfy the linear growth condition. In 2002, Mao [14] generalized the the well-known Khasminskii test [6] from stochastic differential equations (SDEs) to SDDEs. The Khasminskii-type theorem established in [14] for SDDEs gives the conditions, in terms of Lyapunov functions, under which the solutions to SDDEs will not explode to infinity at a finite time. The Khasminskii-type theorem enables us to verify if a given nonlinear SDDE has a unique global solution under the local Lipschitz condition but without the linear growth condition. In 2005, Mao and Rassias [17] demonstrated that there are many important SDDEs which are not covered by the Khasminskii-type theorem given in [14], and established a generalized Khasminskii-type theorem which covers a very wide class of nonlinear SDDEs.
On the other hand, there are in general no explicit solutions to nonlinear SDDEs, whence numerical solutions are required in practice. The numerical solutions under the linear growth condition plus the local Lipschitz condition have been discussed intensively by many authors (see, e.g., [3, 7, 10, 13, 18, 19]). The numerical solutions of SDDEs under the generalized Khasminskii-type condition were discussed by Mao [15], and the theory there showed that the Euler–Maruyama (EM) numerical solutions converge to the true solutions in probability. However, there is so far no result on the strong convergence (namely in ) of the numerical solutions for the SDDEs under the generalized Khasminskii-type condition.
Recently, Mao [16] develops a new explicit numerical method, called the truncated EM method, for SDEs under the Khasminskii-type condition plus the local Lipschitz condition and establishes the strong convergence theory. In this paper, we will use this new truncated EM method to study the strong convergence of the numerical solutions for the SDDEs under the generalized Khasminskii-type condition.
This paper is organized as follows: We will introduce necessary notion, state the generalized Khasminskii-type condition and define the truncated EM numerical solutions for SDDEs in Section 2. We will establish the strong convergence theory for the truncated EM numerical solutions in Sections 3 and 4 and discuss the convergence rates in Section 5. In each of these three sections we will illustrate our theory by examples. We will see from these examples that the truncated EM numerical method can be applied to approximate the solutions of many highly nonlinear SDDEs. We will finally conclude our paper in Section 6.
2 The Truncated Euler-Maruyama Method
Throughout this paper, unless otherwise specified, we use the following notation. Let be the Euclidean norm in . If is a vector or matrix, its transpose is denoted by . If is a matrix, its trace norm is denoted by . Let and . Denote by the family of continuous functions from to with the norm . Let be a complete probability space with a filtration satisfying the usual conditions (i.e., it is increasing and right continuous while contains all -null sets). Let be an -dimensional Brownian motion defined on the probability space. Moreover, for two real numbers and , we use and . If is a set, its indicator function is denoted by , namely if and [math] otherwise. If is a real number, we denote by the largest integer which is less or equal to , e.g., and .
Consider a nonlinear SDDE
[TABLE]
with the initial data given by
[TABLE]
Here
[TABLE]
We assume that the coefficients and obey the Local Lipschitz condition:
Assumption 2.1
For every positive number there is a positive constant such that
[TABLE]
for those with .
The classical existence-and-uniqueness theorem does not only require this local Lipschitz condition but also the linear growth condition (see, e.g., [11, 12, 13, 21]). In this paper we shall retain the local Lipschitz condition but replace the linear growth condition by a generalized Khasminskii-type condition.
Assumption 2.2
There are constants , and such that
[TABLE]
for all .
To have a feeling about what type of nonlinear SDDEs to which our theory may apply, please consider, for example, the scalar SDDE
[TABLE]
where and (see Example 3.7 for the details). The following result, established in [17], is a generalized Khasminskii-type theorem on the existence and uniqueness of the solution to the SDDE.
Lemma 2.3
Let Assumptions 2.1 and 2.2 hold. Then for any given initial data (2.2), there is a unique global solution to equation (2.1) on . Moreover, the solution has the property that
[TABLE]
It has been shown (see, e.g., [15]) that under Assumptions 2.1 and 2.2, the EM numerical solutions converge to the true solution in probability. But, to our best knowledge, there is so far no result on the strong convergence under these assumptions. In this paper, we will use the truncated EM method developed in [16] and show that the truncated EM solutions will converge to the true solution in for some .
To define the truncated EM numerical solutions, we first choose a strictly increasing continuous function such that as and
[TABLE]
Denote by the inverse function of and we see that is a strictly increasing continuous function from to . We also choose a constant and a strictly decreasing function such that
[TABLE]
For example, we may choose sufficiently small such that and define for . For a given step size , let us define a mapping from to the closed ball by
[TABLE]
where we set when . That is, will map to itself when and to when . We then define the truncated functions
[TABLE]
for . It is easy to see that
[TABLE]
That is, both truncated functions and are bounded although and may not. More usefully, these truncated functions preserve the generalized Khasminskii-type condition to a very nice degree as described in the following lemma.
Lemma 2.4
Let Assumption 2.2 hold. Then, for every , we have
[TABLE]
for all .
Proof. Fix any . Recalling that , we see that . But is decreasing while is increasing, so .
For with and any , we have, by (2.3),
[TABLE]
which implies the desired assertion (2.9). On the other hand, for with and any , we have
[TABLE]
where (2.3) has been used. But once again we see from (2.3) that
[TABLE]
Substituting this into (2.11) yields
[TABLE]
Namely, we have showed that the required assertion (2.9) also holds for with and any . The proof is hence complete.
From now on, we will let the step size be a fraction of . That is, we will use for some positive integer . When we use the terms of a sufficiently small , we mean that we choose sufficiently large.
Let us now form the discrete-time truncated EM solutions. Define for . Set for and then form
[TABLE]
for , where . In our analysis, it is more convenient to work on the continuous-time approximations. There are two continuous-time versions. One is the continuous-time step process on defined by
[TABLE]
The other one is the continuous-time continuous process on defined by for while for
[TABLE]
We see that is an Itô process on with its Itô differential
[TABLE]
It is useful to know that for every , namely they coincide at . Of course, is computable but is not in general. However, the following lemma shows that and are close to each other in the sense of . This indicates that it is sufficient to use in practice. On the other hand, in our analysis, it is more convenient to work on both of them.
Lemma 2.5
For any and any , we have
[TABLE]
where is a positive constant dependent only on . Consequently
[TABLE]
Proof. In what follows, we will use to stand for generic positive real constants dependent only on and its values may change between occurrences. Fix arbitrarily. For any , there is a unique integer such that . By (2.8) and the properties of the Itô integral (see, e.g., [13]), we then derive from (2.16) that
[TABLE]
which is (2.17). Noting from (2.6) that , we obtain (2.18) from (2.17) immediately.
3 Convergence in for
From now on we will fix arbitrarily. In this section we will show that
[TABLE]
for every . By (2.8), it is obvious that for every ,
[TABLE]
The following lemma gives an upper bound, independent of , for the second moment.
Lemma 3.1
Let Assumptions 2.1 and 2.2 hold. Then
[TABLE]
where, and from now on, stands for generic positive real constants dependent on (and , etc. as well in the next sections) but independent of and its values may change between occurrences.
Proof. Fix and the initial data arbitrarily. By the Itô formula, we derive from (2.16) that for ,
[TABLE]
By Lemma 2.4, we get
[TABLE]
However, it is easy to show that
[TABLE]
Moreover,
[TABLE]
Furthermore, by Lemma 2.5 with and inequalities (2.8) and (2.6), we derive that
[TABLE]
Substituting (3)-(3.5) into (3.2) yields
[TABLE]
As this holds for any while the sum of the right-hand-side (RHS) terms is non-decreasing in , we then see
[TABLE]
The well-known Gronwall inequality yields that
[TABLE]
As this holds for any while is independent of , we obtain the required assertion (3.1).
Let us present two more lemmas before we state one of our main results in this paper.
Lemma 3.2
Let Assumptions 2.1 and 2.2 hold. For any real number , define the stopping time
[TABLE]
where throughout this paper we set (and as usual denotes the empty set). Then
[TABLE]
(Recall that stands for generic positive real constants dependent on so here is independent of .)
Proof. By the Itô formula and Assumption 2.2, we derive that for ,
[TABLE]
But the sum of the RHS terms is non-decreasing in , we hence have
[TABLE]
The Gronwall inequality shows
[TABLE]
In particular, we have
[TABLE]
This implies, by the Chebyshev inequality,
[TABLE]
and the assertion follows.
Lemma 3.3
Let Assumptions 2.1 and 2.2 hold. For any real number and , define the stopping time
[TABLE]
Then
[TABLE]
(Please recall that is independent of and .)
Proof. We simply write . In the same way as (3.2) was obtained, we can show that for ,
[TABLE]
In the same way as we performed in the proofs of Lemmas 3.1 and 3.2, we can then show that
[TABLE]
This, together with (3.5), implies
[TABLE]
Noting that the sum of the RHS terms is increasing in while
[TABLE]
we get
[TABLE]
The Gronwall inequality shows
[TABLE]
This implies the required assertion (3.7) easily.
For the numerical solutions to converge to the true solution in , we need to assume that the initial data are Hölder continuous with exponent (or -Hölder continuous). This is a standard condition which is also needed for the classical EM method under the global Lipschitz condition (see, e.g., [18, 19, 22]).
Assumption 3.4
There is a pair of constants and such that the initial data satisfies
[TABLE]
We can now show one of our main results in this paper.
Theorem 3.5
Let Assumptions 2.1, 2.2 and 3.4 hold. Then, for any ,
[TABLE]
Proof. Let and be the same as before. Set
[TABLE]
Obviously
[TABLE]
Let be arbitrary. Using the Young inequality
[TABLE]
we have
[TABLE]
By Lemmas 2.3 and 3.1, we have
[TABLE]
[TABLE]
We hence have
[TABLE]
Substituting this into (3.11) yields
[TABLE]
Now, let be arbitrary. Choose sufficiently small for and then choose sufficiently large for
[TABLE]
We then see from (3.12) that for this particularly chosen ,
[TABLE]
If we can show that for all sufficiently small ,
[TABLE]
we have
[TABLE]
and then by Lemma 2.5, we also have
[TABLE]
In other words, to complete our proof, all we need is to show (3.14). For this purpose, we define the truncated functions
[TABLE]
for . Without loss of any generality, we may assume that is already sufficiently small for . Hence, for all , we have that
[TABLE]
for those with . Consider the SDDE
[TABLE]
on with the initial data on . By Assumption 2.1, we see that both and are globally Lipschitz continuous with the Lipschitz constant . So the SDDE (3.15) has a unique global solution on . It is straightforward to see that
[TABLE]
On the other hand, for each step size , we can apply the (classical) EM method to the SDDE (3.15) and we denote by the continuous-time continuous EM solution. It is again straightforward to see that
[TABLE]
However, it is well known (see, e.g., [18, 19]) that
[TABLE]
where is a positive constant dependent on but independent of . Consequently,
[TABLE]
Using (3.16) and (3.17), we then have
[TABLE]
which implies
[TABLE]
Finally
[TABLE]
This implies (3.14) as desired. The proof is therefore complete.
Let make a useful remark which will be used in next sections before we discuss an example to illustrate our theory.
Remark 3.6
It is known (see, e.g., [18, 19]) that (3.18) holds for any . We hence see from the proof above that both (3.19) and (3) hold for any too.
Example 3.7
Consider the scalar SDDE
[TABLE]
with the initial data , where is a scalar Brownian motion and () are all positive numbers with
[TABLE]
This is a stochastic delay population system (see, e.g., [1, 2, 20]). It can be shown that given the initial data , the solution will remain positive for all with probability 1. We can therefore regard equation (3.21) as an SDDE in with the coefficients
[TABLE]
It is obvious that these coefficients are locally Lipschitz continuous, namely, they satisfy Assumption 2.1. We also assume that the initial data satisfy Assumption 3.4. Moreover, we set , which is positive by (3.22), and derive
[TABLE]
That is, Assumption 2.2 is satisfied as well. We can therefore apply the truncated EM method to obtain the numerical solutions of the SDDE (3.21). For this purpose, we observe that, for ,
[TABLE]
where . We can therefore define by
[TABLE]
Its inverse function has the form
[TABLE]
Let and . Define for . We then see that , and
[TABLE]
as required by (2.6). With these chosen functions and , we can then apply the truncated EM method to obtain the numerical solutions and of the SDDE (3.21). Moreover, Theorem 3.5 shows that these numerical solutions will converge to the true solution in the sense that
[TABLE]
for any . **
4 Convergence in for
In the previous section, we showed that the truncated EM solutions and will converge to the true solution in for any . This is sufficient for some applications, for example, when we need to approximate the mean value of the solution or the European call option value (see, e.g., [5]). However, we sometimes need to approximate the variance or higher moment of the solution. In these situations, we need to have the convergence in for . For this purpose, we impose a stronger Khasminskii-type condition.
Assumption 4.1
There is a pair of constants and such that
[TABLE]
for all .
Once again, the truncated functions and preserve this condition nicely.
Lemma 4.2
Let Assumption 4.1 hold. Then, for every , we have
[TABLE]
for all .
This lemma can be proved in the same way as Lemma 2.4 was proved. We also cite a stronger result than Lemma 2.3 from [17].
Lemma 4.3
Let Assumptions 2.1 and 4.1 hold. Then for any given initial data (2.2), there is a unique global solution to equation (2.1) on . Moreover, the solution has the property that
[TABLE]
Let us now establish a stronger result than Lemma 3.1.
Lemma 4.4
Let Assumptions 2.1 and 4.1 hold. Then
[TABLE]
Proof. Fix any . By the Itô formula, we derive from (2.16) that, for ,
[TABLE]
By Lemma 4.2 and the Young inequality
[TABLE]
we then have
[TABLE]
But, by Lemma 2.5 with and inequalities (2.8) and (2.6), we have
[TABLE]
We therefore have
[TABLE]
As this holds for any while the sum of the RHS terms is non-decreasing in , we then see
[TABLE]
The well-known Gronwall inequality yields that
[TABLE]
As this holds for any while is independent of , we see the required assertion (4.4).
The following two lemmas are the analogues of Lemmas 3.2 and 3.3.
Lemma 4.5
Let Assumptions 2.1 and 4.1 hold. For any real number , define the stopping time . Then
[TABLE]
Lemma 4.6
Let Assumptions 2.1 and 4.1 hold. For any real number and , define the stopping time . Then
[TABLE]
Their proofs are similar to those of Lemmas 3.2 and 3.3, respectively, so are omitted. We can now state our main result in this section.
Theorem 4.7
Let Assumptions 2.1, 3.4 and 4.1 hold. Then, for any ,
[TABLE]
Proof. We use the same notation as in the proof of Theorem 3.5. Fix any . Using the Young inequality, we can show that for any ,
[TABLE]
By Lemmas 4.3 and 4.4, we have
[TABLE]
[TABLE]
Using these and (3) (please recall Remark 3.6), we obtain
[TABLE]
Now, for any , we first choose sufficiently small for and then choose sufficiently large for
[TABLE]
and further then choose sufficiently small for to get that
[TABLE]
In other words, we have shown that
[TABLE]
This, along with Lemma 2.5, implies another assertion
[TABLE]
The proof is therefore complete.
Let us now discuss an example to illustrate this theorem before we study the convergence rates.
Example 4.8
Consider the scalar SDDE
[TABLE]
with the initial data which satisfy Assumption 3.4, where
[TABLE]
and are all real numbers with . Clearly, the coefficients and are locally Lipschitz continuous, namely, they satisfy Assumption 2.1. Moreover, for any , we have
[TABLE]
But, by the Young inequality,
[TABLE]
We therefore have
[TABLE]
where and
[TABLE]
That is, Assumption 4.1 is satisfied for any . To apply Theorem 4.7, we still need to design functions and satisfying (2.5) and (2.6). Note that
[TABLE]
where . We can hence have and its inverse function for . For , we define for . Letting be sufficiently small, we can make (2.6) hold. By Theorem 4.7, we can then conclude that the truncated EM solutions will converge to the true solution in the sense that
[TABLE]
for every . **
5 Convergence Rates
In the previous sections, we showed the convergence in of the truncated EM solutions to the true solution. However, the convergence was in the asymptotic form without the convergence rate. In this section we will discuss the rate. To avoid the notation becoming too complicated, we will only discuss the convergence rate in but the technique developed here can certainly be applied to study the rate in . Recall that we use two functions and to define the truncated EM method. The choices of these functions are independent as long as they satisfy (2.5) and (2.6), respectively. It is interesting to see that they will satisfy a related condition in order for us to obtain the convergence rate.
We need an additional condition. To state it, we need a new notation. Let denote the family of continuous functions such that for each , there is a positive constant for which
[TABLE]
Assumption 5.1
Assume that there is a positive constant and a function such that
[TABLE]
for all .
Let us first present a key lemma.
Lemma 5.2
Let Assumptions 2.1, 3.4 and 5.1 hold. Let be a real number and let be sufficiently small such that . Let and be the same as defined in Section 3. Then
[TABLE]
where, as before, is the generic constant independent of and .
Proof. We write for simplicity. The Itô formula shows that
[TABLE]
for . We observe that for ,
[TABLE]
But we have the condition that , so
[TABLE]
Recalling the definition of the truncated functions and as well as (2.5), we hence have that
[TABLE]
and
[TABLE]
for . It therefore follows from (5.3) that
[TABLE]
By Assumption 5.1 and (5.4), we then derive that
[TABLE]
But, by Assumption 3.4 and Lemma 2.5, we derive that
[TABLE]
Moreover, by the property of the -class function and Assumption 3.4, we have
[TABLE]
where . Furthermore, by Lemma 2.5,
[TABLE]
Substituting (5.7)-(5.9) into (5.6), we get
[TABLE]
By the Gronwall inequality, we obtain the required assertion (5.2).
Let us now state our first result on the convergence rate, where we reveal a strong relation between functions and , which are used to define the truncated EM method.
Theorem 5.3
Let Assumptions 2.1, 5.1, 4.1 and 3.4 hold. Assume that
[TABLE]
for all sufficiently small . Then, for every such small ,
[TABLE]
and
[TABLE]
Proof. We use the same notation as in the proof of Theorem 4.7. It follows from (4.9)-(4.11) with that the inequality
[TABLE]
holds for any , and . In particular, choosing
[TABLE]
we get
[TABLE]
But, by condition (5.10), we have
[TABLE]
We can hence apply Lemma 5.2 to obtain
[TABLE]
Substituting this into (5.14) yields the first assertion (5.11) . The second assertion (5.12) follows from (5.11) and Lemma 2.5.
Let us discuss an example to illustrate Theorem 5.3 and to motivate our further results on the convergence rates.
Example 5.4
Consider the same SDE in Example 4.8. We need to verify Assumption 5.1. For , it is easy to show that
[TABLE]
But, by the mean value theorem,
[TABLE]
Let . Then and
[TABLE]
Substituting this into (5.16) yields
[TABLE]
Similarly, we can show that
[TABLE]
where . It then follows from (5.17) and (5.18) that
[TABLE]
where and . It is obvious that . In other words, we have shown that Assumption 5.1 is satisfied too. To apply Theorem 5.3, we use the same functions and as defined in Example 4.8. We observe that inequality (5.10) becomes
[TABLE]
But, for any , we can choose sufficiently large such that and hence (5.20) holds for all sufficiently small . We can therefore conclude by Theorem 5.3 that the truncated EM solutions of the SDE (4.14) satisfy
[TABLE]
It is known that for every , the Brownian motion is -Hölder continuous (see, e.g., [9]). If we regard the initial data , as an observation of the state during the time interval , it is reasonable to assume that . If is close to 0.5, then (5.21) shows the order of convergence is close to 0.25. Can we improve the order? The answer is yes though we need stronger conditions.
Assumption 5.5
Assume that there are positive constants and and a function such that
[TABLE]
for all .
Assumption 5.6
Assume that there is a pair of positive constants and such that
[TABLE]
for all .
Lemma 5.7
Let Assumptions 2.1, 3.4, 4.1, 5.5 and 5.6 hold and . Let be a real number and let be sufficiently small such that . Let and be the same as defined in Section 3. Then
[TABLE]
Proof. We use the same notation as in the proof of Lemma 5.2. It follows from (5) that
[TABLE]
By Assumptions 3.4, 5.5 and 5.6, we can then show
[TABLE]
where (5.8) has been used and
[TABLE]
But, by the Hölder inequality, Lemmas 2.5 and 4.3 and Assumption 3.4, we can derive that
[TABLE]
Substituting this into (5.26) gives
[TABLE]
which implies the required assertion (5.24).
The following theorem gives a better convergence rate than Theorem 5.3.
Theorem 5.8
Let Assumptions 2.1, 3.4, 4.1, 5.5 and 5.6 hold and . Assume that
[TABLE]
for all sufficiently small . Then, for every such small ,
[TABLE]
and
[TABLE]
Proof. We use the same notation as in the proof of Theorem 5.3. Choosing
[TABLE]
we get from (5.13) that
[TABLE]
But, by condition (5.27), we have
[TABLE]
We can hence apply Lemma 5.7 to obtain
[TABLE]
Substituting this into (5.30) yields the first assertion (5.28) . The second assertion (5.29) follows from (5.28) and Lemma 2.5.
Example 5.9
Let us return to Example 4.8 once again. Instead of (5.18), we can have the following alternative estimate
[TABLE]
where . It then follows from (5.17) and (5.32) that
[TABLE]
where and . In other words, we have shown that Assumption 5.5 is satisfied with . It is also straightforward to show that
[TABLE]
We hence see from (5.32) and (5.34) that Assumption 5.6 is also satisfied with . In other words, we have shown that Assumptions 2.1, 4.1, 3.4, 5.5 and 5.6 hold for every . Let and be the same as before. We can then conclude by Theorem 5.8 that the truncated EM solutions of the SDE (4.14) satisfy
[TABLE]
In particular, if is close to 0.5 (or bigger than half), this shows that the order of convergence is close to 0.5. **
6 Conclusion
In this paper we have used the new explicit method, called the truncated EM method, to study the strong convergence of the numerical solutions for nonlinear SDDEs. For a given stepsize , we define the discrete-time truncated EM numerical solution and then form two versions of the continuous-time truncated EM solutions, namely the continuous-time step-process truncated EM solution and the continuous-time continuous-process truncated EM solution . Under the local Lipschitz condition plus the generalized Khasminskii-type condition, we have successfully shown the strong convergence of both continuous-time truncated EM solutions to the true solution in the sense that
[TABLE]
for any and . Under a slightly stronger Khasminskii-type condition, we have showed the above convergence for some . We have also discussed the convergence rates in under some additional conditions. We have used several examples to illustrate our theory throughout the paper.
Acknowledgements
The authors would like to thank the Leverhulme Trust (RF-2015-385), the Royal Society of London (IE131408), the Natural Science Foundation of China (11471216), the Natural Science Foundation of Shanghai (14ZR1431300), the Ministry of Education (MOE) of China (MS2014DHDX020) for their financial support.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Bahar, A. and Mao, X., Stochastic delay Lotka-Volterra model, J. Math. Anal. Appl. 292 (2004), 364–380.
- 2[2] Bahar, A. and Mao, X., Stochastic delay population dynamics, International J. Pure and Applied Math. 11 (2004), 377–399.
- 3[3] Baker,C.T.H. and Buckwar, E., Numerical analysis of explicit one-step methods for stochastic delay differential equations, LMS J. Comput. Math. 3 (2000), 315–335.
- 4[4] Da Prato, G. and Zabczyk, J., Stochastic Equations in Infinite Dimensions , Cambridge Univeristy Press, 1992.
- 5[5] Higham D.J. and Mao X., Convergence of Monte Carlo simulations involving the mean-reverting square root process, J. Comput. Finance 8(3) (2005), 35–62.
- 6[6] Khasminskii, R.Z., Stochastic Stability of Differential Equations , Alphen: Sijtjoff and Noordhoff (translation of the Russian edition, Moscow, Nauka 1969), 1980.
- 7[7] Kloeden, P.E. and Platen, E., Numerical Solution of Stochastic Differential Equations , Springer-Verlag, New York, 1992.
- 8[8] Kolmanovskii, V. and Myshkis, A., Applied Theory of Functional Differential Equations , Kluwer Academic Publishers, 1992.
