Next Article in Journal
A Novel Modeling Method of Micro-Topography for Grinding Surface Based on Ubiquitiform Theory
Next Article in Special Issue
Stationary Response of a Kind of Nonlinear Stochastic Systems with Variable Mass and Fractional Derivative Damping
Previous Article in Journal
On the Global Well-Posedness of Rotating Magnetohydrodynamics Equations with Fractional Dissipation
Previous Article in Special Issue
Contribution of Using Hadamard Fractional Integral Operator via Mellin Integral Transform for Solving Certain Fractional Kinetic Matrix Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Approach to Compare the Strong Convergence of the Milstein Scheme with the Approximate Coupling Method

Department of Mathematics, College of Science, Qassim University, P.O. Box 6644, Buraydah 51452, Saudi Arabia
Fractal Fract. 2022, 6(6), 339; https://doi.org/10.3390/fractalfract6060339
Submission received: 24 April 2022 / Revised: 12 June 2022 / Accepted: 14 June 2022 / Published: 17 June 2022

Abstract

:
Milstein and approximate coupling approaches are compared for the pathwise numerical solutions to stochastic differential equations (SDE) driven by Brownian motion. These methods attain an order one convergence under the nondegeneracy assumption of the diffusion term for the approximate coupling method. We use MATLAB to simulate these methods by applying them to a particular two-dimensional SDE. Then, we analyze the performance of both methods and the amount of time required to obtain the result. This comparison is essential in several areas, such as stochastic analysis, financial mathematics, and some biological applications.

1. Introduction

It is observed in the literature that the research studies investigating methods for solving stochastic differential equations (SDEs) are progressing rapidly and are attracting the interest of many researchers working in this field. Recently, numerical solutions to stochastic differential equations have become popular with computing simulations. The solution of SDEs has potential applications in many fields, such as economics, finance, and physics [1,2,3]. Some studies have been conducted to find strong solutions to stochastic differential equations to obtain approximations of an order greater than 1 2 . In [1,4,5], the authors developed new methods and used the truncation of the related transforms of the stochastic process to approximate double integrals in higher dimensions. However, these methods required significant computational time. In [6], Fournier used the quadratic Wasserstein metric approach to approximate the Euler scheme. In [7], Davie described the application of the Wasserstein bound to approximate the solutions of SDE and used a version of the method in [2] to obtain order one approximation under some assumptions. Yang et al. [8] used the Itô-Taylor expansion with a specific condition to approximate the densities of multivariate. Under some conditions, Alfonsi et al. [9,10] developed the Wasserstein convergence for the Euler–Maruyama scheme and proved an O ( h ( 2 3 ϵ ) ) convergence for one-dimensional diffusions. Gaines and Lyons [11] developed a new method for two-dimensional SDEs using the rectangle-wedge-tail method. A new method for solving two-dimensional SDEs using the condition on the endpoints was presented in [12]. In [13], the coupling method was used to establish the bounds of an approximate pathwise solution in a given probability space. Some simulation methods for the stochastic differential equation have been studied in [14]. The MATLAB implementation for the Euler and Milstein methods in one- and two-dimensional SDEs was introduced in [15]. Readers interested in knowing more about the simulation of stochastic differential equations can refer to [16,17]. Recently, Kerimkulov et al. [18] proposed a modification to the MSA method based on meticulous estimates for the backward stochastic differential equation. For broad stochastic control problems with control in both the drift and diffusion coefficients, this improved MSA is demonstrated to converge. In [19], the rate of convergence results for a new class of explicit Euler schemes that approximate SDEs with superlinearly rising drift coefficients that meet a certain form of strong monotonicity are described.
There are many applications for finding numerical solutions to stochastic differential equations using several innovative methods, see [20,21,22,23,24,25,26,27,28].
Based on the Milstein method, references [29,30,31,32] provide approximate solutions to some stochastic differential equations. In [29], the infinite-dimensional version of Milstein’s approach for finite-dimensional stochastic ordinary differential equations is investigated. Guo et al. [30] suggested the truncated Milstein approach, which was inspired by Mao’s [33] truncated Euler–Maruyama method. Alnafisah [31] showed how the Milstein approach may be utilized to simulate a two-dimensional SDE using the Fourier series expansion of the Wiener process. To numerically solve the system that consists of replication of several reacting species using activated monomers and inactivated residues, Zahri [32] considered a generalized Milstein method for multi-dimensional SDEs.
In this paper, two numerical methods, Milstein and approximate coupling, are used and compared. This comparison is based on the first-order Milstein method using a Wasserstein matrix with the condition that SDE has invertible diffusion. We show the MATLAB implementation for both methods and compare the result as well as the computational time. We used (MATLAB ver. R2017b) software to obtain the implementation and approximation results. The importance of these comparisons is that they determine the most appropriate method for use in many vital applications in stochastic analysis, financial mathematics, and some biological applications.
The remainder of this article is structured in the following manner. In Section 2, we review various findings concerning SDEs and the Davie method [34]. In Section 4, the comparison between the Milstein and approximate coupling methods is presented. In addition, we provide a numerical implementation to illustrate the convergence behavior in two-dimensional SDEs.

