@Article{JCM-28-2,
author = {},
title = {Chebyshev Methods with Discrete Noise: The $\tau$-ROCK Methods},
journal = {Journal of Computational Mathematics},
year = {2010},
volume = {28},
number = {2},
pages = {195--217},
abstract = {<p style="text-align: justify;">Stabilized or Chebyshev explicit methods have been widely used in the past to solve stiff ordinary differential equations. Making use of special properties of Chebyshev-like polynomials, these methods have favorable stability properties compared to standard explicit methods while remaining explicit. A new class of such methods, called ROCK, introduced in [Numer. Math., 90, 1-18, 2001] has recently been extended to stiff stochastic differential equations under the name S-ROCK [C. R. Acad. Sci. Paris, 345(10), 2007 and Commun. Math. Sci, 6(4), 2008]. In this paper we discuss the extension of the S-ROCK methods to systems with discrete noise and propose a new class of methods for such problems, the $\tau$-ROCK methods. One motivation for such methods is the simulation of multi-scale or stiff chemical kinetic systems and such systems are the focus of this paper, but our new methods could potentially be interesting for other stiff systems with discrete noise. Two versions of the $\tau$-ROCK methods are discussed and their stability behavior is analyzed on a test problem. Compared to the $\tau$-leaping method, a significant speed-up can be achieved for some stiff kinetic systems. The behavior of the proposed methods are tested on several numerical experiments.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.2009.10-m1004},
url = {https://global-sci.com/article/84803/chebyshev-methods-with-discrete-noise-the-tau-rock-methods}
}