Order-one strong convergence of numerical methods for SDEs without globally monotone coefficients (2401.00385v1)

Abstract: To obtain strong convergence rates of numerical schemes, an overwhelming majority of existing works impose a global monotonicity condition on coefficients of SDEs. On the contrary, a majority of SDEs from applications do not have globally monotone coefficients. As a recent breakthrough, the authors of [Hutzenthaler, Jentzen, Ann. Probab., 2020] originally presented a perturbation theory for stochastic differential equations (SDEs), which is crucial to recovering strong convergence rates of numerical schemes in a non-globally monotone setting. However, only a convergence rate of order $1/2$ was obtained there for time-stepping schemes such as a stopped increment-tamed Euler-Maruyama (SITEM) method. As an open problem, a natural question was raised by the aforementioned work as to whether higher convergence rate than $1/2$ can be obtained when higher order schemes are used. The present work attempts to solve the tough problem. To this end, we develop some new perturbation estimates that are able to reveal the order-one strong convergence of numerical methods. As the first application of the newly developed estimates, we identify the expected order-one pathwise uniformly strong convergence of the SITEM method for additive noise driven SDEs and multiplicative noise driven second order SDEs with non-globally monotone coefficients. As the other application, we propose and analyze a positivity preserving explicit Milstein-type method for Lotka-Volterra competition model driven by multi-dimensional noise, with a pathwise uniformly strong convergence rate of order one recovered under mild assumptions. These obtained results are completely new and significantly improve the existing theory. Numerical experiments are also provided to confirm the theoretical findings.