2. Preliminaries

In this section, we provide background information relevant to this study, see [1,3]. Throughout this paper, N denotes the normal distribution, and E represents the expectation.
A standard Brownian motion (Weiner process) over an interval [ 0 , T ] is a random variable ψ ( t ) , which depends continuously on a time t [ 0 , T ) , if the following conditions are satisfied:
(i)
ψ 0 = 0 (with probability one).
(ii)
The random variable is given by increment ψ u ψ ν , for 0 ν < u T , is normally distributed with mean zero and variance u ν . Equivalently, ψ u ψ ν N 0 , u ν .
(iii)
The increments ψ u ψ ν and ψ t ψ s for 0 ν < u < s < t T .
The stochastic process ψ = ψ ( u ) , which is considered in this work, can be described by stochastic differential equations
d ψ ( u ) = η ( u , ψ ( u ) ) d u + μ ( u , ψ ( u ) ) d φ ( u ) , u [ 0 , T ] ,
where { φ ( u ) } u 0 is a m-dimensional standard Brownian motion with probability space ( Ω , F , P ) equipped with a filtration F = ( F u ) u 0 , η = η ( u , ν ) is a m-dimensional vector function, and μ = μ ( u , ν ) is a m × m -matrix function. These functions are called the drift coefficient and diffusion coefficient, respectively.
A F u -adapted stochastic process ψ = ( ψ ( u ) ) u 0 is called a solution of Equation (1), if
ψ ( u ) = ψ ( 0 ) + 0 u η ( ϱ , ψ ( ϱ ) ) d ϱ + 0 u μ ( ϱ , ψ ( ϱ ) ) d φ ( ϱ ) ,
holds, where the initial condition ψ ( 0 ) = ν is an F 0 -measurable random vector in R m . We note that the integral processes
0 u η ( ϱ , ψ ( ϱ ) ) d ϱ a n d 0 u μ ( ϱ , ψ ( ϱ ) ) d φ ( ϱ ) ,
must be well-defined in order for (2) to be satisfied. The functions η ( ϱ , ψ ( ϱ ) ) and μ ( ϱ , ψ ( ϱ ) ) must satisfy the following conditions:
E 0 u μ 2 ( ϱ , ψ ( ϱ ) ) d ϱ < ,
and almost surely for all u 0 ,
0 u | η ( ϱ , ψ ( ϱ ) ) | d ϱ < .
One property for the stochastic integral is
0 u φ ( ϱ ) d φ ( ϱ ) = 1 2 0 u d ( φ 2 ( ϱ ) ) 1 2 0 u d ϱ = 1 2 φ 2 ( u ) u 2 .
For more details on the stochastic integral, the interested reader is referred to [1].
To present the existence and uniqueness theorems, we need the following conditions:
  • Measurability: Let η : [ 0 , ) × R m R m and μ : [ 0 , ) × R m R m × m be jointly Borel measurable in [ u 0 , T ] × R m .
  • Lipschitz condition: There is a positive constant C > 0 such that η ( u , ν ) η ( u , y ) C ν y , and μ ( u , ν ) μ ( u , y ) C ν y , for all u [ u 0 , T] and ν , y R .
  • Growth condition: There is a constant K > 0 such that η ( u , ν ) 2 K 2 ( 1 + ν 2 ) , and μ ( u , ν ) 2 K 2 ( 1 + ν 2 ) , for all u [ u 0 , T] and ν , y R .
Theorem 1
([1], Theorem 4.5.3). Under the previous conditions (1)–(3), the stochastic differential Equation (1) has a unique solution ψ ( u ) [ u 0 , T] with
sup u 0 u u E ( ψ ( u ) 2 ) < .

2.1. Approximation Schemes

