An Optimization-Based Approach to the Domain Decomposition Problem in Parallel Finite Element Analysis

1993 ◽  
pp. 535-546 ◽  
Author(s):  
B. H. V. Topping ◽  
A. I. Khan
Keyword(s):  
Finite Element Analysis ◽  
Finite Element ◽  
Domain Decomposition ◽  
Element Analysis ◽  
Decomposition Problem ◽  
Parallel Finite Element

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

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Lei Zhang ◽  
Guoxin Zhang ◽  
Yi Liu ◽  
Hailin Pan
Keyword(s):  
Finite Element Analysis ◽  
Finite Element ◽  
Parallel Computing ◽  
Domain Decomposition ◽  
Graph Partitioning ◽  
Element Analysis ◽  
Element Mesh ◽  
Mesh Partitioning ◽  
Parallel Finite Element ◽  
Partitioning Algorithm

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.

Sign in / Sign up

Export Citation Format

Share Document