Improving linked-lists using tree search algorithms for neighbor finding in variable-resolution smoothed particle hydrodynamics

DOI10.4208/CICP.OA-2018-0158MaRDI QIDQ5161645zbMATH OpenWikidataFDO

Authors Shahab Khorasanizade, J. M. M. Sousa

Publication date 1 November 2021

Published in Communications in Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/CICP.OA-2018-0158

zbMATH Keywords

flow past cylinderhierarhical data structureparticle refinementsmoothed particle hydrodynamics

Mathematics Subject Classification ID

Navier-Stokes equations for incompressible viscous fluids (76D05) Wakes and jets (76D25) Particle methods and lattice-gas methods (76M28)

Recommendations

• Neighbour lists in smoothed particle hydrodynamics
• Efficient and scalable algorithms for smoothed particle hydrodynamics on hybrid shared/distributed-memory architectures
• Nearest neighbor search algorithm and its parallel implementation in the SPH method
• Defining and optimizing algorithms for neighbouring particle identification in SPH fluid simulations
• Efficient implementation of smoothed particle hydrodynamics (SPH) with plane sweep algorithm

Cites work

• A Cartesian grid method for solving the two-dimensional streamfunction-vorticity equations in irregular regions
• A quadtree-based adaptive Cartesian/Quad grid flow solver for Navier-Stokes equations
• A robust weakly compressible SPH method and its comparison with an incompressible SPH
• An accurate SPH modeling of viscous flows around bodies at low and moderate Reynolds numbers
• Automatic three‐dimensional mesh generation by the finite octree technique
• Comparative study on accuracy and conservation properties of two particle regularization schemes and proposal of an optimized particle shifting scheme in ISPH context
• Dynamic flow-based particle splitting in smoothed particle hydrodynamics
• Dynamic refinement and boundary contact forces in SPH with applications in fluid flow problems
• Experiments on the flow past a circular cylinder at low Reynolds numbers
• Fast neighbor lists for adaptive-resolution particle simulations
• Incompressible SPH simulation of water entry of a free-falling object
• Lattice Boltzmann method on quadtree grids for simulating fluid flow through porous media: A new automatic algorithm
• Neighbour lists in smoothed particle hydrodynamics
• On the theory of classical fluids
• Robust, geometrically based, automatic two‐dimensional mesh generation
• Smoothed Particle Hydrodynamics
• Smoothed particle hydrodynamics method for fluid flows, towards industrial applications: motivations, current state, and challenges
• Steady separated flow past a circular cylinder at low Reynolds numbers
• The Fortran 2003 handbook. The complete syntax, features and procedures
• The immersed boundary method: a projection approach

Cited in

(2)

• An efficient linked list for molecular simulations on a spherical surface
• A GPU accelerated mixed-precision smoothed particle hydrodynamics framework with cell-based relative coordinates

This page was built for publication: Improving linked-lists using tree search algorithms for neighbor finding in variable-resolution smoothed particle hydrodynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5161645)