arXiv subjects

Kristian Debrabant

Publications and source records attributed to Kristian Debrabant.

At least 19 recordsLinked to original sources

arXiv2026

Derivation of optimal stochastic Runge-Kutta methods with exotic and decorated Butcher series for the weak integration of stochastic dynamics

The design of numerical integrators for solving stochastic dynamics with high weak order relies on tedious calculations and is subject to a high number of order conditions. The original approaches from the literature consider strong approximations and adapt them for the weak approximation by replacing the iterated stochastic integrals by appropriate random variables. The methods obtained this way are sub-optimal in their number of function evaluations and the analysis of order conditions is unnecessarily complicated. We provide in this paper a novel approach, relying on well-chosen sets of random Runge-Kutta coefficients, that greatly reduce the number of order conditions. The approach is successfully applied to the creation of a collection of new stochastic Runge-Kutta methods of second weak order with an optimal number of function evaluations and a smaller number of random variables. The efficiency of the new methods is confirmed with numerical experiments and a modern algebraic approach using Hopf algebras is provided for the derivation and the study of the order conditions.

math.NA↗

arXiv2024

Exponential Euler method for stiff stochastic differential equations with additive fractional Brownian noise

We discuss a system of stochastic differential equations with a stiff linear term and additive noise driven by fractional Brownian motions (fBms) with Hurst parameter H>1/2, which arise e. g., from spatial approximations of stochastic partial differential equations. For their numerical approximation, we present an exponential Euler scheme and show that it converges in the strong sense with an exact rate close to the Hurst parameter H. Further, based on (E. Buckwar, M.G. Riedler, and P.E. Kloeden 2011), we conclude the existence of a unique stationary solution of the exponential Euler scheme that is pathwise asymptotically stable.

math.PR↗

arXiv2024

B-series for SDEs with application to exponential integrators for non-autonomous semi-linear problems

In this paper a set of previous general results for the development of B--series for a broad class of stochastic differential equations has been collected. The applicability of these results is demonstrated by the derivation of B--series for non-autonomous semi-linear SDEs and exponential Runge-Kutta methods applied to this class of SDEs, which is a significant generalization of existing theory on such methods.

math.NA↗

arXiv2022

A Comparison of Different Approaches to Dynamic Origin-Destination Matrix Estimation in Urban Traffic

Given the counters of vehicles that traverse the roads of a traffic network, we reconstruct the travel demand that generated them expressed in terms of the number of origin-destination trips made by users. We model the problem as a bi-level optimization problem. At the inner-level, given a tentative demand, we solve a Dynamic Traffic Assignment (DTA) problem to decide the routing of the users between their origins and destinations. Finally, we adjust the number of trips and their origins and destinations at the outer-level to minimize the discrepancy between the counters generated at the inner-level and the given vehicle counts measured by sensors in the traffic network. We solve the DTA problem by employing a mesoscopic model implemented by the traffic simulator SUMO. Thus, the outer problem becomes an optimization problem that minimizes a black-box Objective Function (OF) determined by the results of the simulation, which is a costly computation. We study different approaches to the outer-level problem categorized as gradient-based and derivative-free approaches. Among the gradient-based approaches, we look at an assignment matrix-based approach and an assignment matrix-free approach that uses the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm. Among the derivative-free approaches, we investigate Machine Learning (ML) algorithms to learn a model of the simulator that can then be used as a surrogate OF in the optimization problem. We compare these approaches computationally on an artificial network. The gradient-based approaches perform the best in terms of solution quality and computational requirements. In contrast, the results obtained by the ML approach are currently less satisfactory but provide an interesting avenue for future research.

math.OC↗

arXiv2021

Lawson schemes for highly oscillatory stochastic differential equations and conservation of invariants

In this paper, we consider a class of stochastic midpoint and trapezoidal Lawson schemes for the numerical discretization of highly oscillatory stochastic differential equations. These Lawson schemes incorporate both the linear drift and diffusion terms in the exponential operator. We prove that the midpoint Lawson schemes preserve quadratic invariants and discuss this property as well for the trapezoidal Lawson scheme. Numerical experiments demonstrate that the integration error for highly oscillatory problems is smaller than that of some standard methods.

