Related papers: Controlling the weights of simulation particles: a…
In this paper, we present a 2D numerical model developed to simulate the dynamics of soft, deformable particles. To accommodate significant particle deformations, the particle surface is represented as a narrow shell composed of mass points…
In particle-in-cell simulations and some other statistical computations, the representation of modelled distributions with tracked macro-particles can become locally excessive. Merging or resampling dense clusters or highly-populated phase…
I describe a fast algorithm for the identification of connected sets of points where the point-wise connections are determined by a fixed spatial distance - a task commonly referred to in the cosmological simulation community as…
Molecular Dynamics simulations can help scientists to gather valuable insights for physical processes on an atomic scale. This work explores various techniques for SIMD vectorization to improve the pairwise force calculation between…
The implementation of a new particle module describing the physics of dust grains coupled to the gas via drag forces is the subject of this work. The proposed particle-gas hybrid scheme has been designed to work in Cartesian as well as in…
Probabilistic graphical models (PGMs) are powerful tools for solving systems of complex relationships over a variety of probability distributions. However, while tree-structured PGMs always result in efficient and exact solutions, inference…
The Curie-Weiss model, originally used to study phase transitions in statistical mechanics, has been adapted to model phenomena in social sciences where many agents interact with each other. Reconstructing the probability measure of a…
Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…
Obtaining a rigorous and reliable method for linking computer simulations of polymer blends and composites at different length scales of interest is a highly desirable goal in soft matter physics. In this paper a multiscale modeling…
An optimal data partitioning in parallel & distributed implementation of clustering algorithms is a necessary computation as it ensures independent task completion, fair distribution, less number of affected points and better & faster…
We describe the two-dimensional TreePM method in this paper. The 2d TreePM code is an accurate and efficient technique to carry out large two-dimensional N-body simulations in cosmology. This hybrid code combines the 2d Barnes and Hut Tree…
We present linear-time algorithms for partitioning a path or a tree with weights on the vertices by removing $k$ edges to maximize the minimum-weight component. We also use the same framework to partition a path with weight on the vertices,…
Particle-In-Cell codes are widely used for plasma physics simulations. It is often the case that particles within a computational cell need to be split to improve the statistics or, in the case of non-uniform meshes, to avoid the…
Most parallel applications suffer from load imbalance, a crucial performance degradation factor. In particle simulations, this is mainly due to the migration of particles between processing elements, which eventually gather unevenly and…
In this paper, we construct a type of interacting particle systems to approximate a class of stochastic different equations whose coefficients depend on the conditional probability distributions of the processes given partial observations.…
A buffer k-d tree is a k-d tree variant for massively-parallel nearest neighbor search. While providing valuable speed-ups on modern many-core devices in case both a large number of reference and query points are given, buffer k-d trees are…
The present paper studies two particle management strategies for dynamically adaptive Cartesian grids at hands of a particle-in-cell code. One holds the particles within the grid cells, the other within the grid vertices. The fundamental…
Sampling equilibrium ensembles of dense polymer mixtures is a paradigmatically hard problem in computational physics, even in lattice-based models. Here, we develop a formalism based on interacting binary tensors that allows for tackling…
We propose here a model and a numerical scheme to compute the motion of rigid particles interacting through the lubrication force. In the case of a particle approaching a plane, we propose an algorithm and prove its convergence towards the…
Particle filters are a group of algorithms to solve inverse problems through statistical Bayesian methods when the model does not comply with the linear and Gaussian hypothesis. Particle filters are used in domains like data assimilation,…