Stochastic parareal: an application of probabilistic methods to time-parallelisation

by   Kamran Pentland, et al.

Parareal is a well-studied algorithm for numerically integrating systems of time-dependent differential equations by parallelising the temporal domain. Given approximate initial values at each temporal sub-interval, the algorithm locates a solution in a fixed number of iterations using a predictor-corrector, stopping once a tolerance is met. This iterative process combines solutions located by inexpensive (coarse resolution) and expensive (fine resolution) numerical integrators. In this paper, we introduce a stochastic parareal algorithm with the aim of accelerating the convergence of the deterministic parareal algorithm. Instead of providing the predictor-corrector with a deterministically located set of initial values, the stochastic algorithm samples initial values from dynamically varying probability distributions in each temporal sub-interval. All samples are then propagated by the numerical method in parallel. The initial values yielding the most continuous (smoothest) trajectory across consecutive sub-intervals are chosen as the new, more accurate, set of initial values. These values are fed into the predictor-corrector, converging in fewer iterations than the deterministic algorithm with a given probability. The performance of the stochastic algorithm, implemented using various probability distributions, is illustrated on systems of ordinary differential equations. When the number of sampled initial values is large enough, we show that stochastic parareal converges almost certainly in fewer iterations than the deterministic algorithm while maintaining solution accuracy. Additionally, it is shown that the expected value of the convergence rate decreases with increasing numbers of samples.



There are no comments yet.


page 14

page 16

page 17

page 22


Quantum spectral methods for differential equations

Recently developed quantum algorithms address computational challenges i...

Learning the temporal evolution of multivariate densities via normalizing flows

In this work, we propose a method to learn probability distributions usi...

The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Ritz Values

We study the Lanczos algorithm where the initial vector is sampled unifo...

Truncated Milstein method for non-autonomous stochastic differential equations and its modification

The truncated Milstein method, which was initial proposed in (Guo, Liu, ...

Deterministic Inference of Neural Stochastic Differential Equations

Model noise is known to have detrimental effects on neural networks, suc...

A refined machinery to calculate large moments from coupled systems of linear differential equations

The large moment method can be used to compute a large number of moments...

Quantum Quantile Mechanics: Solving Stochastic Differential Equations for Generating Time-Series

We propose a quantum algorithm for sampling from a solution of stochasti...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.