Related papers: Parallel P3M with exact calculation of short range…
Two algorithms for computing $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, are described, and using a combination of these two algorithms, the resulting algorithm is $O(n^{3/2})$. The second algorithm uses a list…
We present efficient algorithms to build data structures and the lists needed for fast multipole methods. The algorithms are capable of being efficiently implemented on both serial, data parallel GPU and on distributed architectures. With…
We describe a parallel version of our tree-code for the simulation of self-gravitating systems in Astrophysics. It is based on a dynamic and adaptive method for the domain decomposition, which exploits the hierarchical data arrangement used…
A standard approach to approximate inference in state-space models isto apply a particle filter, e.g., the Condensation Algorithm.However, the performance of particle filters often varies significantlydue to their stochastic nature.We…
Due to its flexible architecture, FPGAs support unique, deep hardware pipeline implementations for accelerating HPC applications. However, these devices are quite new in the HPC space, and thus, have been scarcely explored outside some…
We propose a hybrid tree algorithm for reducing calculation and communication cost of collision-less N-body simulations. The concept of our algorithm is that we split interaction force into two parts: hard-force from neighbor particles and…
A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic…
An efficient algorithm is presented for the identification of short bursts of gravitational radiation in the data from broad-band interferometric detectors. The algorithm consists of three steps: pixels of the time-frequency representation…
Particle collisions are the primary mechanism of inter-particle momentum and energy exchange for dense particle-laden flow. Accurate approximation of this collision operator in four-way coupled Euler-Lagrange approaches remains challenging…
We study the problem of partitioning a set of $n$ objects in a metric space into $k$ clusters $V_1,\dots,V_k$. The quality of the clustering is measured by considering the vector of cluster costs and then minimizing some monotone symmetric…
The various algorithms used to extrapolate particle trajectories from measurements are often very time-consuming with computational complexities which are typically quadratic. In this article, we propose a new algorithm called GEM with a…
We present a new algorithm to rapidly compute the two-point (2PCF), three-point (3PCF) and n-point (n-PCF) correlation functions in roughly O(N log N) time for N particles, instead of O(N^n) as required by brute force approaches. The…
We consider the problem of how to determine the force laws in an amorphous system of interacting particles. Given the positions of the centers of mass of the constituent particles we propose a new algorithm to determine the inter-particle…
The physics programme of the LHCb experiment at the Large Hadron Collider requires an efficient and precise reconstruction of the particle collision vertices. The LHCb Upgrade detector relies on a fully software-based trigger with an online…
We describe an efficient method of matched filtering over long (greater than 1 day) time baselines starting from Fourier transforms of short durations (roughly 30 minutes) of the data stream. This method plays a crucial role in the search…
The tree code for the approximate evaluation of gravitational forces is extended and substantially accelerated by including mutual cell-cell interactions. These are computed by a Taylor series in Cartesian coordinates and in a completely…
An innovative method based on the traversal of rays, originating from detected particles, through a three-dimensional grid of voxels is presented. The methodology has as main advantage that the outcome of the method is independent of the…
Particle acceleration during magnetic reconnection is a long-standing topic in space, solar and astrophysical plasmas. Recent 3D particle-in-cell simulations of magnetic reconnection show that particles can leave flux ropes due to 3D…
In micro- and nano-scale systems, particles can be moved by using an external force like gravity or a magnetic field. In the presence of adhesive particles that can attach to each other, the challenge is to decide whether a shape is…
We present a new very fast tree-code which runs on massively parallel Graphical Processing Units (GPU) with NVIDIA CUDA architecture. The tree-construction and calculation of multipole moments is carried out on the host CPU, while the force…