首页|Nearest neighbor search algorithm based on multiple background grids for fluid simulation
Nearest neighbor search algorithm based on multiple background grids for fluid simulation
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
维普
The core of smoothed particle hydrodynamics(SPH)is the nearest neighbor search subroutine.In this paper,a nearest neighbor search algorithm which is based on multiple background grids and support variable smooth length is introduced.Through tested on lid driven cavity flow,it is clear that this method can provide high accuracy.Analysis and experiments have been made on its parallelism,and the results show that this method has better parallelism and with adding processors its accuracy become higher,thus it achieves that efficiency grows in pace with accuracy.
NETL
NSTL
万方数据
维普