In this subsection, we briefly review the schemes of the Euler–Maruyama, Milstein and Davie methods. Consider the stochastic differential equation
d ψ i ( u ) = η i ( u , ψ ( u ) ) d u + k = 1 m μ i k ( u , ψ ( u ) ) d φ k ( u ) , ψ i ( 0 ) = ψ i ( 0 ) ,
where u [ 0 , T ] , ψ ( u ) is an m-dimensional vector, and φ ( u ) is an m-dimensional driving Brownian path. Moreover, the coefficients μ i k ( u , ψ ( u ) ) satisfy the global Lipschitz conditions
η ( u , ν ) η ( u , y ) A ν y
and
μ ( u , ν ) μ ( u , y ) A ν y ,
for all u [ u 0 , T] and ν , y R , where A > 0 is a constant. If η i and μ i are continuous in u, for each ψ , then the Equation (3) has a unique solution ψ ( u ) . This is a process adapted to the filtration induced by Brownian motion. Under these conditions, the solution satisfies E ( ψ ( u ) p ) < for each p [ 1 , ] and u [ 0 , T ] . The standard method for the pathwise approximation of the solution of Equation (3) is to divide [ 0 , T ] into a finite number of N of equal intervals with length h = T / N . The simplest form of such approximation for the SDE by using only the linear term in the Taylor expansion, gives the following Euler–Maruyama scheme
ν i ( j + 1 ) = ν i ( j ) + k = 1 m μ i k ( ν ( j ) ) Δ φ k ( j ) ,
where Δ φ k ( j ) = φ k ( ( j + 1 ) h ) φ k ( j h ) . Now, we represent a scheme that is proposed by Milstein and gives an order one strong Taylor scheme.
ν i ( j + 1 ) = ν i ( j ) + η i ( j h , ν ( j ) ) h + k = 1 m μ i k ( j h , ν ( j ) ) Δ φ k ( j ) + k , l = 1 m ρ i k l ( j h , ν ( j ) ) M k l ( j ) ,
where
Δ φ k ( j ) : = φ k ( ( j + 1 ) h ) φ k ( j h ) , M k l ( j ) : = j h ( j + 1 ) h { φ k ( u ) φ k ( j h ) } d φ l ( u ) ,
and
ρ i k l ( u , ν ) : = m = 1 q μ m k ( u , ν ) μ i l ν m ( u , ν ) .
If the following condition
ρ i k l ( u , ν ) = ρ i l k ( u , ν ) ,
for all ν R m , u [ 0 , T ] and all i , k , l holds, then the Milstein scheme reduces to
ν i ( j + 1 ) = ν i ( j ) + η i ( j h , ν ( j ) ) h + k = 1 m μ i k ( j h , ν ( j ) ) Δ φ k ( j ) + k , l = 1 m ρ i k l ( j h , ν ( j ) ) B k l ( j ) .
This is dependent on the generation of the Brownian motion Δ φ k ( j ) . It can be implemented for the Milstein method using Brownian motion Δ φ k ( j ) and a unique set of equations. This comes from the observation that M k l ( j ) + A l k ( j ) = 2 B k l ( j ) where B k l ( j ) = 1 2 Δ φ k ( j ) Δ φ l ( j ) , for k l and B k k ( j ) = 1 2 { ( Δ φ k ( j ) ) 2 h } . Scheme (7) achieves an order of 1, for m = 1 . However, for the dimension m > 1 , we obtain the order 1 2 . According to Davie’s approximate coupling method, we could modify the previous scheme (7). This gives order one under invertible diffusion conditions.
One can implement the Milstein scheme by separately generating the random variables Δ φ k ( j ) and M k l ( j ) and combining them to obtain the RHS of the scheme (7). According to Davie’s (approximate coupling) method, we attempt to directly generate the following:
Y : = μ i k ( j h , ν ( j ) ) Δ φ k ( j ) + ρ i k l ( j h , ν ( j ) ) M k l ( j ) ,
By replacing Δ φ k ( j ) with ψ k ( j ) , and not assuming Δ φ k ( j ) = ψ k ( j ) , the following scheme
ν i ( j + 1 ) = ν i ( j ) + η i ( j h , ν ( j ) ) h + μ i k ( j h , ν ( j ) ) ψ k ( j ) + ρ i k l ( j h , ν ( j ) ) ( ψ k ( j ) ψ l ( j ) h δ k l ) ,
is the same as (7) with the increment ψ k ( j ) being independent and N ( 0 , h ) being random variables.

2.2. Strong Order of Convergence

