Mesh Partitioning Algorithm Based on Parallel Finite Element Analysis and Its Actualization

Abstract EN

In parallel computing based on finite element analysis, domain decomposition is a key technique for its preprocessing.

Generally, a domain decomposition of a mesh can be realized through partitioning of a graph which is converted from a finite element mesh.

This paper discusses the method for graph partitioning and the way to actualize mesh partitioning.

Relevant softwares are introduced, and the data structure and key functions of Metis and ParMetis are introduced.

The writing, compiling, and testing of the mesh partitioning interface program based on these key functions are performed.

The results indicate some objective law and characteristics to guide the users who use the graph partitioning algorithm and software to write PFEM program, and ideal partitioning effects can be achieved by actualizing mesh partitioning through the program.

The interface program can also be used directly by the engineering researchers as a module of the PFEM software.

So that it can reduce the application of the threshold of graph partitioning algorithm, improve the calculation efficiency, and promote the application of graph theory and parallel computing.