Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1009.3767

A micro/macro algorithm to accelerate Monte Carlo simulation of stochastic differential equations

Kristian Debrabant·Giovanni Samaey
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present and analyze a micro/macro acceleration technique for the Monte Carlo simulation of stochastic differential equations (SDEs) in which there is a separation between the (fast) time-scale on which individual trajectories of the SDE need to be simulated and the (slow) time-scale on which we want to observe the (macroscopic) function of interest. The method performs short bursts of microscopic simulation using an ensemble of SDE realizations, after which the ensemble is restricted to a number of macroscopic state variables. The resulting macroscopic state is then extrapolated forward in time and the ensemble is projected onto the extrapolated macroscopic state. We provide a first analysis of its convergence in terms of extrapolation time step and number of macroscopic state variables. The effects of the different approximations on the resulting error are illustrated via numerical experiments.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kristian Debrabant, Giovanni Samaey. 2011-11-05. A micro/macro algorithm to accelerate Monte Carlo simulation of stochastic differential equations. https://arxiv.org/abs/1009.3767

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