A discrete-time approximation ν S with step-size S converges strongly with order γ at time u = N S to the solution ψ ( u ) , if
E | ν S ψ ( u ) | C S γ , S ( 0 , 1 ) .
where S is the step size, which divides the interval [ 0 , T ] into equal length S = u N and ψ ( u ) is the solution to the stochastic differential equation. C is a positive constant and independent of S
Theorem 2.
Assume that μ i k is a twice differentiable invertible matrix, and that μ i k , μ i k and the inverse of the matrix μ i k are bounded. Then
( E | ν i ( j + 1 , 2 r ) ν i ( j , r ) | p ) 2 / p k 2 h 2 e T L ,
where ν i ( j , r ) and ν i ( j + 1 , 2 r ) are defined as
ν i ( j , r + 1 ) = ν i ( j , r ) + k = 1 d μ i k ( ν ( j , r ) ) ν k ( j , r ) + 1 2 k , l = 1 d ρ i k l ( ν ( j , r ) ) ( ν k ( j , r ) ν l ( j , r ) h ( j ) δ k l ) ,
ν i ( j + 1 , 2 r + 1 ) = ν i ( j + 1 , 2 r ) + k = 1 d μ i k ( ν ( j + 1 , 2 r ) ) ν k ( j + 1 , 2 r ) + 1 2 k , l = 1 d ρ i k l ( ν ( j + 1 , 2 r ) ) ( ν k ( j + 1 , 2 r ) ν l ( j + 1 , 2 r ) h ( j + 1 ) δ k l ) ,
and
ν i ( j + 1 , 2 r + 2 ) = ν i ( j + 1 , 2 r + 1 ) + k = 1 d μ i k ( ν ( j + 1 , 2 r + 1 ) ) ν k ( j + 1 , 2 r + 1 ) + 1 2 k , l = 1 d ρ i k l ( ν ( j + 1 , 2 r + 1 ) ) ( ν k ( j + 1 , 2 r + 1 ) ν l ( j + 1 , 2 r + 1 ) h ( j + 1 ) δ k l ) .
Proof. 
Suppose that
max i ( E ( | ν i ( j + 1 , 2 r ) ν i ( j , r ) | p ) ) 2 / p = e r .
Hence,
( E | ν i ( j + 1 , 2 r + 2 ) ν i ( j , r + 1 ) | p ) 2 / p = ( E | ( y ν i ( j , r + 1 ) ) + ( ν i ( j + 1 , 2 r + 2 ) y ) | p ) 2 / p = ( E | ( ν i ( j + 1 , 2 r ) ν i ( j , r ) ) + ( y ν i ( j + 1 , 2 r ) ) ( ν i ( j , r + 1 ) ν i ( j , r ) ) + ( ν i ( j + 1 , 2 r + 2 ) y ) | p ) 2 / p e r + a 1 [ | ( E ( ν i ( j + 1 , 2 r ) ν i ( j , r ) ) | ν i ( j + 1 , 2 r ) ν i ( j , r ) | ( p 2 ) ( y ν i ( j + 1 , 2 r ) ) ( ν i ( j , r + 1 ) ν i ( j , r ) ) + ( ν i ( j + 1 , 2 r + 2 ) y ) ) | ] 2 / p + a 2 [ ( E | ( y ν i ( j + 1 , 2 r ) ) ( ν i ( j , r + 1 ) ν i ( j , r ) ) + ( ν i ( j + 1 , 2 r + 2 ) y ) | p ) ] 2 / p .
It follows from Lemma 3.1 in [35] with ν = ( ν i ( j + 1 , 2 r ) ν i ( j , r ) ) that
Y = ( y ν i ( j + 1 , 2 r ) ) ( ν i ( j , r + 1 ) ν i ( j , r ) ) + ( ν i ( j + 1 , 2 r + 2 ) y ) = ( k = 1 d μ i k ( ν ( j + 1 , 2 r ) ) ν k ( j , r ) + 1 2 k , l = 1 d ρ i k l ( ν ( j + 1 , 2 r ) ) ( ν k ( j , r ) ν l ( j , r ) h ( j ) δ k l ) ) ) ( ( k = 1 d μ i k ( ν ( j , r ) ) ν k ( j , r ) + 1 2 k , l = 1 d ρ i k l ( ν ( j , r ) ) ( ν k ( j , r ) ν l ( j , r ) h ( j ) δ k l ) ) + ( ν i ( j + 1 , 2 r + 2 ) y ) ,
and so
E ( Y | ν ) = E [ ( k = 1 d μ i k ( ν ( j + 1 , 2 r ) ) ν k ( j , r ) + 1 2 k , l = 1 d ρ i k l ( ν ( j + 1 , 2 r ) ) ( ν k ( j , r ) ν l ( j , r ) h ( j ) δ k l ) ) ) ( ( k = 1 d μ i k ( ν ( j , r ) ) ν k ( j , r ) + 1 2 k , l = 1 d ρ i k l ( ν ( j , r ) ) ( ν k ( j , r ) ν l ( j , r ) h ( j ) δ k l ) ) + ( ν i ( j + 1 , 2 r + 2 ) y ) | ( ν i ( j + 1 , 2 r ) ν i ( j , r ) ) ] = 0 .
Thus, we obtain
( E | ν i ( j + 1 , 2 r + 2 ) ν i ( j , r + 1 ) | p ) 2 / p e r + a 2 [ ( E | ( y ν i ( j + 1 , 2 r ) ) ( ν i ( j , r + 1 ) ν i ( j , r ) ) + ( ν i ( j + 1 , 2 r + 2 ) y ) | p ) ] 2 / p e r + a 3 [ ( E | ( y ν i ( j + 1 , 2 r ) ) ( ν i ( j , r + 1 ) ν i ( j , r ) ) | p ] 2 / p + a 4 E [ | ( ν i ( j + 1 , 2 r + 2 ) y ) | p ) ] 2 / p ,
and then
( E | ν i ( j + 1 , 2 r + 2 ) ν i ( j , r + 1 ) | p ) 2 / p = e r + a 3 [ ( E | ( k = 1 d μ i k ( ν ( j + 1 , 2 r ) ) ν k ( j , r ) ( k = 1 d μ i k ( ν ( j , r ) ) ν k ( j , r ) + 1 2 k , l = 1 d ρ i k l ( ν ( j + 1 , 2 r ) ) ( ν k ( j , r ) ν l ( j , r ) h ( j ) δ k l ) ) + 1 2 k , l = 1 d ρ i k l ( ν ( j , r ) ) ( ν k ( j , r ) ν l ( j , r ) h ( j ) δ k l ) ) | p ] 2 / p + a 4 E [ | ( ν i ( j + 1 , 2 r + 2 ) y ) | p ) ] 2 / p .
Therefore, we arrive at
( E | ν i ( j + 1 , 2 r + 2 ) ν i ( j , r + 1 ) | p ) 2 / p e r + a 5 [ E | k = 1 d ( μ i k ( ν ( j , r ) ) μ i k ( ν ( j + 1 , 2 r ) ) ) ν k ( j , r ) | p ] 2 / p + a 6 [ E | 1 2 k , l = 1 d ( ρ i k l ( ν ( j , r ) ) ρ i k l ( ν ( j + 1 , 2 r ) ) ) ( ν k ( j , r ) ν l ( j , r ) h ( j ) δ k l ) | p ] 2 / p + a 4 E [ | ( ν i ( j + 1 , 2 r + 2 ) y ) | p ) ] 2 / p ,
where a 1 , a 2 , a 3 , and a 4 are constants that depend on p. We have that the Lipschitz condition is satisfied because μ i k is twice differentiable and μ i k is bounded. Thus, there exists a constant C > 0 such that
μ i k ( ν ) μ i k ( y ) C ν y
and
μ i k ( ν ) μ i k ( ν ) ν μ i k ( y ) μ i k ( y ) y C ν y ,
for all t [ t 0 , s l T ] and ν , y   R . Hence,
a 3 [ E | k = 1 d ( μ i k ( ν ( j , r ) ) μ i k ( ν ( j + 1 , 2 r ) ) ) ν k ( j , r ) | p ] 2 / p L 2 h e r
and
a 3 [ E | 1 2 k , l = 1 d ( ρ i k l ( ν ( j , r ) ) ρ i k l ( ν ( j + 1 , 2 r ) ) ) ( ν k ( j , r ) ν l ( j , r ) h ( j ) δ k l ) | p ] 2 / p L 1 2 h 2 e r .
It follows from Lemma 4.2 in [35] that
( E | ν i ( j + 1 , 2 r + 2 ) y | p ) 2 / p a p η 4 h 3 .
Now, we assume that | η | 4 is bounded by a constant a 1 . Hence,
( E | ν i ( j + 1 , 2 r + 2 ) ν i ( j , r + 1 ) | p ) 2 / p e r + h L 2 e r + L 1 2 h 2 e r + a p η 4 h 3 .
Therefore, we obtain
e r + 1 e r + h L 2 e r + L 1 2 h 2 e r + a p η 4 h 3 e r + h L 2 e r + L 1 2 h e r + a p η 4 h 3 e r + h L e r + k 1 h 3 ( 1 + h L ) e r + j ,
where j = k 1 h 3 . Since ( r + 1 ) h T for r < N and e 0 = 0 , we obtain
e r j k = 0 r 1 ( 1 + h L ) k j k = 0 N 1 ( 1 + h L ) k = j ( 1 + h L ) N 1 h L = k 1 h 3 ( 1 + h L ) N 1 h L k 2 h 2 e T L .
Thus, the proof is complete.    □