math.NA↗

arXiv2020

Runge-Kutta Lawson schemes for stochastic differential equations

In this paper, we present a framework to construct general stochastic Runge-Kutta Lawson schemes. We prove that the schemes inherit the consistency and convergence properties of the underlying Runge-Kutta scheme, and confirm this in some numerical experiments. We also investigate the stability properties of the methods and show for some examples, that the new schemes have improved stability properties compared to the underlying schemes.

math.NA↗

arXiv2020

High order numerical integrators for single integrand Stratonovich SDEs

We show that applying any deterministic B-series method of order $p_d$ with a random step size to single integrand SDEs gives a numerical method converging in the mean-square and weak sense with order $\lfloor p_d/2\rfloor$.As an application, we derive high order energy-preserving methods for stochastic Poisson systems as well as further geometric numerical schemes for this wide class of Stratonovich SDEs.

math.NA↗

arXiv2020

Backward Differentiation Formula finite difference schemes for diffusion equations with an obstacle term

Finite difference schemes, using Backward Differentiation Formula (BDF), are studied for the approximation of one-dimensional diffusion equations with an obstacle term, of the form $$\min(v_t - a(t,x) v_{xx} + b(t,x) v_x + r(t,x) v, v- φ(t,x))= f(t,x).$$ For the scheme building on the second order BDF formula (BDF2), we discuss unconditional stability, prove an $L^2$-error estimate and show numerically second order convergence, in both space and time, unconditionally on the ratio of the mesh steps. In the analysis, an equivalence of the obstacle equation with a Hamilton-Jacobi-Bellman equation is mentioned, and a Crank-Nicolson scheme is tested in this context. Two academic problems for parabolic equations with an obstacle term with explicit solutions and the American option problem in mathematical finance are used for numerical tests.

math.NA↗

arXiv2020

Study of micro-macro acceleration schemes for linear slow-fast stochastic differential equations with additive noise

Computational multi-scale methods capitalize on a large time-scale separation to efficiently simulate slow dynamics over long time intervals. For stochastic systems, one often aims at resolving the statistics of the slowest dynamics. This paper looks at the efficiency of a micro-macro acceleration method that couples short bursts of stochastic path simulation with extrapolation of spatial averages forward in time. To have explicit derivations, we elicit an amenable linear test equation containing multiple time scales. We make derivations and perform numerical experiments in the Gaussian setting, where only the evolution of mean and variance matters. The analysis shows that, for this test model, the stability threshold on the extrapolation step is largely independent of the time-scale separation. In consequence, the micro-macro acceleration method increases the admissible time steps far beyond those for which a direct time discretization becomes unstable.

math.NA↗

arXiv2018

Weak Antithetic MLMC Estimation of SDEs with the Milstein scheme for Low-Dimensional Wiener Processes

In this paper, we implement a weak Milstein Scheme to simulate low-dimensional stochastic differential equations (SDEs). We prove that combining the antithetic multilevel Monte-Carlo (MLMC) estimator introduced by Giles and Szpruch with the MLMC approach for weak SDE approximation methods by Belomestny and Nagapetyan, we can achieve a quadratic computational complexity in the inverse of the Root Mean Square Error (RMSE) when estimating expected values of smooth functionals of SDE solutions, without simulating Levy areas and without requiring any strong convergence of the underlying SDE approximation method. By using appropriate discrete variables this approach allows us to calculate the expectation on the coarsest level of resolution by enumeration, which results in a reduced computational effort compared to standard MLMC sampling. These theoretical results are also confirmed by a numerical experiment.

math.NA↗

arXiv2018

Stochastic B-series and order conditions for exponential integrators

We discuss stochastic differential equations with a stiff linear part and their approximation by stochastic exponential integrators. Representing the exact and approximate solutions using B-series and rooted trees, we derive the order conditions for stochastic exponential integrators. The resulting general order theory covers both It\^{o} and Stratonovich integration.

math.NA↗

arXiv2017

General order conditions for stochastic partitioned Runge-Kutta methods

