Unlock instant, AI-driven research and patent intelligence for your innovation.

An adjacent particle search method and system for an SPH algorithm

A particle search and particle technology, applied in the field of computational fluid dynamics, can solve problems such as consuming CPU processing time and reducing program computing efficiency, and achieve the effects of improving robustness, improving computing efficiency, and improving computing efficiency.

Inactive Publication Date: 2019-05-03
THE GENERAL DESIGNING INST OF HUBEI SPACE TECH ACAD
View PDF10 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

For the entire calculation domain, if each particle is far away from its paired particles, it will consume a lot of CPU processing time, resulting in a decrease in the overall calculation efficiency of the program.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • An adjacent particle search method and system for an SPH algorithm
  • An adjacent particle search method and system for an SPH algorithm
  • An adjacent particle search method and system for an SPH algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0055] The embodiment of the present invention provides a kind of adjacent particle search method for SPH algorithm, comprises the following steps:

[0056] see figure 1 As shown in , the Cartesian coordinate system of all particle regions is established, the preset unit cell grid is constructed and the grid cell number at the position of each particle is calculated;

[0057] Map the particles to the grid unit, obtain the grid unit number corresponding to each particle, and find out the adjacent grid unit of the particle according to the grid unit number;

[0058] Compare the distance of each particle with the particles in the adjacent grid cells one by one and build particle pairs.

[0059] The step of constructing a preset unit cell grid and calculating the grid cell number at the position of each particle specifically includes the following steps:

[0060] Traverse all particles and calculate the maximum coordinate value of the coordinate system where the particle is loca...

Embodiment 2

[0084] An embodiment of the present invention provides a neighboring particle search system for the SPH algorithm, including:

[0085] A grid number calculation module, which is used to: establish a Cartesian coordinate system of all particle regions, construct a preset unit cell grid and calculate the grid cell number of each particle's position;

[0086] An adjacent grid acquisition module, which is used to: map particles to grid units, obtain the grid unit number corresponding to each particle, and find out the adjacent grid unit of the particle according to the grid unit number;

[0087] The particle pair establishing module is used for comparing the distance of each particle with the particles in the adjacent grid unit one by one and establishing the particle pair.

[0088] This system can effectively improve the robustness of software. It is verified by numerical examples that it is feasible to use the present invention to perform numerical calculation and simulation of...

Embodiment 3

[0095] see Figure 5 ~ Figure 8 As shown in , the verification model adopts a cylindrical water area, and the impact object is hemispherical, and the free-fall water landing test is carried out. Multi-core parallel computing methods are tested, as are neighbor search and sorting algorithms.

[0096] When a single core is called to solve and the particle sorting algorithm is not used, the simulation calculation time of the 0.01m water particle grid takes 80 minutes and 41 seconds. When 4 cores are called to solve and the particle sorting algorithm is not used, the simulation calculation time of 0.01m water particle grid is 37 minutes and 23 seconds. It can be seen that the calculation efficiency of the SPH method can be greatly improved by using the parallel computing method.

[0097] When a single core is called to solve and the particle sorting algorithm is used, the simulation calculation of the 0.01m water particle grid takes 58 minutes and 18 seconds. Therefore, using t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an adjacent particle searching method and system for an SPH algorithm, and relates to the technical field of computational fluid mechanics. The method comprises the steps of constructing a preset unit cell grid and calculating a grid unit number of a position where each particle is located; mapping the particles into grid units, obtaining a grid unit number corresponding toeach particle, and finding out adjacent grid units of the particles according to the grid unit numbers; and comparing the distance between each particle and the particles in the adjacent grid unit one by one and establishing a particle pair. According to the method, the robustness of software can be effectively improved. Through example verification, numerical calculation simulation of the fluidmechanics problem by using the method is feasible, and the calculation efficiency is effectively improved.

Description

technical field [0001] The invention relates to the technical field of computational fluid dynamics, in particular to an adjacent particle search method and system for SPH algorithm. Background technique [0002] With the rapid development of computer technology and CFD calculation methods, the SPH method is gradually used in the fluid numerical calculation process, but the traditional SPH method has a large calculation scale and low calculation efficiency. It is particularly important to improve the algorithm research work of SPH method to improve the calculation efficiency. [0003] For any particle in the fluid domain, its kernel function has a support domain, and all particles in the support domain will interact with the particle, and they are all adjacent particles of the particle. Adjacent particles will change with the change of calculation time, so the search algorithm of adjacent particles must be carried out in each iteration step to determine and calculate the in...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06N3/00G06F17/50
Inventor 孙旋涂正光印强强郭江涛舒孟炯周律何乾坤
Owner THE GENERAL DESIGNING INST OF HUBEI SPACE TECH ACAD