求解随机微分方程的二级Milstein方法(英文)

In this paper we discuss two-stage Miistein methods for solving Ito stochastic differential equations （SDEs）. Six fully explicit methods （TSM 1 -- TSM 6） are given in this paper. Their order of strong convergence is proved. The stability properties and numerical results show the effectiveness of these methods in the pathwise approximation of Ito SDEs.     

The Milstein Scheme for Stochastic Delay Differential Equations Without Using Anticipative Calculus

The Milstein scheme is the simplest nontrivial numerical scheme for stochastic differential equations with a strong order of convergence one. The scheme has been extended to the stochastic delay differential equations but the analysis of the convergence is technically complicated due to anticipative integrals in the remainder terms. This article employs an elementary method to derive the Milstein scheme and its first order strong rate of convergence for stochastic delay differential equations.     

Exact linearization of one dimensional Itô equations driven by fBm: Analytical and numerical solutions

Necessary and sufficient conditions for the linearization of the one-dimensional Itô stochastic differential equations driven by fractional Brownian motion (fBm) are given. Stochastic integrating factor has been introduced. A modified Milstein method has been developed to obtain numerical solutions. Analytical solutions have been compared with the numerical solutions for linearizable equations.     

Monte Carlo Simulation of Stochastic Differential Equation to Study Information Geometry

Information Geometry is a useful tool to study and compare the solutions of a Stochastic Differential Equations (SDEs) for non-equilibrium systems. As an alternative method to solving the Fokker–Planck equation, we propose a new method to calculate time-dependent probability density functions (PDFs) and to study Information Geometry using Monte Carlo (MC) simulation of SDEs. Specifically, we develop a new MC SDE method to overcome the challenges in calculating a time-dependent PDF and information geometric diagnostics and to speed up simulations by utilizing GPU computing. Using MC SDE simulations, we reproduce Information Geometric scaling relations found from the Fokker–Planck method for the case of a stochastic process with linear and cubic damping terms. We showcase the advantage of MC SDE simulation over FPE solvers by calculating unequal time joint PDFs. For the linear process with a linear damping force, joint PDF is found to be a Gaussian. In contrast, for the cubic process with a cubic damping force, joint PDF exhibits a bimodal structure, even in a stationary state. This suggests a finite memory time induced by a nonlinear force. Furthermore, several power-law scalings in the characteristics of bimodal PDFs are identified and investigated.     

CONVERGENCE ANALYSIS OF PARAREAL ALGORITHM BASED ON MILSTEIN SCHEME FOR STOCHASTIC DIFFERENTIAL EQUATIONS

In this paper, we propose a parareal algorithm for stochastic differential equations (SDEs), which proceeds as a two-level temporal parallelizable integrator with the Milstein scheme as the coarse propagator and the exact solution as the fine propagator. The convergence order of the proposed algorithm is analyzed under some regular assumptions. Finally, numerical experiments are dedicated to illustrating the convergence and the convergence order with respect to the iteration number $k$, which show the efficiency of the proposed method.     

随机延迟微分方程的Milstein方法的非线性均方稳定性

本文针对一般的非线性随机延迟微分方程,证明了当系统理论解满足均方稳定性条件时,则当方程的漂移和扩散项满足一定的条件时,Milstein方法也是均方稳定的.数学实验进一步验证了我们的结论.     

The tamed Milstein method for commutative stochastic differential equations with non-globally Lipschitz continuous coefficients

For stochastic differential equations (SDEs) with a superlinearly growing and globally one-sided Lipschitz continuous drift coefficient, the classical explicit Euler scheme fails to converge strongly to the exact solution. Recently, an explicit strongly convergent numerical scheme, called the tamed Euler method, has been proposed in [8] for such SDEs. Motivated by their work, we here introduce a tamed version of the Milstein scheme for SDEs with commutative noise. The proposed method is also explicit and easily implementable, but achieves higher strong convergence order than the tamed Euler method does. In recovering the strong convergence order one of the new method, new difficulties arise and kind of a bootstrap argument is developed to overcome them. Finally, an illustrative example confirms the computational efficiency of the tamed Milstein method compared to the tamed Euler method.     

随机延迟微分方程的Milstein方法的均方稳定性

研究随机延迟微分方程(stochastic delay differential equations)的数值求解问题,将改造后的Milstein方法用于求解此类问题,精度较高.对一切满足理论解均方(Mean-Square)稳定的系统,事实证明由上述方法离散得到的数值解不需任何附加条件即可保持与系统相同的稳定性.数值实验也直观地验证了所得的结论.     

Weak antithetic MLMC estimation of SDEs with the Milstein scheme for low-dimensional Wiener processes

In this paper, we implement a weak Milstein Scheme to simulate low-dimensional stochastic differential equations (SDEs). We prove that combining the antithetic multilevel Monte-Carlo (MLMC) estimator introduced by Giles and Szpruch with the MLMC approach for weak SDE approximation methods by Belomestny and Nagapetyan, we can achieve a quadratic computational complexity in the inverse of the Root Mean Square Error (RMSE) when estimating expected values of smooth functionals of SDE solutions, without simulating Lévy areas and without requiring any strong convergence of the underlying SDE approximation method. By using appropriate discrete variables this approach allows us to calculate the expectation on the coarsest level of resolution by enumeration, which, for low-dimensional problems, results in a reduced computational effort compared to standard MLMC sampling. These theoretical results are also confirmed by a numerical experiment.