Complexity Reduction in Many Particle Systems with Random Initial Data

From MaRDI portal
Revision as of 05:57, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5741186

DOI10.1137/140969786zbMath1342.35175arXiv1309.1372OpenAlexW2963256109MaRDI QIDQ5741186

Mykhailo Potomkin, Pierre-Emmanuel Jabin, Leonid Berlyand

Publication date: 22 July 2016

Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)

Abstract: We consider the motion of interacting particles governed by a coupled system of ODEs with random initial conditions. Direct computations for such systems are prohibitively expensive due to a very large number of particles and randomness requiring many realizations in their locations in the presence of strong interactions. While there are several approaches that address the above difficulties, none addresses all three simultaneously. Our goal is to develop such a computational approach in order to capture the experimentally observed emergence of correlations in the collective state (patterns due to strong interactions). Our approach is based on the truncation of the BBGKY hierarchy that allows one to go beyond the classical Mean Field limit and capture correlations while drastically reducing the computational complexity. Finally, we provide an example showing a numerical solution of this nonlinear and non-local system.


Full work available at URL: https://arxiv.org/abs/1309.1372





Cites Work


Related Items (6)





This page was built for publication: Complexity Reduction in Many Particle Systems with Random Initial Data