Fast neighbor lists for adaptive-resolution particle simulations
From MaRDI portal
Publication:1948865
Recommendations
Cites work
- scientific article; zbMATH DE number 1688358 (Why is no real title available?)
- scientific article; zbMATH DE number 41859 (Why is no real title available?)
- scientific article; zbMATH DE number 46777 (Why is no real title available?)
- scientific article; zbMATH DE number 1302349 (Why is no real title available?)
- A Lagrangian particle level set method
- 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
- Convergence of a Variable Blob Vortex Method for the Euler and Navier–Stokes Equations
- Discretization correction of general integral PSE operators for particle methods
- Efficiency of linked cell algorithms
- MULTISCALE FLOW SIMULATIONS USING PARTICLES
- Multidimensional binary search trees used for associative searching
- PPM -- a highly efficient parallel particle-mesh library for the simulation of continuum systems
- Quicksort
- The priority R-tree: a practically efficient and worst-case optimal R-tree
- Vortex methods with spatially varying cores
Cited in
(6)- Particle-based adaptive coupling of 3D and 2D fluid flow models
- An efficient linked list for molecular simulations on a spherical surface
- A new multi-resolution parallel framework for SPH
- Improving linked-lists using tree search algorithms for neighbor finding in variable-resolution smoothed particle hydrodynamics
- A self-organizing Lagrangian particle method for adaptive-resolution advection-diffusion simulations
- Faster neighbour list generation using a novel lattice vector representation
This page was built for publication: Fast neighbor lists for adaptive-resolution particle simulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1948865)