3. Comparison between Milstein and Approximate Coupling Methods

In this section, we present a useful comparison between two methods for solving SDE. Time-consuming and accurate solutions can be an effective procedure for obtaining the approximate solution for different types of methods. To give a clear overview of the methodology as a numerical implementation, we consider a two-dimensional SDE with invertible diffusion. We apply the Milstein and the approximate coupling methods on a particular SDE, so that the comparisons are made numerically. For the Milstein method, we truncate the Fourier series with specific terms, which is enough to give an accurate result. For the approximate coupling method, the diffusion is nondegenerate.
For comparison purposes, we consider the following two-dimensional SDE:
d χ ( t ) = ( sin ( Y ( t ) ) ) 2 d ψ ( t ) 1 1 + χ 2 ( t ) d V ( t ) , d Y ( t ) = 1 1 + Y 4 ( t ) d ψ ( t ) + ( cos ( χ ( t ) ) ) 2 d V ( t ) , for 0 t 1 , with χ ( 0 ) = 2 and Y ( 0 ) = 0 .
φ ( u ) and V ( u ) are both independent standard Brownian motions. Because solutions for SDEs cannot typically be known explicitly, we uitlize approximate solutions to compare the two different methods. We use the absolute error for the different number of steps to calculate the approximation error for each method. We use the same number of simulations for both methods (R = 10,000). We compute R = 10 , 000 different Brownian paths over the interval [ 0 , 1 ] with different step sizes. The experimental error and the elapsed time for the Milstein method are presented in Table 1.
Figure 1 displays the log plot of the absolute error with respect to the five different time steps. We can see that the Milstein scheme converges strongly with order one. We use five different step-sizes ( 0.0025 , 0.0013 , 0.0006 , 0.0003 , 0.00015 ) for both methods. It is clear from Table 1 and Figure 1 that the strong approximation error decreases as the step size decreases.
The strong convergence for the approximate scheme should be an order one convergence as described in Davie’s paper. We run the following MATLAB code with different step sizes over a large number of paths R as follows:
  • [Error for approximate coupling]
  • S=[ 400, 800, 1600, 3200, 6400];
  • Error1=zeros(1,length1(S));
  • for i=1:length1(S)
  • Error1(1,i)=
  • log(approximat2022(’YA’,[1; 0],1,S(1,i)));
  • end
  • h=1./S;
  • fad1=log(h)
  • plot(log(h), Error1)