In this paper stochastic partitioned Runge-Kutta (SPRK) methods are considered. A general order theory for SPRK methods based on stochastic B-series and multicolored, multishaped rooted trees is developed. The theory is applied to prove the order of some known methods, and it is shown how the number of order conditions can be reduced in some special cases, especially that the conditions for preserving quadratic invariants can be used as simplifying assumptions.

math.NA↗

arXiv2015

Cheap arbitrary high order methods for single integrand SDEs

For a particular class of Stratonovich SDE problems, here denoted as single integrand SDEs, we prove that by applying a deterministic Runge-Kutta method of order $p_d$ we obtain methods converging in the mean-square and weak sense with order $\lfloor p_d/2\rfloor$. The reason is that the B-series of the exact solution and numerical approximation are, due to the single integrand and the usual rules of calculus holding for Stratonovich integration, similar to the ODE case. The only difference is that integration with respect to time is replaced by integration with respect to the measure induced by the single integrand SDE.

math.NA↗

arXiv2015

A micro-macro acceleration method for the Monte Carlo simulation of stochastic differential equations

We present and analyse a micro-macro acceleration method for the Monte Carlo simulation of stochastic differential equations with separation between the (fast) time-scale of individual trajectories and the (slow) time-scale of the macroscopic function of interest. The algorithm combines short bursts of path simulations with extrapolation of a number of macroscopic state variables forward in time. The new microscopic state, consistent with the extrapolated variables, is obtained by a matching operator that minimises the perturbation caused by the extrapolation. We provide a proof of the convergence of this method, in the absence of statistical error, and we analyse various strategies for matching, as an operator on probability measures. Finally, we present numerical experiments that illustrate the effects of the different approximations on the resulting error in macroscopic predictions.

math.NA↗

arXiv2014

On the Acceleration of the Multi-Level Monte Carlo Method

The multi-level Monte Carlo method proposed by M. Giles (2008) approximates the expectation of some functionals applied to a stochastic process with optimal order of convergence for the mean-square error. In this paper, a modified multi-level Monte Carlo estimator is proposed with significantly reduced computational costs. As the main result, it is proved that the modified estimator reduces the computational costs asymptotically by a factor $(p/α)^2$ if weak approximation methods of orders $α$ and $p$ are applied in case of computational costs growing with same order as variances decay.

math.PR↗

arXiv2014

Semi-Lagrangian schemes for linear and fully non-linear Hamilton-Jacobi-Bellman equations

We consider the numerical solution of Hamilton-Jacobi-Bellman equations arising in stochastic control theory. We introduce a class of monotone approximation schemes relying on monotone interpolation. These schemes converge under very weak assumptions, including the case of arbitrary degenerate diffusions. Besides providing a unifying framework that includes several known first order accurate schemes, stability and convergence results are given, along with two different robust error estimates. Finally, the method is applied to a super-replication problem from finance.

math.NA↗

arXiv2013

Diagonally drift-implicit Runge-Kutta methods of weak order one and two for It\^o SDEs and stability analysis

The class of stochastic Runge-Kutta methods for stochastic differential equations due to R\"o{\ss}ler is considered. Coefficient families of diagonally drift-implicit stochastic Runge-Kutta (DDISRK) methods of weak order one and two are calculated. Their asymptotic stability as well as mean-square stability (MS-stability) properties are studied for a linear stochastic test equation with multiplicative noise. The stability functions for the DDISRK methods are determined and their domains of stability are compared to the corresponding domain of stability of the considered test equation. Stability regions are presented for various coefficients of the families of DDISRK methods in order to determine step size restrictions such that the numerical approximation reproduces the characteristics of the solution process.

math.NA↗

arXiv2013

Families of efficient second order Runge-Kutta methods for the weak approximation of It\^o stochastic differential equations

Recently, a new class of second order Runge-Kutta methods for It\^o stochastic differential equations with a multidimensional Wiener process was introduced by R\"o{\ss}ler. In contrast to second order methods earlier proposed by other authors, this class has the advantage that the number of function evaluations depends only linearly on the number of Wiener processes and not quadratically. In this paper, we give a full classification of the coefficients of all explicit methods with minimal stage number. Based on this classification, we calculate the coefficients of an extension with minimized error constant of the well-known RK32 method to the stochastic case. For three examples, this method is compared numerically with known order two methods and yields very promising results.

math.NA↗