Related papers: Fine-sorting One-dimensional Particle-In-Cell Algo…
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…
A new implementation of many-body calculations is of paramount importance in the field of computational physics. In this study, we leverage the capabilities of Field Programmable Gate Arrays (FPGAs) for conducting quantum many-body…
Outstanding advances in solid-state laser technology, employing the optical parametric chirped-pulse-amplification (OPCPA) technique, have led physicists to focus laser pulses to highly-relativistic intensities which led to novel schemes…
DBSCAN is a very classic algorithm for data clus- tering, which is widely used in many fields. However, with the data scale growing much more bigger than before, the traditional serial algorithm can not meet the performance requirement.…
Particle methods are a ubiquitous tool for solving the Vlasov-Poisson equation in comoving coordinates, which is used to model the gravitational evolution of dark matter in an expanding universe. However, these methods are known to produce…
We present the standard electromagnetic Particle-in-Cell method, starting from the discrete approximation of derivatives on a uniform grid. The application to second-order, centered, finite-difference discretization of the equations of…
We introduce a quasi-static particle-in-cell (PIC) code -- WAND-PIC -- which does not suffer from some of the common limitations of many quasi-static PICs, such as the need for a predictor-corrector method in solving electromagnetic fields.…
With high computation power and memory bandwidth, graphics processing units (GPUs) lend themselves to accelerate data-intensive analytics, especially when such applications fit the single instruction multiple data (SIMD) model. However,…
We present implementations of a fourth-order symplectic integrator on graphic processing units for three $N$-body models with long-range interactions of general interest: the Hamiltonian Mean Field, Ring and two-dimensional self-gravitating…
Classical molecular dynamics (MD) simulations are important tools in life and material sciences since they allow studying chemical and biological processes in detail. However, the inherent scalability problem of particle-particle…
Kinetic plasma processes, such as magnetic reconnection, collisionless shocks, and turbulence, are fundamental to the dynamics of astrophysical and laboratory plasmas. Simulating these processes often requires particle-in-cell (PIC)…
The rapid development of general-purpose computing on graphics processing units (GPGPU) is allowing the implementation of highly-parallelized Monte Carlo simulation chains for particle physics experiments. This technique is particularly…
In low-temperature high-density plasmas quantum effects of the electrons are becoming increasingly important. This requires the development of new theoretical and computational tools. Quantum Monte Carlo methods are among the most…
This perspective paper deals with an overview of particle-in-cell / Monte Carlo collision models applied to different plasma-propulsion configurations and scenarios, from electrostatic (E x B and pulsed arc) devices to electromagnetic (RF…
Acceleration processes that occur in astrophysical plasmas produce cosmic rays that are observed on Earth. To study particle acceleration, fully-kinetic particle-in-cell (PIC) simulations are often used as they can unveil the microphysics…
Restricted solid on solid surface growth models can be mapped onto binary lattice gases. We show that efficient simulation algorithms can be realized on GPUs either by CUDA or by OpenCL programming. We consider a deposition/evaporation…
Numerical integration of stochastic differential equations is commonly used in many branches of science. In this paper we present how to accelerate this kind of numerical calculations with popular NVIDIA Graphics Processing Units using the…
Computational protein structure determination involves optimization in a problem space much too large to exhaustively search. Existing approaches include optimization algorithms such as gradient descent and simulated annealing, but these…
The simulation of large ensembles of particles is usually parallelized by partitioning the domain spatially and using message passing to communicate between the processes handling neighboring subdomains. The particles are represented as…
Monte Carlo methods are critical to many routines in quantitative finance such as derivatives pricing, hedging and risk metrics. Unfortunately, Monte Carlo methods are very computationally expensive when it comes to running simulations in…