In this paper, we introduce a new class of explicit numerical methods called the tamed stochastic Runge-Kutta-Chebyshev (t-SRKC) methods, which apply the idea of taming to the stochastic Runge-Kutta-Chebyshev (SRKC) methods.The key advantage of our explicit methods is that they can be suitable for stochastic differential equations with non-globally Lipschitz coefficients and stiffness.Under certain non-globally Lipschitz conditions, we study the strong convergence of our methods and prove that the order of strong convergence is 1/2.To show the advantages of our methods, we compare them with some existing explicit methods (including the Euler-Maruyama method, balanced Euler-Maruyama method and two types of SRKC methods) through several numerical examples.The numerical results show that our t-SRKC methods are efficient, especially for stiff stochastic differential equations.
No takes yet. Share an insight, caveat, or question.
Yu et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: