Related papers: Voronoi Particle Merging Algorithm for PIC Codes
We apply the cell merging method to a model shallow water problem with a permeable boundary. We use a cut cell approach which is more easily and systematically scalable with different shapes of boundaries. The novel cell merging method…
The Particle-Particle-Particle-Mesh algorithm elegantly extends the standard Particle-In-Cell scheme by direct summation of interaction that happens over distances below or around mesh size. Generally, this allows for a more accurate…
Many methods for modelling spatial processes assume global smoothness properties; such assumptions are often violated in practice. We introduce a method for modelling spatial processes that display heterogeneity or contain discontinuities.…
The quasi-neutral hybrid particle-in-cell algorithm with kinetic ions and fluid electrons is a popular model to study multi-scale problems in laboratory, space, and astrophysical plasmas. Here, it is shown that the treatment of ions as…
In this paper, we propose a new algorithm based on radial symmetry center method to track colloidal particles close to contact, where the optical images of the particles start to overlap in digital video microscopy. This overlapping effect…
We propose a parareal based time parallelization scheme in the phase-space for the particle-in-Fourier (PIF) discretization of the Vlasov-Poisson system used in kinetic plasma simulations. We use PIF with a coarse tolerance for the…
In simulations of partial differential equations using particle-in-cell (PIC) methods, it is often advantageous to resample the particle distribution function to increase simulation accuracy, reduce compute cost, and/or avoid numerical…
This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our…
Particle-wall interactions play a crucially important role in various applications such as microfluidic devices for cell sorting, particle separation, entire class of hydrodynamic filtration and its derivatives, etc. Yet, accurate…
We present a novel discretization of coupled compressible fluid and thin deformable structures that provides sufficient and necessary leakproofness by preserving the path connectedness of the fluid domain. Our method employs a constrained…
We introduce a new electrostatic particle-in-cell algorithm capable of using large timesteps compared to particle gyro-period under a uniform external magnetic field. The algorithm extends earlier electrostatic fully implicit PIC…
In this paper, Spectral Bridges, a novel clustering algorithm, is introduced. This algorithm builds upon the traditional k-means and spectral clustering frameworks by subdividing data into small Vorono\"i regions, which are subsequently…
In this article, we propose a numerical method to solve semi-discrete optimal transport problems for gigantic pointsets (108 points and more). By pushing the limits by several orders of magnitude, it opens the path to new applications in…
Particle-In-Cell (PIC) codes are broadly applied to the kinetic simulation of plasmas, from laser-matter interaction to astrophysics. Their heavy simulation cost can be mitigated by using the Single Instruction Multiple Data (SIMD)…
A novel particle merging algorithm for rarefied gas dynamics simulations is proposed that can conserve arbitrary velocity and spatial moments of the particle distribution via solving a non-negative least squares problem. An extension that…
Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the…
Given a network, the statistical ensemble of its graph-Voronoi diagrams with randomly chosen cell centers exhibits properties convertible into information on the network's large scale structures. We define a node-pair level measure called…
We consider problem of constructing purely Voronoi mesh where the union of uncut Voronoi cells approximates the planar computational domain with piecewise-smooth boundary. Smooth boundary fragments are approximated by the Voronoi edges and…
Although Poisson-Voronoi diagrams have interesting mathematical properties, there is still much to discover about the geometrical properties of its grains. Through simulations, many authors were able to obtain numerical approximations of…
Numerical simulations of the air in the atmosphere and water in the oceans are essential for numerical weather prediction. The state-of-the-art for performing these fluid simulations relies on an Eulerian viewpoint, in which the fluid…