Related papers: A note on convergence and stability of the truncat…
Stochastic differential equations are often simulated with the Monte Carlo Euler method. Convergence of this method is well understood in the case of globally Lipschitz continuous coefficients of the stochastic differential equation. The…
We derive first-order (in the stepsize) bounds on the bias in Wasserstein distances of the invariant measure of stochastic gradient kinetic Langevin dynamics with minimal assumptions on the stochastic gradient noise. These bounds sharpen…
In this work it is shown how the immersed boundary method of (Peskin2002) for modeling flexible structures immersed in a fluid can be extended to include thermal fluctuations. A stochastic numerical method is proposed which deals with…
Lattice Boltzmann schemes are efficient numerical methods to solve a broad range of problems under the form of conservation laws. However, they suffer from a chronic lack of clear theoretical foundations. In particular, the consistency…
We investigate the error of the randomized Milstein algorithm for solving scalar jump-diffusion stochastic differential equations. We provide a complete error analysis under substantially weaker assumptions than known in the literature. In…
This study presents an efficient, accurate, effective and unconditionally stable time stepping scheme for the Darcy-Brinkman equations in double-diffusive convection. The stabilization within the proposed method uses the idea of stabilizing…
This work focuses on the numerical approximations of neutral stochastic delay differential equations with their drift and diffusion coefficients growing super-linearly with respect to both delay variables and state variables. Under…
The paper is focused on the nonlinear stability analysis of stochastic $\theta$-methods. In particular, we consider nonlinear stochastic differential equations such that the mean-square deviation between two solutions exponentially decays,…
Many relevant problems in the area of systems and control, such as controller synthesis, observer design and model reduction, can be viewed as optimization problems involving dynamical systems: for instance, maximizing performance in the…
We consider the pricing and the sensitivity calculation of continuously monitored barrier options. Standard Monte Carlo algorithms work well for pricing these options. Therefore they do not behave stable with respect to numerical…
Simulation from the truncated multivariate normal distribution in high dimensions is a recurrent problem in statistical computing, and is typically only feasible using approximate MCMC sampling. In this article we propose a minimax tilting…
This report considers a variable step time discretization algorithm proposed by Dahlquist, Liniger and Nevanlinna and applies the algorithm to the unsteady Stokes/Darcy model. Although long-time forgotten and little explored, the algorithm…
We prove the first convergence guarantees for a subgradient method minimizing a generic Lipschitz function over generic Lipschitz inequality constraints. No smoothness or convexity (or weak convexity) assumptions are made. Instead, we…
Recent results in the literature provide computational evidence that stabilized semi-implicit time-stepping method can efficiently simulate phase field problems involving fourth-order nonlinear dif- fusion, with typical examples like the…
We propose a novel study of the stochastic proximal gradient method for minimizing the sum of two convex functions, one of which is smooth. Under suitable assumptions and without requiring any boundedness or control of the variance of the…
An implicit Euler--Maruyama method with non-uniform step-size applied to a class of stochastic partial differential equations is studied. A spectral method is used for the spatial discretization and the truncation of the Wiener process. A…
Previously, the authors derived an analog of the Euler-Maru\-yama method (fEMM) for free stochastic differential equations (fSDEs) and proved strong convergence of order $\gamma=0.5$ in $L_1(\varphi)$-norm under certain assumptions. In this…
In this invited contribution, we revisit the stochastic shortest path problem, and show how recent results allow one to improve over the classical solutions: we present algorithms to synthesize strategies with multiple guarantees on the…
This paper introduces a new algorithm for numerically computing equilibrium (i.e. stationary) distributions for Markov chains and Markov jump processes with either a very large finite state space or a countably infinite state space. The…
Gradient information on the sampling distribution can be used to reduce the variance of Monte Carlo estimators via Stein's method. An important application is that of estimating an expectation of a test function along the sample path of a…