[vc_empty_space][vc_empty_space]
Bounding grid algorithm for calculating particle interactions in SPH simulations
Kawada N.a, Gan B.S.a, Imran I.b, Ninomiya H.a
a Department of Architecture, Graduate School of Engineering, Nihon University, Japan
b Fac. of Civil and Env. Engineering, Institut Teknologi Bandung, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]A simple and easy algorithm is presented for a fast calculation of kernel evaluations which required in simulations using the Smoothed Particle Hydrodynamic (SPH) method. For a system with N particles, traditional method requires an amount of work of O(N× N) to calculate the interaction of each particle with every other particle in the system. The algorithm described here has the amount of work to evaluate particle interactions more less the same with previous works such as sorting, linked-list, vectorized linked-list methods which can reduce the amount of work as low as O(N). The additional time required is to register all the particles inside the predefined grids and their wider bounding grids to account particles at the utmost boundary of the grids for calculation of kernel evaluations. Registration of particles to their grids and bounding grids is conducted after each time step calculation finished. Therefore, the kernel evaluations of each particle in a grid to search for its interaction particle is only necessary sought within the bounding grid. Thus, this effort results in less amount of works compared to the traditional SPH method. Some benchmarks examples are used to show the time saved by using the present algorithm. The algorithm is easy to be implemented. Parameters study on the number of divisions for grids and amount of particles are also given to show the effectiveness of the present algorithm.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Bounding grid,Particle method,Simulation,Smoothed particle hydrodynamics,SPH,SPH methods,SPH simulation,Time step[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Bounding grid,Particle method,Simulation,SPH[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1016/j.proeng.2011.07.345[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]