Related papers: Numerical evaluation of ODE solutions by Monte Car…
In this paper, we present a simple and cheap ordinal bucketing algorithm that approximately generates $q$-quantiles from an incremental data stream. The bucketing is done dynamically in the sense that the amount of buckets $q$ increases…
This work focuses on the development of a new class of high-order accurate methods for multirate time integration of systems of ordinary differential equations. The proposed methods are based on a specific subset of explicit one-step…
We develop continuous-stage Runge-Kutta-Nystr\"{o}m (csRKN) methods for solving second order ordinary differential equations (ODEs) in this paper. The second order ODEs are commonly encountered in various fields and some of them can be…
The key to Black-Box Optimization is to efficiently search through input regions with potentially widely-varying numerical properties, to achieve low-regret descent and fast progress toward the optima. Monte Carlo Tree Search (MCTS) methods…
This manuscript introduces a fourth-order Runge-Kutta based implicit-explicit scheme in time along with compact fourth-order finite difference scheme in space for the solution of one-dimensional Kuramoto-Sivashinsky equation with periodic…
A space-time fully adaptive multiresolution method for evolutionary non-linear partial differential equations is presented introducing an improved local time-stepping method. The space discretisation is based on classical finite volumes,…
Monte Carlo is a simple and flexible tool that is widely used in computational finance. In this context, it is common for the quantity of interest to be the expected value of a random variable defined via a stochastic differential equation.…
We apply the Monte Carlo method to solving the Dirichlet problem of linear parabolic equations with fractional Laplacian. This method exploit- s the idea of weak approximation of related stochastic differential equations driven by the…
We propose a novel way to study numerical methods for ordinary differential equations in one dimension via the notion of multi-indice. The main idea is to replace rooted trees in Butcher's B-series by multi-indices. The latter were…
In this study, a species-clustered ordinary differential equations (ODE) solver for chemical kinetics with large detailed mechanisms based on operator-splitting is presented. The ODE system is split into clusters of species by using graph…
In this article, we discuss the numerical solution of Boolean polynomial programs by algorithms borrowing from numerical methods for differential equations, namely the Houbolt scheme, the Lie scheme, and a Runge-Kutta scheme. We first…
A conventional approach to train neural ordinary differential equations (ODEs) is to fix an ODE solver and then learn the neural network's weights to optimize a target loss function. However, such an approach is tailored for a specific…
We describe the implementation of output code optimization in the open source computer algebra system FORM. This implementation is based on recently discovered techniques of Monte Carlo tree search to find efficient multivariate Horner…
We show that existing Runge-Kutta methods for ordinary differential equations (odes) can be modified to solve stochastic differential equations (sdes) with strong solutions provided that appropriate changes are made to the way stepsizes are…
Many time-dependent differential equations are equipped with invariants. Preserving such invariants under discretization can be important, e.g., to improve the qualitative and quantitative properties of numerical solutions. Recently,…
In many applications of computer algebra large expressions must be simplified to make repeated numerical evaluations tractable. Previous works presented heuristically guided improvements, e.g., for Horner schemes. The remaining expression…
Fractional-step methods are a popular and powerful divide-and-conquer approach for the numerical solution of differential equations. When the integrators of the fractional steps are Runge--Kutta methods, such methods can be written as…
We extend the event-chain Monte Carlo algorithm from hard-sphere interactions to the micro-canonical ensemble (constant potential energy) for general potentials. This event-driven Monte Carlo algorithm is non-local, rejection-free, and…
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…
Classical convergence theory of Runge-Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic…