Fast neighbor lists for adaptive-resolution particle simulations
From MaRDI portal
Publication:1948865
DOI10.1016/j.cpc.2012.01.003zbMath1264.65011OpenAlexW2067015954MaRDI QIDQ1948865
Sylvain Reboux, Ivo F. Sbalzarini, Ferit Büyükkeçeci, Omar Awile
Publication date: 25 April 2013
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://www.zora.uzh.ch/id/eprint/79219/1/pub_b%C3%BCk%C3%BC.pdf
algorithmnumerical examplesparticle methodsadaptive-resolution simulationscell listsmultiresolution simulationsneighbor listsVerlet lists
Related Items
A self-organizing Lagrangian particle method for adaptive-resolution advection-diffusion simulations, A new multi-resolution parallel framework for SPH, Improving Linked-Lists Using Tree Search Algorithms for Neighbor Finding in Variable-Resolution Smoothed Particle Hydrodynamics, An efficient linked list for molecular simulations on a spherical surface
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficiency of linked cell algorithms
- A Lagrangian particle method for reaction-diffusion systems on deforming surfaces
- Accurate and efficient methods for modeling colloidal mixtures in an explicit solvent using molecular dynamics
- Discretization correction of general integral PSE operators for particle methods
- Vortex methods with spatially varying cores
- PPM -- a highly efficient parallel particle-mesh library for the simulation of continuum systems
- A Lagrangian particle level set method
- Convergence of a Variable Blob Vortex Method for the Euler and Navier–Stokes Equations
- MULTISCALE FLOW SIMULATIONS USING PARTICLES
- Multidimensional binary search trees used for associative searching
- The priority R-tree
- Quicksort