Related papers: Numerical schemes for $G$--Expectations
In this paper, we consider a fundamental class of stochastic differential equations with time delays. Our aim is to investigate the weak convergence with respect to delay parameter of the solutions. Based on the techniques of Malliavin…
In this article, we study the rate of convergence of prices when a model is approximated by some simplified model. We also provide a method how explicit error formula for more general options can be obtained if such formula is available for…
This paper considers the numerical treatment of the time-dependent Gross-Pitaevskii equation. In order to conserve the time invariants of the equation as accurately as possible, we propose a Crank-Nicolson-type time discretization that is…
The paper studies an improved estimate for the rate of convergence for nonlinear homogeneous discrete-time Markov chains. These processes are nonlinear in terms of the distribution law. Hence, the transition kernels are dependent on the…
We present a numerical method for convergence acceleration for multifidelity models of parameterized ordinary differential equations. The hierarchy of models is defined as trajectories computed using different timesteps in a time…
The rates of strong convergence for various approximation schemes are investigated for a class of stochastic differential equations (SDEs) which involve a random time change given by an inverse subordinator. SDEs to be considered are unique…
The objective of this paper is to prove the convergence of a linear implicit multi-step numerical method for ordinary differential equations. The algorithm is obtained via Taylor approximations. The convergence is proved following the…
We consider a class of stochastic gradient optimization schemes. Assuming that the objective function is strongly convex, we prove weak error estimates which are uniform in time for the error between the solution of the numerical scheme,…
We consider systems of stochastic evolutionary equations of the $p$-Laplace type. We establish convergence rates for a finite-element based space-time approximation, where the error is measured in a suitable quasi-norm. Under natural…
We introduce an explicit, adaptive time-stepping scheme for the simulation of SPDEs with one-sided Lipschitz drift coefficients. Strong convergence rates are proven for the full space-time discretisation with multiplicative trace-class…
This paper investigates a numerical probabilistic method for the solution of some semilinear stochastic partial differential equations (SPDEs in short). The numerical scheme is based on discrete time approximation for solutions of systems…
In this article, we analyze three classes of time-reversal of a Markov process with Gaussian noise on a manifold. We first unveil a commutativity constraint for the most general of these time-reversals to be well defined. Then we give a…
We study a discrete-in-time data-assimilation algorithm based on nudging through a time-delayed feedback control in which the observational measurements have been contaminated by a Gaussian noise process. In the context of the…
In a previous paper, an implementable algorithm was introduced to compute discrete solutions of sweeping processes (i.e. specific first order differential inclusions). The convergence of this numerical scheme was proved thanks to…
Stochastic gradient descent (SGD) is the workhorse of large-scale learning, yet classical analyses rely on assumptions that can be either too strong (bounded variance) or too coarse (uniform noise). The expected smoothness (ES) condition…
Given the discrete-time sequence of nonnegative random variables, general dependencies between the exponential convergence of the expectations, exponential convergence of the trajectories and the logarithmic growth of the corresponding…
In this paper, we propose and analyze an adaptive time-stepping fully discrete scheme which possesses the optimal strong convergence order for the stochastic nonlinear Schr\"odinger equation with multiplicative noise. Based on the splitting…
The work [8] established memory loss in the time-dependent (non-random) case of uniformly expanding maps of the interval. Here we find conditions under which we have convergence to the normal distribution of the appropriately scaled…
This paper focuses on providing the computation methods for the backward time tempered fractional Feynman-Kac equation, being one of the models recently proposed in [Wu, Deng, and Barkai, Phys. Rev. E, 84 (2016) 032151]. The discretization…
We carry out a stability and convergence analysis of a fully discrete scheme for the time-dependent Navier-Stokes equations resulting from combining an $H(\mathrm{div}, \Omega)$-conforming discontinuous Galerkin spatial discretization, and…