Efficiency of linked cell algorithms

DOI10.1016/j.cpc.2010.11.002zbMath1215.82002arXiv1006.1239OpenAlexW2083641704MaRDI QIDQ538540

Guido Germano, Ulrich Welling

Publication date: 25 May 2011

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.1239

zbMATH Keywords

Monte Carlomolecular dynamicsmolecular simulationinteraction sortinglinked cell listlinked cell reorderingneighbour list

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Interacting particle systems in time-dependent statistical mechanics (82C22)

Related Items

A multilevel-skin neighbor list algorithm for molecular dynamics simulation ⋮ Spectral accuracy in fast Ewald-based methods for particle simulations ⋮ Fast neighbor lists for adaptive-resolution particle simulations ⋮ An efficient linked list for molecular simulations on a spherical surface

Cites Work

• Faster neighbour list generation using a novel lattice vector representation
• Algorithm optimization in molecular dynamics simulation
• General purpose molecular dynamics simulations fully implemented on graphics processing units
• Fast parallel algorithms for short-range molecular dynamics
• Parallel atomistic simulations
• Unnamed Item
• Unnamed Item
• Unnamed Item