Efficient implementation of smoothed particle hydrodynamics (SPH) with plane sweep algorithm
From MaRDI portal
Recommendations
- Neighbour lists in smoothed particle hydrodynamics
- Defining and optimizing algorithms for neighbouring particle identification in SPH fluid simulations
- 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
- SPH method with space-based variable smoothing length and its applications to free surface flow
Cited in
(7)- Efficient searching in meshfree methods
- Proposal for fast calculation of particle interactions in SPH simulations
- Neighbour lists in smoothed particle hydrodynamics
- Nearest neighbor search algorithm and its parallel implementation in the SPH method
- Efficient and scalable algorithms for smoothed particle hydrodynamics on hybrid shared/distributed-memory architectures
- Defining and optimizing algorithms for neighbouring particle identification in SPH fluid simulations
- Improving linked-lists using tree search algorithms for neighbor finding in variable-resolution smoothed particle hydrodynamics
This page was built for publication: Efficient implementation of smoothed particle hydrodynamics (SPH) with plane sweep algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5372483)