Positivity-preserving truncated Euler and Milstein methods for financial SDEs with super-linear coefficients
Abstract
In this paper, we propose two variants of the positivity-preserving schemes, namely the truncated Euler-Maruyama (EM) method and the truncated Milstein scheme, applied to stochastic differential equations (SDEs) with positive solutions and super-linear coefficients. Under some regularity and integrability assumptions we derive the optimal strong convergence rates of the two schemes. Moreover, we demonstrate flexibility of our approaches by applying the truncated methods to approximate SDEs with super-linear coefficients (3/2 and Aït-Sahalia models) directly and also with sub-linear coefficients (CIR model) indirectly. Numerical experiments are provided to verify the effectiveness of the theoretical results.
keywords:
Truncated EM method, Truncated Milstein method, Strong convergence order, Positivity preservation.1 Introduction
The goal of this paper is to derive a positivity-preserving numerical method for scalar SDEs which takes values in and have super-linear coefficients. Typical examples of such SDEs in mathematical finance and bio-mathematical applications are the Heston-3/2 volatility process [1]
(1.1) |
with , and the Aït-Sahalia (AIT, for short) model [2]
(1.2) |
where all constant parameters are nonnegative, , and is a Wiener process. The SDEs appearing in such models are highly nonlinear and may contain the singularity in the neighbourhood of zero in the drift or diffusion coefficient. Such SDEs in almost all cases cannot be solved explicitly, and it has been and still is a very active topic of research to approximate SDEs with super-linear coefficients; see, e.g., [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20], and the references therein.
Scheme | Norm | Parameter Range | Rate |
---|---|---|---|
Lamperti Projected EM | |||
(Chassagneux et al. [5]) | |||
Lamperti Semi-Discrete EM | |||
(Halidias and Stamatiou [21]) | |||
Lamperti BEM | |||
(Neuenkirch and Szpruch [4]) | |||
Logarithmic Truncated EM | |||
(Yi et al. [11], Lei et al. [13]) | |||
Logarithmic Truncated EM | |||
(Tang and Mao [22]) | |||
BEM | without rate | ||
(Szpruch et al. [3]) | |||
Theta EM | |||
(Wang et al. [23]) | |||
Truncated EM | |||
(Deng et al. [24]) | |||
Proposed Truncated EM | |||
Semi-implicit Tamed EM | |||
(Liu et al. [19]) | |||
Semi-implicit Projected Milstein | |||
(Jiang et al. [18]) | |||
Proposed Truncated Milstein |
Two significant challenges in constructing a numerical method for non-linear SDEs with positive solutions are to preserve positivity and to derive convergence with as high a rate as possible. In this section, we mainly discuss the positivity-preserving numerical methods for AIT (1.2). In fact, the techniques to handle the superlinearity and the singularity of the AIT coefficients can be applied to a more general SDE with positive solutions and super-linear coefficients. Table 1 gives a summary of the known results of some of the key methods which possess positivity preservation for AIT (1.2). We now discuss two main methods for the strong approximation of (1.2), the first is based on Lamperti/logarithmic transformation, and the second is direct approximation of AIT (1.2).
A classical transformation approach is to apply the Lamperti transformation in order to obtain an auxiliary SDE in with a globally Lipschitz diffusion, but a drift function which is unbounded when solutions are in a neighbourhood of zero. For Lamperti transformation methods that preserve positivity for (1.2) see, for example, Lamperti backward EM (BEM) [4], Lamperti projected EM [5], and Lamperti Semi-Discrete EM [21]. However, this type of polynomial transformation would shift all the nonsmoothness into the drift function. In recent years, much effort has focused on deriving the combination of logarithmic transformation and Euler/Milstein-type schemes for general SDEs which have positive solutions. For such SDEs, an effective explicit scheme that preserves positivity is the logarithmic truncated EM proposed by Yi et al. [11]. The method is to apply a logarithmic transformation to original SDE and to numerically approximate the transformed SDE by a truncated EM (an explicit method established in [25, 26]). Under the Khasminskii-type and the global monotonicity conditions on coefficients of transformed SDE, the method was shown to have strong -order of convergence . In a subsequent paper [16], a logarithmic truncated Milstein scheme was proved to have strong -convergence of order , see Table 1. However, when the logarithmic method in [11] is applied to AIT (1.2), the method requires a more restrictive condition: in order to satisfy the Khasminskii-type requirement for the transformed SDE, in contrast to the other positivity-preserving methods in Table 1. The same approach was also used by Tang and Mao in [22] to derive strong order for the SDEs with positive solutions, but weaker assumptions on the coefficients of original SDE was required.
The second main approach that preserve positivity of the numerical solution is to directly discretise (1.2) by using the implicit or truncated tricks. A backward EM (BEM) was shown to preserve positivity of the solution for AIT (1.2) in Szpruch et al. [27], where the authors proved the strong convergence of the method, but without revealing a rate. This gap was filled by Wang et al. in [23], where the authors successfully recovered the mean-square convergence rate of order for the theta EM applied to (1.2). However, the computational costs of solving implicit algebraic equations produced by classical BEM rise as the parameter increases.
A truncated EM that seeks to directly approximate AIT was proposed by Emmanuel and Mao in [28], where the authors proved the strong -convergence of the method, but they did not reveal a convergence rate. Recently, the -convergence rate of order of this method was obtained by Deng et al. [24]. At the same time, a novel semi-implicit plus tamed EM was introduced by Liu et al. in [19], where the authors established the strong -convergence of rate based on an implicit treatment of the singular term to ensure the property of positiveness and a suitable taming of the super-linear terms and . It should be pointed out that this method is explicit, as the proposed scheme can be explicitly expressed by finding a positive root of a quadratic equation. Therefore, compared with the implicit schemes in [3, 4, 23] the computational costs in [19] can be significantly reduced. Similar approach was also used by Jiang et al. in [18] to derive strong order of semi-implicit projected Milstein for AIT process. See Table 1 for a comparison.
The motivation of this paper is the following observation: in [24] the theoretical -convergence rate of truncated EM for AIT is only , rather than the optimal , and it should be further increased. As a consequence, this paper is concerned with the optimal strong convergence rate of the positivity-preserving truncated methods for general SDE (2.2) with solution and super-linear coefficients. We note that the error analysis in [24] is based on the higher moment estimates of the numerical solution and the interpolation of the discretization scheme to continuous time. According to the theory of Mao [25, 26], it is inevitable to estimate the probability of truncated EM solution escaping from the truncated interval , i.e., . However, [24, Lemma 3.2] implies that the upper bound for this probability is of order at most, i.e.,
(1.3) |
which prevents the truncated EM in [24] from achieving the optimal strong order . In this work, we seek to bypass this issue.
Motivated by the approaches of [5, 29], we adopt the error analysis based on the higher moment and inverse moment estimates of the true solution and the discretised scheme rather than the continuous time extension of numerical solution. We first prove a key Lemma 2.4 which shows the global monotonicity for the truncated functions and implies the stochastic C-Stability of the truncated EM in the sense of [29, Definition 3.2]. By the finiteness of the th moments and th inverse moments of the true solution , we then obtain the local truncations errors of and in , which implies the stochastic B-Consistency of the truncated EM in the sense of [29, Definition 3.3], see Lemma 3.1. Combining Lemma 2.4 with Lemma 3.1 allows us to establish the optimal -convergence of order of positivity-preserving truncated EM for SDE (2.2) in the similar proofs as in [30, Theorem 5.36]. According to the global error estimate (3.14) in Theorem 3.2, we show that the truncated numerical solution has some finite moments and inverse moments, see Proposition 3.4. By -convergence Theorem 3.2 and moment boundedness Proposition 3.4, we apply truncated EM to directly approximate the 3/2 and the AIT models, see Applications 4.1 and 4.2. Based on the Lamperti transformation, we also apply this method to indirectly approximate the CIR process, see Application 4.3. Combining the Milstein scheme with the truncated strategy, we also prove the strong -convergence order for the truncated Milstein, in the similar method of analyzing the convergence rate of the truncated EM applied to SDE (2.2).
The main contributions of this paper are as follows:
- 1.
-
2.
Compared with the projected EM in [5], where the method requires that the diffusion coefficients of SDEs are globally Lipschitz continuous, our truncated methods can apply to a wide class of SDEs with positive solutions and super-linearly growing diffusion coefficients.
-
3.
Our error analysis method does not relies on the high-order moments and inverse moments estimates, the continuous time extension of the numerical solution. Thus our truncated methods can be applied to approximate SDEs with super-linear coefficients directly and also with sub-linear coefficients indirectly, see Applications 4.
The structure of this paper is as follows. In Section 2 we give the form of the SDE with positive solution and super-linear coefficients, specify some regularity and integrability constraints placed upon the coefficients for the main strong convergence theorems. In Section 3 we set up the framework and prove the optimal strong convergence order as well as establish the moment boundedness results for the positivity-preserving truncated EM and Milstein schemes. In Section 4 we apply the proposed methods to some financial SDEs, such as the 3/2 and the AIT as well as the CIR models. In Section 5 we numerically compare convergence and efficiency of several commonly used methods. Finally, we have included in a small appendix a couple of proofs to make this paper self contained.
2 Setting and preliminaries
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 and . We write and respectively for the Euclidean norm and the inner produce on . Let be a one-dimensional Brownian motion with respect to the normal filtration . Let denote the expectation. Denote by , for , the set of random variables such that . We denote by the conditional expectation given the filtration . For two real numbers and , and . W denote by the space of twice differential functions with continuous derivatives on . For any , we denote the rounded up integer. For a set , its indicator function is denoted by . In the following it will be convenient to introduce the abbreviation
Moreover, given , we define a functional by
In this work, we frequently apply the weighted Young inequality
(2.1) |
Consider a one-dimensional SDE of the form
(2.2) | ||||
Throughout this paper, we assume that SDE (2.2) has a unique strong solution in . We now formulate the conditions on the drift and the diffusion coefficient functions.
Assumption 2.1
There are , , , such that
(2.3) |
Assumption 2.2
Assume that and there are positive numbers and , such that
(2.4) |
Assumption 2.3
There are constants and , such that
(2.5) |
In what follows, will be used to denote a positive constant depending on , , , , , and , but whose value may be different from line to line. We denote it by if it depends on an extra parameter .
Assumption 2.2 implies that the monotonicity condition is fulfilled on , i.e.,
(2.6) |
and
(2.7) |
see [22, Remark 2.1]. Assumption 2.3 imposes a condition on the moments of the true solution in terms of the locally Lipschitz exponents , . Combining this assumption and Assumption 2.1 allows us to bound the local truncations errors for and , see Lemma 3.1.
Let , define a truncation mapping by
(2.8) |
where is the size of truncated interval with and is a constant to be determined later. Define the truncated functions
(2.9) |
The following lemma shows that the truncated mapping is -Lipschitz continuous on , and the truncated functions and preserve the monotonicity condition (2.6).
Lemma 2.4
The proof of this lemma is postponed to Appendix 6.1. From Lemma 2.4, we have,
(2.12) | ||||
(2.13) |
Moreover, by Assumption 2.1 and (2.8) as well as (2.10), we have
(2.14) |
where with
(2.15) |
We now provide two lemmas, their proofs are postponed to Appendix 6.2 and 6.3. Lemma 2.5 reveals the Hölder continuity of the true solution to (2.2) with respect to the norm in , while Lemma 2.6 shows the -error due to truncating the true solution on .
Lemma 2.5
3 Main Results
3.1 Positivity-preserving Truncated EM (TEM) scheme
The first positivity-preserving scheme is termed truncated EM scheme. To be more precise, let be a step size, define the following TEM scheme by setting and computing
(3.1) |
for , where , and has been defined in (2.8). By (2.9), (3.1) can be rewritten as the following form:
(3.2) |
We now begin to bound the local truncations errors for and in sense.
Lemma 3.1
Proof. One notes that condition (3.10) implies
(3.6) |
For any , we conclude from (2.3) and the Hölder inequality that
(3.7) | ||||
where Assumption 2.3 and Lemma 2.5 have been used. Moreover,
By the Hölder inequality, (2.17) and (3.7), we have
(3.8) | ||||
By the Burkholder-Davis-Gundy identity, we have
(3.9) | ||||
Combining (3.7) with (2.17), we conclude from (3.9) that
The proof is finished.
We now consider the global discretization error between the true solution and the discretized process . The following theorem reveals the optimal strong convergence rate of TEM in the sense of .
Theorem 3.2 (Convergence order of TEM)
Proof. One notes that condition (3.10) implies conditions (2.15) and (3.3). We observe from (2.2) that
(3.15) |
where and are defined in Lemma 3.1. Thus, we conclude from (3.2) and (3.15) that
(3.16) |
Denote by
(3.17) |
Without loss of generality, we assume that is an even integer and Condition (3.11) is satisfied. It follows from the binomial formula that
(3.18) |
where
(3.19) |
By the elementary inequality (2.1), we have
According to Lemma 2.4, we have
(3.20) |
By the elementary inequality (2.1) and Lemma 3.1, we have
(3.21) |
Similarly,
(3.22) |
and
(3.23) |
Moreover, is globally Lipschitz continuous with Lipschitz constant , see (2.14). Thus
(3.24) |
In addition, we have the following identity
(3.25) |
(3.26) |
In the same fashion as (3.26) is obtained, we also can show that
(3.27) |
Thus, we conclude from (3.18) that
(3.28) | ||||
Using the discrete Gronwall inequality yields
(3.29) |
To balance the error terms, we set . From this and (3.11), we have
(3.30) |
which implies that
(3.31) |
and (3.13) holds. Moreover, by Lemma 2.4 and (2.18) as well as (3.13), we have
(3.32) | ||||
which is the desired assertion (3.14).
Remark 3.3
For application use, we show that our numerical solutions have some finite, or inverse, moments.
Proposition 3.4 (Moment boundedness of TEM)
Proof. Let and be the parameters satisfying (3.35) and (3.36), respectively. Then,
Therefore, (3.37) follows from (3.33). We now prove (1). For , (3.38) follows from Theorem 3.2, Assumption 2.3 and the following inequality
We now assume that . Write for simplicity. Let
where . Clearly, we have that
(3.40) | ||||
Since, , we conclude from Assumption 2.3 that
(3.41) |
By the elementary inequality and Assumption 2.3, we have
(3.42) | ||||
We note that
Therefore,
(3.43) | ||||
By the Hölder and the Markov inequalities as well as Theorem 3.2, we have
(3.45) | ||||
If we set
(3.46) |
such that , then we conclude from (3.43) and (3.45) that
(3.47) | ||||
We now prove (2). For We observe that
(3.48) | ||||
Since, , we conclude from Assumption 2.3 that
(3.49) | ||||
By the elementary inequality and Assumption 2.3, we have
(3.50) | ||||
By the Hölder and Markov inequality, we have
(3.51) |
If we set
(3.52) |
such that , then
(3.53) | ||||
From the above analysis, we observe that in sense if we set , then our convergence results can be described in a more concise form, see the following corollary.
Corollary 3.5
Remark 3.6
It is worth mentioning how our results of TEM compares with that of Zhan and Li in [32], where the authors proved the -convergence of order of a truncated EM for super-linear SDE. However, their method do not preserve the property of positiveness that we are interested in and their results do not reveal the boundedness of moment and inverse moment of the numerical solutions. This hinders the further application of the truncated method for some important SDEs, such as Lamperti transformed CIR model, see Application 4.3.
3.2 Positivity-preserving Truncated Milstein (TMil) scheme
We now come to the second numerical scheme, which is called truncated Milstein (TMil) scheme. In order to show the first-order strong rate of convergence for this scheme, we need the following assumption, which is stronger than Assumption 2.1.
Assumption 3.7
Let . There are , , , such that for any it holds
(3.57) | ||||
(3.58) |
For a possibly enlarged the following estimates are an immediate consequence of Assumption 3.7 and the mean value theorem: For any it holds
(3.59) | |||
(3.60) | |||
(3.61) | |||
(3.62) |
and
(3.63) | |||
(3.64) | |||
(3.65) | |||
(3.66) |
As above, we verify under Assumption 3.7 that the mapping satisfies the polynomial Lipschitz condition
(3.67) |
and the polynomial growth bound
(3.68) |
for any . We define the following notation for the stochastic increments:
We now begin to construct a positivity-preserving truncated Milstein method, which is defined by setting and by the recursion
(3.69) | ||||
(3.70) |
for , where has been defined in (2.8) with a given parameter , and are defined in (2.9),
(3.71) |
The following lemma implies that the TMil method is stochastically -stable in the sense of [29, Definition 3.2], and plays an important role in the convergence analysis of the TMil method.
Lemma 3.8
Proof. By (3.67) and (2.10), we have
Thus, by Lemma 2.4 and (2.14), we have
Thus, the proof is finished.
From (3.8), we have
(3.74) |
However, if we insert the conditional expectation with respect to the -field , the order convergence indicated by (3.74) can be increased, see (3.75).
Proof. By the Itô formula, we have
(3.78) |
Thus,
(3.79) |
By (3.72), we have
which implies that (3.75) holds.
It remains to show (3.77). Again, by the Itô isometry, we have
(3.80) |
where
Thus, the assertion (3.77) is proved if there is a constant independent of and such that
(3.81) |
Again, by the Itô formula, we get
Thus,
(3.82) |
From (3.72), we have
(3.83) |
By the Itô isometry, we get
(3.84) |
In the similar fashion as (3.7) is obtained, we also can show that
(3.85) |
Thus, inserting (3.84) and (3.83) into (3.2), we conclude that , which completes the proof of (3.77).
Proof. Let condition (3.86) hold and set . Then
(3.89) |
Thus, we conclude from Lemma 2.6 that
(3.90) |
Moreover, we have the following decomposition
Therefore,
where (3.75) and (3.2) have been used. In addition, Itô isometry implies that
(3.91) |
where
where the last step follows from (3.89). In a similar fashion as (2.17) was proved, we also can show that
where (3.89) has been used. Thus,
The following theorem shows that the TMil achieves the optimal mean-square convergence order .
Theorem 3.12 (Convergence order of TMil)
Proof. We observe from (2.2) that
(3.96) |
where and are defined in Lemma 3.11. Thus, we conclude from (3.70) and (3.96) that
(3.97) | ||||
(3.98) |
By the orthogonality of the conditional expectation it holds
Thus, by the elementary inequality
(3.99) |
and
as well as Lemma 3.8, we have
(3.100) | ||||
(3.101) |
where
According to (3.76), we have
Combining this and Lemma 3.11, we get
Inserting this into (3.100), we have
Using the discrete Gronwall inequality yields the desired assertion (3.94). It remains to prove (3.95). From Lemma 2.6, we get immediately that
Combining this and Lemma 2.4 as well as the triangle inequality, we obtain the assertion (3.95). Thus, the proof is finished.
If we apply Proposition 3.4 with , and , then we have the following moment boundedness of the TMil solutions.
4 Applications
We now apply our results to some SDEs in mathematical finance.
4.1 3/2 model
The 3/2 process is the solution to (1.1) and is strictly positive almost surely. Introduce the quantity
(4.1) |
Existence and uniqueness can be retrieved from the properties of the Feller diffusion, and
(4.2) |
see [5, p. 1009]. Clearly, Assumption 2.1 is satisfied with exponents and . If condition
(4.3) |
holds, then
which means that Assumption 2.2 holds. If , we choose , and fix , so that conditions 3.10 and 4.3 are satisfied. The following results reveal that the TEM for 3/2 model has -order of , and are finite from Proposition 3.5.
Corollary 4.1 (Convergence rate and moment boundedness of TEM for 3/2 model)
4.2 Aït-Sahalia model
Let be the solution to Aït-Sahalia interest rate model (1.2). If , then there exists a strong solution on ; and are finite for any , see [27, Lemma 2.1]. In other words, Assumption 2.3 holds. Moreover, Assumptions 2.1 and 2.2 also hold for , and , see [24, p. 11]. The following results follows from Proposition 3.4.
Corollary 4.3 (Convergence rate of TEM for Aït-Sahalia model)
Clearly, Assumption 3.7 holds for and . By Theorem 3.12 and Proposition 3.13, we have the following corollary.
Corollary 4.4 (Convergence rate of TMil for Aït-Sahalia model)
4.3 CIR model
The Cox-Ingersoll-Ross (CIR) process is given by the SDE
(4.14) |
where , , are strictly positive constant parameters. Under the Feller condition
(4.15) |
remains strictly positive almost surely. However Assumption 2.2 does not hold for CIR (4.14). Thus, our TEM can not apply to approximate CIR (4.14) directly. But, if we combine the Lamperti transform with our TEM, the strong -convergence of order can be derived for in a restricted parameter range.
Applying the Itô formula to the Lamperti transform gives a new SDE
(4.16) |
where
From [33, p. 5], we have that
and therefore,
Thus, for transformed SDE (4.16), Assumptions 2.1-2.3 hold with , , , . Moreover, Assumption 3.7 also holds with , . According to Proposition 3.4 and Theorem 3.12, we have the following results.
Corollary 4.6 (Convergence rate of Lamperti TEM/TMil for CIR model)
Proof. Let be the solution of (4.16). In order to approximate the original CIR process, we observe that
Then the Hölder inequality gives
implies that Condition (3.35) is satisfied. From (3.38), we obatian . Similarly, is finite. This, combined with (3.37) lead to (4.17). Similarly, by Theorem 3.12 and Corollary 3.13, we can show that (4.18) also holds.
5 Numerical experiments
In this section we compare TEM (3.1) and TMil (3.70) to some numerical schemes that we outline below for the 3/2 and the AIT models.
-
1.
Euler-Maruyama scheme (EM) [34]:
-
2.
Backward Euler-Maruyama scheme (BEM) [27]:
- 3.
-
4.
Semi-implicit Tamed EM scheme for AIT (STEM) [19]:
- 5.
Denote by the scheme approximation at time and by the reference solution calculated by the corresponding scheme with small step size , using the same Brownian motion path (the th path). The root mean square error (RMSE) for the scheme is defined by
over sample paths. The strong error rates are computed by plotting RMSE against the step size on a log-log scale, and the strong rate of convergence is then retrieved using linear regression. Moreover, the event is defined by
(5.1) |
where is generated by the TEM scheme (3.2).
Example 5.1
Consider the following 3/2 model
(5.2) |
where . Now, we set , , . According to Corollaries 4.1 and 4.2, TEM solution and TMil solution has the property that
respectively. RMSEs for different step sizes and rates of TEM and TMil for 3/2 model are displayed in Table 2 and Figure 1a. In the last line in Table 2, we observe the empirical rates 0.6138 and 1.0537 of TEM and TMil for , 0.6694 and 1.0613 of TEM and TMil for , which shows that the observed rates of convergence are slightly higher than the theoretical rates.
Moreover, the fourth and the seventh column in Table 2 lists respectively the probabilities of the TEM solutions escaping from for different step sizes under a small noise intensity with , and a higher intensity with . We observe that as the step size goes to zero, this probability tends to zero. In other words, for a sufficiently small step size, say , the truncation from (3.1) does not execute for Example 5.1. In this context, our TEM and the EM coincide with a large probability.
TEM | TMil | TEM | TMil | |||
---|---|---|---|---|---|---|
2.2170e-02 | 1.3748e-02 | 1.0827e-01 | 4.7061e-02 | |||
1.3872e-02 | 6.3934e-03 | 5.4048e-02 | 2.0271e-02 | |||
8.6830e-03 | 3.1602e-03 | 3.4534e-02 | 1.0442e-02 | |||
5.9060e-03 | 1.4982e-03 | 2.3511e-02 | 5.0293e-03 | |||
4.0491e-03 | 7.3669e-04 | 1.6132e-02 | 2.3878e-03 | |||
rate | 0.6138 | 1.0537 | 0.6694 | 1.0613 |
log TEM | STEM | STEM2 | BEM | TEM | TMil | |
---|---|---|---|---|---|---|
1.4201e-01 | 4.2682e-02 | 4.0054e-02 | 3.4322e-02 | 4.6424e-02 | 3.5164e-02 | |
1.0806e-01 | 3.1297e-02 | 2.5265e-02 | 2.6534e-02 | 2.7311e-02 | 1.5099e-02 | |
7.2431e-02 | 2.1658e-02 | 1.6477e-02 | 1.6354e-02 | 1.7300e-02 | 7.1460e-03 | |
5.3581e-02 | 1.4881e-02 | 1.1161e-02 | 1.1703e-02 | 1.1393e-02 | 3.2951e-03 | |
3.6888e-02 | 1.0145e-02 | 7.6605e-03 | 7.5196e-03 | 7.7554e-03 | 1.5746e-03 | |
rate | 0.4902 | 0.5218 | 0.5951 | 0.5566 | 0.6425 | 1.1158 |
CPU time | 4.86s | 4.19s | 3.56s | 2161.61s | 3.16s | 3.19s |
Example 5.2
Consider the AIT model (1.2) with the following parameters
Clearly, the above setting satisfies the condition . Thus, all the methods listed in Table 1 can be applied to this AIT.
Sample trajectories from TEM, EM, log TEM, STEM, STEM2, and BEM for AIT are plotted in Figure 2, which shows that truncation occurs where the solution is close to zero and thus these methods except EM maintain positivity of the numerical approximations.
RMSEs and rates for different schemes are presented in Figure 1b and Table 3. In Figure 1b, we observe that log TEM has the largest error constant, whereas STEM, STEM2, BEM and TEM appear to have smaller error constants. Furthermore, the graphs of the log TEM, the STEM, the STEM2, and the BEM seem parallel to the reference line with slope equal to , while the TEM has a slightly bigger slope. Nevertheless, we observe in Figure 1b and Table 3 that TMil reaches the optimal convergence rate and thus has a slight advantage over TEM when high accuracy is required. This behavior is also confirmed in the sixed line in Table 3. As expected the empirical rates of convergence are close to the theoretical ones.
Computational costs as measured by CPU time in seconds for difference methods are illustrated in the last line in Table 3, where we set , and . One clearly observes that the explicit log TEM, STEM, STEM2, TEM and TMil greatly decreases the computational time compared to the implicit BEM. Since in the implementation of the BEM, we have to solve numerically a non-linear equation at each time step. This extra step brings questions about the computing performance of BEM.
6 Appendix
6.1 Proof of Lemma 2.4
6.2 Proof of Lemma 2.5
6.3 Proof of Lemma 2.6
Proof. Write for simplicity. We conclude from (2.12) that
(6.8) |
Combining this with (2.3), we observe that
(6.9) | ||||
Consider first . By the Hölder and Markov inequalities as well as Assumption 2.3, we have
(6.10) |
Thus,
(6.11) |
Similarly, we also can show that
(6.12) |
By (6.9), (6.11) and (6.3), we conclude that (2.17) holds. (2.18) can be obtained in the same way as the proofs of (2.17). The proof is finished.
Acknowledgment
The authors would like to thank the National Natural Science Foundation of China (12271003, 62273003, 72301173) for their financial support.
References
- Heston [1997] S. Heston, A simple new formula for options with stochastic volatility, Washington University, St. Louis (1997).
- Aït-Sahalia [1996] Y. Aït-Sahalia, Testing continuous-time models of the spot interest rate, Review of Financial Studies 9 (1996) 385–426.
- Szpruch et al. [2011] L. Szpruch, X. Mao, D. J. Higham, J. Pan, Numerical simulation of a strongly nonlinear Aït-Sahalia-type interest rate model, BIT Numerical Mathematics 51 (2011) 405–425.
- Neuenkirch and Szpruch [2014] A. Neuenkirch, L. Szpruch, First order strong approximations of scalar SDEs defined in a domain, Numerische Mathematik 128 (2014) 103–136.
- Chassagneux et al. [2016] J.-F. Chassagneux, A. Jacquier, I. Mihaylov, An explicit Euler scheme with strong rate of convergence for financial SDEs with non-Lipschitz coefficients, SIAM Journal on Financial Mathematics 7 (2016) 993–1021.
- Hefter and Jentzen [2018] M. Hefter, A. Jentzen, On arbitrarily slow convergence rates for strong numerical approximations of Cox-Ingersoll-Ross processes and squared Bessel processes, Finance and Stochastics 23 (2018) 139–172.
- Zhao et al. [2020] Y. Zhao, X. Wang, M. Wang, On the backward Euler method for a generalized Ait-Sahalia-type rate model with Poisson jumps, Numerical Algorithms 87 (2020) 1321–1341.
- Cozma and Reisinger [2020] A. Cozma, C. Reisinger, Strong order 1/2 convergence of full truncation Euler approximations to the Cox-Ingersoll-Ross process, IMA Journal of Numerical Analysis 40 (2020) 358–736.
- Mao et al. [2021] X. Mao, F. Wei, T. Wiriyakraikul, Positivity preserving truncated Euler-Maruyama method for stochastic Lotka-Volterra competition model, Journal of Computational and Applied Mathematics 394 (2021).
- Hong et al. [2022] J. Hong, L. Ji, X. Wang, J. Zhang, Positivity-preserving symplectic methods for the stochastic Lotka-Volterra predator-prey model, BIT Numerical Mathematics 62 (2022) 493–520.
- Yi et al. [2021] Y. Yi, Y. Hu, J. Zhao, Positivity preserving logarithmic Euler-Maruyama type scheme for stochastic differential equations, Communications in Nonlinear Science and Numerical Simulation 101 (2021).
- Scalone [2022] C. Scalone, Positivity preserving stochastic theta-methods for selected SDEs, Applied Numerical Mathematics 172 (2022) 351–358.
- Lei et al. [2023] Z. Lei, S. Gan, Z. Chen, Strong and weak convergence rates of logarithmic transformed truncated EM methods for SDEs with positive solutions, Journal of Computational and Applied Mathematics 419 (2023).
- Kelly and Lord [2023] C. Kelly, G. J. Lord, An adaptive splitting method for the Cox-Ingersoll-Ross process, Applied Numerical Mathematics 186 (2023) 252–273.
- Chen et al. [2023] A. Chen, T. Zhou, P. Burrage, T. Tian, K. Burrage, Composite Patankar-Euler methods for positive simulations of stochastic differential equation models for biological regulatory systems, The Journal of Chemical Physics 159 (2023).
- Hu et al. [2024] X. Hu, M. Wang, X. Dai, Y. Yu, A. Xiao, A positivity preserving Milstein-type method for stochastic differential equations with positive solutions, Journal of Computational and Applied Mathematics 449 (2024) 115963.
- Cai et al. [2024] Y. Cai, Q. Guo, X. Mao, Strong convergence of an explicit numerical approximation for n-dimensional superlinear SDEs with positive solutions, Mathematics and Computers in Simulation 216 (2024) 198–212.
- Jiang et al. [2024] Y. Jiang, R. Liu, X. Wang, J. Zhuo, Unconditionally positivity-preserving approximations of the Aït-Sahalia type model: explicit Milstein-type schemes, Numerical Algorithms (2024).
- Liu et al. [2024] R. Liu, Y. Cao, X. Wang, Unconditionally positivity-preserving explicit Euler-type schemes for a generalized Aït-Sahalia model, Numerical Algorithms (2024).
- Cai et al. [2024] Y. Cai, X. Mao, F. Wei, An advanced numerical scheme for multi-dimensional stochastic Kolmogorov equations with superlinear coefficients, Journal of Computational and Applied Mathematics 437 (2024) 115472.
- Halidias and Stamatiou [2023] N. Halidias, I. S. Stamatiou, Boundary preserving explicit scheme for the Aït-Sahalia model, Discrete and Continuous Dynamical Systems - Series B 28 (2023) 648–664.
- Tang and Mao [2024] Y. Tang, X. Mao, The logarithmic truncated EM method with weaker conditions, Applied Numerical Mathematics 198 (2024) 258–275.
- Wang et al. [2020] X. Wang, J. Wu, B. Dong, Mean-square convergence rates of stochastic theta methods for SDEs under a coupled monotonicity condition, BIT Numerical Mathematics 60 (2020) 759–790.
- Deng et al. [2023] S. Deng, C. Fei, W. Fei, X. Mao, Positivity-preserving truncated Euler-Maruyama method for generalised Aït-Sahalia-type interest model, BIT Numerical Mathematics 63 (2023).
- Mao [2015] X. Mao, The truncated Euler-Maruyama method for stochastic differential equations, Journal of Computational and Applied Mathematics 290 (2015) 370–384.
- Mao [2016] X. Mao, Convergence rates of the truncated Euler-Maruyama method for stochastic differential equations, Journal of Computational and Applied Mathematics 296 (2016) 362–375.
- Szpruch et al. [2011] L. Szpruch, X. Mao, D. J. Higham, J. Pan, Numerical simulation of a strongly nonlinear Aït-Sahalia-type interest rate model, BIT Numerical Mathematics 51 (2011) 405–425.
- Emmanuel and Mao [2021] C. Emmanuel, X. Mao, Truncated EM numerical method for generalised Ait-Sahalia-type interest rate model with delay, Journal of Computational and Applied Mathematics 383 (2021).
- Beyn et al. [2016] W.-J. Beyn, E. Isaak, R. Kruse, Stochastic C-stability and B-consistency of explicit and implicit Euler-type schemes, Journal of Scientific Computing 67 (2016) 955–987.
- Shi et al. [2024] B. Shi, Y. Wang, X. Mao, F. Wu, Approximation of invariant measures of a class of backward Euler-Maruyama scheme for stochastic functional differential equations, Journal of Differential Equations 389 (2024) 415–456.
- Guo et al. [2018] Q. Guo, W. Liu, X. Mao, A note on the partially truncated Euler-Maruyama method, Applied Numerical Mathematics 130 (2018) 157–170.
- Zhan and Li [2024] W. Zhan, Y. Li, The improvement of the truncated Euler-Maruyama method for non-Lipschitz stochastic differential equations, Advances in Computational Mathematics 50 (2024).
- Dereich et al. [2012] S. Dereich, A. Neuenkirch, L. Szpruch, An Euler-type method for the strong approximation of the Cox-Ingersoll-Ross process, Proceedings: Mathematical Physical and Engineering Sciences 468 (2012) 1105–1115.
- Deng et al. [2019] S. Deng, C. Fei, W. Fei, X. Mao, Generalized Aït-Sahalia-type interest rate model with Poisson jumps and convergence of the numerical approximation, Physica A: Statistical Mechanics and its Applications 533 (2019).