The approximate coupling method is an alternative to the previous Milstein method. The command Error1(1,i) = log(approximat2022(’YA’,[1; 0],1,S(1,i))) calculates the absolute value of the difference between the approximate solution ν h and the solution ψ ( u ) of the SDE with different step sizes. Table 2 provides the experimental error for each of the five time steps and the elapsed time for the approximate coupling method.
Figure 2 displays the log plot of the absolute error for each of the five time steps. The plot indicates a strong convergence between the approximate coupling method and order one.
Comparing the results in Table 1 and Table 2, we observe in both methods that as step size decreases, the estimate of the absolute error also decreases. We can also observe in the previous tables and plots that the Milstein and approximate coupling methods strongly converge with order one. We emphasize that we applied these methods over the same number of Brownian paths (R = 10,000) for the same step sizes. It can also be seen that using the approximate coupling method can reduce the total computational time. We see from the tables that there is a significant difference between the elapsed time. The Milstein code takes more than two weeks to obtain the result, but the approximate coupling code takes a few hours.

4. Conclusions

Generally, the solution of the stochastic differential equation cannot be known explicitly. Therefore, we use a simulation to find the approximate solution and the convergence behavior. In this paper, we simulated Milstein and the approximate coupling methods in MATLAB to find the approximate solution of the SDE. Both of these methods give an order one convergence. We then implemented these schemes on a stochastic differential equation to compare the Milstein and the approximate coupling methods to each other while illustrating efficiency. Additionally, we calculated error values for the Milstein and the approximate coupling methods to compare the strong order and computation time. According to our results, we can say that the approximate coupling method is faster for the solution of invertible two-dimensional SDEs than the Milstein method. However, the disadvantage of this method is that we should assume the nondegeneracy condition for the diffusion term. The advantage of the Milstein method is that there is no need for this condition, but it involves a significant computational cost. Therefore, we may conclude that the approximate coupling method is more effective than the Milstein method for invertible SDEs. It is interesting to extend the comparisons to include other new methods or equations of higher order.

Funding

The researcher would like to thank the Deanship of Scientific Research, Qassim University for funding the publication of this project.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

