Related papers: A technique for studying strong and weak local err…
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…
We show that without other further assumption than affine equivariance and locality, a numerical integrator has an expansion in a generalized form of Butcher series (B-series) which we call aromatic B-series. We obtain an explicit…
We explore the applicability of splitting methods involving complex coefficients to solve numerically the time-dependent Schr\"odinger equation. We prove that a particular class of integrators are conjugate to unitary methods for…
Splitting methods constitute a widely used class of numerical integrators for ordinary and partial differential equations, particularly well suited to problems that can be decomposed into simpler subproblems. High-order splitting schemes…
In this work, we explore the use of operator splitting algorithms for solving regularized structural topology optimization problems. The context is the classical structural design problems (e.g., compliance minimization and compliant…
Particle splitting methods are considered for the estimation of rare events. The probability of interest is that a Markov process first enters a set $B$ before another set $A$, and it is assumed that this probability satisfies a large…
We study numerical methods for the generalized Langevin equation (GLE) with a positive Prony series memory kernel, in which case the GLE can be written in an extended variable Markovian formalism. We propose a new splitting method that is…
We propose a new algorithm---Stochastic Proximal Langevin Algorithm (SPLA)---for sampling from a log concave distribution. Our method is a generalization of the Langevin algorithm to potentials expressed as the sum of one stochastic smooth…
Efficient high order numerical methods for evolving the solution of an ordinary differential equation are widely used. The popular Runge--Kutta methods, linear multi-step methods, and more broadly general linear methods, all have a global…
We consider Lie and Strang splitting for the time integration of constrained partial differential equations with a nonlinear reaction term. Since such systems are known to be sensitive with respect to perturbations, the splitting procedure…
A practical and new Runge--Kutta numerical scheme for stochastic differential equations is explored. Numerical examples demonstrate the strong convergence of the method. The first order strong convergence is then proved using Ito integrals…
Recently, a novel method based on coding partitions [1]-[4] has been used to derive power series expansions to previously intractable problems. In this method the coefficients at $k$ are determined by summing the contributions made by each…
The article is devoted to comparison of the Milstein expansion of iterated Stratonovich stochastic integrals with the method of expansion of iterated stochastic integrals based on generalized multiple Fourier series. We consider some…
Time-series classification has attracted considerable research attention due to the various domains where time-series data are observed, ranging from medicine to econometrics. Traditionally, the focus of time-series classification has been…
We study the strong convergence of some operator-splitting methods for the Langevin dynamics model with additive noise. It will be shown that a direct splitting of deterministic and random terms, including the symmetric splitting methods,…
We develop a toolbox for the error analysis of linear recurrences with constant or polynomial coefficients, based on generating series, Cauchy's method of majorants, and simple results from analytic combinatorics. We illustrate the power of…
Time series classification is an application of particular interest with the increase of data to monitor. Classical techniques for time series classification rely on point-to-point distances. Recently, Bag-of-Words approaches have been used…
In this paper is described a general 2-nd order accurate (weak sense) procedure for stablizing Monte-Carlo simulations of Ito stochastic differential equations. The splitting procedure includes explicit Runge-Kutta methods, semi-implicit…
Time series classification (TSC) is the problem of learning labels from time dependent data. One class of algorithms is derived from a bag of words approach. A window is run along a series, the subseries is shortened and discretised to form…
The explicit split-operator algorithm is often used for solving the linear and nonlinear time-dependent Schr\"{o}dinger equations. However, when applied to certain nonlinear time-dependent Schr\"{o}dinger equations, this algorithm loses…