Partition searching method used for SPH algorithm

Abstract

The invention discloses a partition searching method used for an SPH algorithm. The method is characterized by including the following steps that a simulation model for simulation analysis is created, and initialized setting is conducted; the pressure value, the stress tensor and the artificial viscosity value of each particle corresponding to the simulation model are calculated; searching and analyzing are conducted on the simulation model in each set time step; internal searching of each determined partition and area searching of the boundary of each determined partition are conducted through searching and analyzing; a state equation and a control equation corresponding to the simulation model are calculated; a corresponding simulation result is output on the basis of set termination conditions. By means of the technology of conducting internal searching on the partitions and the like, the partition searching method has part of advantages of tree searching, and does not need to face the stack overflow or excessive deep recursion problem in the recursion process.

Description

technical field [0001] The invention relates to the technical field of computer simulation, in particular to a partition search method for an SPH algorithm. Background technique [0002] Usually, the laws of motion and deformation of the objects we care about can be described by differential equations, which are called physical control equations. In fact, most moving objects are complex in shape, and the physical control equations must be numerically determined with the help of a computer. Calculation, also called numerical simulation or numerical simulation, means to use numerical calculation method to simulate the movement and deformation of objects under certain conditions according to objective laws. able to come very close. Therefore, numerical simulation calculation has become the third research method next to experimental means and theoretical means in scientific research and engineering applications. It has the advantages of intuitive results, high repeatability, lo...

AI Technical Summary

Problems solved by technology

[0007] At present, there are two search techniques in the SPH method, the linked list search technique based on the background grid and the octree search based on the tree structure. Among them, the octree search is implemented by a recursive method, and the disadvantage is that stack overflow or The problem of too deep recursion, but the advantage is that it is still very efficient for very uneven distribution; while the linked list search is to divide the bounding box containing all particles into a background grid of equal size, and then put each particle into the grid grid to obtain the grid information that each particle belongs to and the particle information contained in each grid. By relying on the background grid to obtain the local relationship information of each particle, a local search is performed. The disadvantage is that when the particle distribution is uneven Sometimes there will be many grids without particles, and storing these grids will consume a lot of memory and time, but the advantage is that it is simple to implement, safe and reliable

Therefore, it is necessary to find a new search method that has some of the advantages of tree search without facing the problem of stack overflow or too deep recursion.

Images