There are no competing interests.

References

  1. Kloeden, P.E.; Platen, E. Numerical Solution of Stochastic Differential Equations; Springer: New York, NY, USA, 1995. [Google Scholar]
  2. Komlós, J.; Major, P.; Tusnády, G. An approximation of partial sums of independent RV’s and the sample DF. I. Z. Wahr. und Wer. Gebiete 1975, 32, 111–131. [Google Scholar] [CrossRef]
  3. Klebaner, F. Introduction to Stochastic Calculus with Applications, 3rd ed.; Imperial College Press: London, UK, 2012. [Google Scholar]
  4. Rydén, T.; Wiktrosson, M. On the simulation of iteraled Itô integrals. Stoch. Process. Appl. 2001, 91, 151–168. [Google Scholar] [CrossRef] [Green Version]
  5. Wiktorsson, M. Joint characteristic function and simultaneous simulation of iterated Itô integrals for multiple independent Brownian motions. Ann. Appl. Probab. 2001, 11, 470–487. [Google Scholar] [CrossRef]
  6. Fournier, N. Simulation and approximation of Lévy-driven SDEs. ESIAM Probab. Stat. 2011, 15, 233–248. [Google Scholar] [CrossRef] [Green Version]
  7. Davie, A. Chapter: KMT theory applied to approximations of SDE. In Stochastic Analysis and Applications 2014; Springer: Cham, Switzerland, 2014. [Google Scholar]
  8. Yang, N.; Chen, N.; Wan, X. A new delta expansion for multivariate diffusions via the Itô-Taylor expansion. J. Econom. 2019, 209, 256–288. [Google Scholar] [CrossRef]
  9. Alfonsi, A.; Jourdain, B.; Kohatsu-Higa, A. Pathwise optimal transport bounds between a one-dimensional diffusion and its Euler scheme. Ann. Appl. Probab. 2014, 24, 1049–1080. [Google Scholar] [CrossRef] [Green Version]
  10. Alfonsi, A.; Jourdain, B.; Kohatsu-Higa, A. Optimal transport bounds between the time-marginals of multidimensional diffusion and its Euler scheme. arXiv 2015, arXiv:1405.7007. [Google Scholar] [CrossRef]
  11. Gaines, J.; Lyons, T.J. Random generation of stochastic area integrals. SIAM J. Appl. Math. 2015, 54, 1132–1146. [Google Scholar] [CrossRef]
  12. Malham, S.J.A.; Wiese, A. Efficient almost-exact Lévy area sampling. Stat. Probab. Lett. 2014, 88, 50–55. [Google Scholar] [CrossRef] [Green Version]
  13. Gyöngy, I.; Krylov, N. Existence of strong solutions for Itô’s stochastic equations via approximations. Probab. Theory Relat. Fields 1996, 105, 143–158. [Google Scholar] [CrossRef]
  14. Kloeden, P.E.; Platen, E.; Wright, I. The approximation of multiple stochastic integrals. Stoch. Anal. Appl. 1992, 10, 431–441. [Google Scholar] [CrossRef]
  15. Higham, D. An Algorithmic introduction to numerical simulation of stochastic differential equations. SIAM Rev. 2001, 43, 525–546. [Google Scholar] [CrossRef]
  16. Alnafisah, Y. The exact coupling with trivial coupling (Combined Method) in two-dimensional SDE with non-invertiblity matrix. Dyn. Syst. Appl. 2019, 28, 32. [Google Scholar]
  17. Alnafisah, Y. The implementation of approximate coupling in two-dimensional SDEs with invertible diffusion terms. Appl. Math. J. Chin. Univ. 2020, 35, 166–183. [Google Scholar] [CrossRef]
  18. Kerimkulov, B.; Šiška, D.; Szpruch, L. A modified MSA for stochastic control problems. Appl. Math. Optimizat. 2021, 84, 3417–3436. [Google Scholar] [CrossRef]
  19. Johnston, T.; Sabanis, S. A Strongly Monotonic Polygonal Euler Scheme. arXiv 2021, arXiv:2112.15596. [Google Scholar]
  20. Vaserstein, L.N. Markov processes over denumerable products of spaces describing large system of automata (Russian). Probl. Inf. 1969, 5, 64–72. [Google Scholar]
  21. Alnafisah, Y.; Ahmed, H.M. An experimental implementation for stochastic differential equation using the exact coupling with non-degeneracy diffusion. Dyn. Syst. Appl. 2021, 30, 1105–1115. [Google Scholar]
  22. Yang, H.; Song, M.; Liu, M. Strong convergence and exponential stability of stochastic differential equations with piecewise continuous arguments for non-globally Lipschitz continuous coefficients. Appl. Math. Comput. 2019, 341, 111–127. [Google Scholar] [CrossRef]
  23. Hiroshi, T.; Ken-ichi, Y. Approximation of solutions of multi-dimensional linear stochastic differential equations defined by weakly dependent random variables. AIMS Math. 2017, 2, 377–384. [Google Scholar]
  24. Wang, P.; Xu, Y. Averaging method for neutral stochastic delay differential equations driven by fractional Brownian motion. J. Funct. Space 2020, 2020, 5212690. [Google Scholar] [CrossRef]
  25. Alnafisah, Y. Multilevel MC method for weak approximation of stochastic differential equation with the exact coupling scheme. Open Math. 2022, 20, 305–312. [Google Scholar] [CrossRef]
  26. El-Shahed, M.; Alnafisah, Y. Deterministic and Stochastic Prey–Predator Model for Three Predators and a Single Prey. Axioms 2022, 11, 156. [Google Scholar]
  27. Alnafisah, Y. A new order from the combination of exact coupling and the Euler scheme. AIMS Math. 2022, 7, 6356–6364. [Google Scholar] [CrossRef]
  28. Bahl, R.K.; Sabanis, S. Model-independent price bounds for Catastrophic Mortality Bonds. Insur. Math. Econ. 2021, 96, 276–291. [Google Scholar] [CrossRef]
  29. Jentzen, A.; Rockner, M. A Milstein scheme for SPDEs. arXiv 2018, arXiv:1001.2751. [Google Scholar] [CrossRef]
  30. Guo, Q.; Liu, W.; Mao, X.; Yue, R. The truncated Milstein method for stochastic differential equations with commutative noise. J. Computat. Appl. Math. 2018, 338, 298–310. [Google Scholar] [CrossRef]
  31. Alnafisah, Y. The Implementation of Milstein scheme in two-dimensional SDEs using the Fourier method. Abstr. Appl. Analys. 2018, 2018, 3805042. [Google Scholar] [CrossRef] [Green Version]
  32. Zahri, M. Multidimensional Milstein scheme for solving a stochastic model for prebiotic evolution. J. Taibah Univ. Sci. 2014, 8, 186–198. [Google Scholar] [CrossRef]
  33. Mao, X. The truncated Euler–Maruyama method for stochastic differential equations. J. Comput. Appl. Math. 2015, 290, 370–384. [Google Scholar] [CrossRef] [Green Version]
  34. Davie, A. Pathwise Approximation of Stochastic Differential Equations Using Coupling. Preprint. 2014. Available online: www.maths.ed.ac.uk/~adavie/coum.pdf (accessed on 23 April 2022).
  35. Alnafisah, Y. Order-One Convergence For Exact Coupling Using Derivative Coefficients in the Implementation. Dyn. Syst. Appl. 2019, 28, 573–585. [Google Scholar]
