Related papers: Reducing the number of redundant pair-wise interac…
Recent advances in random-walk particle-tracking have enabled direct simulation of mixing and reactions on particles by allowing the particles to interact with each other using a multi-point mass transfer scheme. The mass transfer scheme…
This paper describes a new fast and implicitly parallel approach to neighbour-finding in multi-resolution Smoothed Particle Hydrodynamics (SPH) simulations. This new approach is based on hierarchical cell decompositions and sorted…
We introduce a new Lagrangian particle tracking algorithm that tracks particles in three dimensions to separations between trajectories approaching contact. The algorithm also detects low Weber number binary collisions that result in…
The problem of counting collisions or interactions is common in areas as computer graphics and scientific simulations. Since it is a major bottleneck in applications of these areas, a lot of research has been carried out on such subject,…
Lagrangian averaging plays an important role in the analysis of wave--mean-flow interactions and other multiscale fluid phenomena. The numerical computation of Lagrangian means, e.g. from simulation data, is however challenging. Typical…
Particle-in-cell merging algorithms aim to resample dynamically the six-dimensional phase space occupied by particles without distorting substantially the physical description of the system. Whereas various approaches have been proposed in…
Efficient representations of the Hamiltonian such as double factorization drastically reduce circuit depth or number of repetitions in error corrected and noisy intermediate scale quantum (NISQ) algorithms for chemistry. We report a…
Massively-parallel, distributed-memory algorithms for the Lagrangian particle hydrodynamic method [R. Samulyak, X. Wang, H.-C. Chen, Lagrangian particle method for compressible fluid dynamics, J. Comput. Phys., 362 (2018), 1-19] have been…
A fast algorithm to study one-dimensional self-gravitating systems, and, more generally, systems that are Lagrangian integrable between collisions, is presented. The algorithm is event-driven, and uses a heap-ordered set of predicted future…
Calculating interactions or correlations between pairs of particles is typically the most time-consuming task in particle simulation or correlation analysis. Straightforward implementations using a double loop over particle pairs have…
We present the methodology and performance of the new Lagrangian hydrodynamics code MAGMA2, a Smoothed Particle Hydrodynamics code that benefits from a number of non-standard enhancements. By default it uses high-order smoothing kernels and…
In this work, we make two improvements on the staggered grid hydrodynamics (SGH) Lagrangian scheme for modeling 2-dimensional compressible multi-material flows on triangular mesh. The first improvement is the construction of a dynamic local…
Methods for building a consistent interface between hydrodynamic and simulation modules is presented. These methods account for the backflow across the hydrodynamic/simulation hyper-surface. The algorithms are efficient, relatively…
Numerical solution of partial differential equations on parallel computers using domain decomposition usually requires synchronization and communication among the processors. These operations often have a significant overhead in terms of…
We propose an efficient algorithm for sparse signal reconstruction problems. The proposed algorithm is an augmented Lagrangian method based on the dual sparse reconstruction problem. It is efficient when the number of unknown variables is…
This paper presents a millisecond-level look-ahead control algorithm for energy storage with constant space complexity and worst-case linear run-time complexity. The algorithm connects the optimal control with the Lagrangian multiplier…
This paper describes a novel approach to neighbour-finding in Smoothed Particle Hydrodynamics (SPH) simulations with large dynamic range in smoothing length. This approach is based on hierarchical cell decompositions, sorted interactions,…
FISH is a fast and simple ideal magneto-hydrodynamics code that scales to ~10 000 processes for a Cartesian computational domain of ~1000^3 cells. The simplicity of FISH has been achieved by the rigorous application of the operator…
We present a consistent high-order staggered Lagrangian hydrodynamics framework designed to reconcile an underlying disparity in existing curvilinear formulations: the mismatch between quadrature-based "strong" mass conservation and the…
Gadget3 is nowadays one of the most frequently used high performing parallel codes for cosmological hydrodynamical simulations. Recent analyses have shown t\ hat the Neighbour Search process of Gadget3 is one of the most time-consuming…