Motivated by truncated EM method introduced by Mao (2015), a new explicit numerical method named modified truncated Euler-Maruyama method is developed in this paper. Strong convergence rates of the given numerical scheme to the exact solutions to stochastic differential equations are investigated under given conditions in this paper. Compared with truncated EM method, the given numerical simulation strongly converges to the exact solution at fixed time $T$ and over a time interval $[0,T]$ under weaker sufficient conditions. Meanwhile, the convergence rates are also obtained for both cases. Two examples are provided to support our conclusions.
The aim of this paper is to investigate strong convergence of modified truncated Euler-Maruyama method for neutral stochastic differential delay equations introduced in Lan (2018). Strong convergence rates of the given numerical scheme to the exact solutions at fixed time $T$ are obtained under local Lipschitz and Khasminskii-type conditions. Moreover, convergence rates over a time interval $[0,T]$ are also obtained under additional polynomial growth condition on $g$ without the weak monotonicity condition (which is usually the standard assumption to obtain the convergence rate). Two examples …
In this article we establish exponential moment bounds, moment bounds in fractional order smoothness spaces, a uniform Hölder continuity in time, and strong convergence rates for a class of fully discrete exponential Euler-type numerical approximations of infinite dimensional stochastic convolution processes. The considered approximations involve specific taming and truncation terms and are therefore well suited to be used in the context of SPDEs with non-globally Lipschitz continuous nonlinearities.
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to ensure convergence when standard algorithms fail because the expected-value function grows too fast. In this work, we give a self contained proof of a central limit theorem for this algorithm under local assumptions on the expected-value function, which are fairly easy to check in practice.
In this paper, we study a class of super-linear stochastic differential delay equations with Poisson jumps (SDDEwPJs). The convergence and rate of the convergence of the truncated Euler-Maruyama numerical solutions to SDDEwPJs are investigated under the generalized Khasminskii-type condition.
This paper focuses on the strong convergence of the truncated $θ$-Milstein method for a class of nonautonomous stochastic differential delay equations whose drift and diffusion coefficients can grow polynomially. The convergence rate, which is close to one, is given under the weaker assumption than the monotone condition. To verify our theoretical findings, we present a numerical example.
The truncated Milstein method, which was initially proposed in (Guo, Liu, Mao and Yue 2018), is extended to the non-autonomous stochastic differential equations with the super-linear state variable and the Hölder continuous time variable. The convergence rate is proved. Compared with the initial work, the requirements on the step-size is also significantly released. In addition, the technique of the randomized step-size is employed to raise the convergence rate of the truncated Milstein method.
An explicit numerical method is developed for a class of non-autonomous time-changed stochastic differential equations, whose coefficients obey Hölder's continuity in terms of the time variables and are allowed to grow super-linearly in terms of the state variables. The strong convergence of the method in the finite time interval is proved and the convergence rate is obtained. Numerical simulations are provided.
In the analysis of Markov chains and processes, it is sometimes convenient to replace an unbounded state space with a "truncated" bounded state space. When such a replacement is made, one often wants to know whether the equilibrium behavior of the truncated chain or process is close to that of the untruncated system. For example, such questions arise naturally when considering numerical methods for computing stationary distributions on unbounded state space. In this paper, we study general truncation-augmentation schemes, in which the substochastic truncated "northwest corner" of the transitio…
We combine the rough path theory and stochastic backward error analysis to develop a new framework for error analysis on numerical schemes. Based on our approach, we prove that the almost sure convergence rate of the modified Milstein scheme for stochastic differential equations driven by multiplicative multidimensional fractional Brownian motion with Hurst parameter $H\in(\frac14,\frac12)$ is $(2H-\frac12)^-$ for sufficiently smooth coefficients, which is optimal in the sense that it is consistent with the result of the corresponding implementable approximation of the Lévy area of fractional …