Figure 1. Plot of the Milstein scheme.
Figure 1. Plot of the Milstein scheme.
Fractalfract 06 00339 g001
Figure 2. Plot of approximate coupling.
Figure 2. Plot of approximate coupling.
Fractalfract 06 00339 g002
Table 1. Implementation of the Milstein scheme.
Table 1. Implementation of the Milstein scheme.
StepsStep-SizeAbsolute ErrorElapsed Time (Hour)
14000.00250.06920.126
28000.00130.03530.433
316000.00060.017621.839
432000.000300.0091102.817
564000.0001500.0046261.888
Table 2. Implementation result of approximate coupling method.
Table 2. Implementation result of approximate coupling method.
StepsStep-SizeAbsolute ErrorElapsed Time (Hour)
14000.00250.00290.05805
28000.00130.00150.01163
316000.00060.000750.2325
432000.00030.000360.4664
564000.000150.000180.9344
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Alnafisah, Y. A New Approach to Compare the Strong Convergence of the Milstein Scheme with the Approximate Coupling Method. Fractal Fract. 2022, 6, 339. https://doi.org/10.3390/fractalfract6060339

AMA Style

Alnafisah Y. A New Approach to Compare the Strong Convergence of the Milstein Scheme with the Approximate Coupling Method. Fractal and Fractional. 2022; 6(6):339. https://doi.org/10.3390/fractalfract6060339

Chicago/Turabian Style

Alnafisah, Yousef. 2022. "A New Approach to Compare the Strong Convergence of the Milstein Scheme with the Approximate Coupling Method" Fractal and Fractional 6, no. 6: 339. https://doi.org/10.3390/fractalfract6060339

Article Metrics

Back to TopTop