Related papers: An exact particle splitting algorithm for PIC code…
Particle smoothers are widely used algorithms allowing to approximate the smoothing distribution in hidden Markov models. Existing algorithms often suffer from slow computational time or degeneracy. We propose in this paper a way to improve…
Mesh generation is essential for accurate and efficient computational fluid dynamics simulations. To resolve critical features in the flow, adaptive mesh refinement (AMR) is routinely employed in certain regions of the computational domain,…
Current Adaptive Mesh Refinement (AMR) simulations require algorithms that are highly parallelized and manage memory efficiently. As compute engines grow larger, AMR simulations will require algorithms that achieve new levels of efficient…
Adaptive mesh refinement (AMR) offers a practical solution to reduce the computational cost and memory requirement of numerical simulations that use computational meshes. In this work, we introduce a novel smart methodology for adaptive…
The increasing demand for larger and higher fidelity simulations has made Adaptive Mesh Refinement (AMR) and unstructured mesh techniques essential to focus compute effort and memory cost on just the areas of interest in the simulation…
To segment 4K or 6K ultra high-resolution images needs extra computation consideration in image segmentation. Common strategies, such as down-sampling, patch cropping, and cascade model, cannot address well the balance issue between…
We present a new technique for transferring momentum and velocity between particles and grid with Particle-In-Cell (PIC) calculations which we call Affine-Particle-In-Cell (APIC). APIC represents particle velocities as locally affine,…
We propose a spectral Particle-In-Cell (PIC) algorithm that is based on the combination of a Hankel transform and a Fourier transform. For physical problems that have close-to-cylindrical symmetry, this algorithm can be much faster than…
The task of finding the optimal compression of a polyline with straight-line segments and arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. Optimal compression algorithms find…
Researchers and designers are facing problems with memory and power walls, considering the pervasiveness of Von-Neumann architecture in the design of processors and the problems caused by reducing the dimensions of deep sub-micron…
Using neural networks to solve variational problems, and other scientific machine learning tasks, has been limited by a lack of consistency and an inability to exactly integrate expressions involving neural network architectures. We address…
A novel electromagnetic particle-in-cell algorithm has been developed for fully kinetic plasma simulations on unstructured (irregular) meshes in complex body-of-revolution geometries. The algorithm, implemented in the BORPIC++ code,…
Kinetic Particle In Cell (PIC) methods can extend greatly their range of applicability if implicit time differencing and spatial adaption are used to address the wide range of time and length scales typical of plasmas. For implicit…
Spatial stochastic molecular simulations in biology are limited by the intense computation required to track molecules in space either in a discrete time or discrete space framework, meaning that the serial limit has already been reached in…
In [8], some exact splittings are proposed for inhomogeneous quadratic differential equations including, for example, transport equations, kinetic equations, and Schr{\"o}dinger type equations with a rotation term. In this work, these exact…
We propose the use of sparse grids to accelerate particle-in-cell (PIC) schemes. By using the so-called `combination technique' from the sparse grids literature, we are able to dramatically increase the size of the spatial cells in…
Particle picking is a time-consuming step in single-particle analysis and often requires significant interventions from users, which has become a bottleneck for future automated electron cryo-microscopy (cryo-EM). Here we report a deep…
We present a new sink particle algorithm developed for the Adaptive Mesh Refinement code RAMSES. Our main addition is the use of a clump finder to identify density peaks and their associated regions (the peak patches). This allows us to…
This paper introduces a novel second-order splitting scheme for charged-particle dynamics in strong magnetic fields characterized by the maximal ordering. The proposed scheme is explicit and symmetric, which respectively ensure the…
The use of explicit particle-in-cell (PIC) method for relativistic plasma simulations is restricted by numerical heating and instabilities that may significantly constrain the choice of time and space steps. To partially eliminate these…