Parallel Finite Element Operator Application: Graph Partitioning and Coloring

Author(s):  
Katharina Kormann ◽  
Martin Kronbichler
2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Lei Zhang ◽  
Guoxin Zhang ◽  
Yi Liu ◽  
Hailin Pan

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.


2014 ◽  
Vol 31 (1) ◽  
pp. 2-17 ◽  
Author(s):  
S.H. Ju

Purpose – This paper develops C++ and Fortran-90 solvers to establish parallel solution procedures in a finite element or meshless analysis program using shared memory computers. The paper aims to discuss these issues. Design/methodology/approach – The stiffness matrix can be symmetrical or unsymmetrical, and the solution schemes include sky-line Cholesky and parallel preconditioned conjugate gradient-like methods. Findings – By using the features of C++ or Fortran-90, the stiffness matrix and its auxiliary arrays can be encapsulated into a class or module as private arrays. This class or module will handle how to allocate, renumber, assemble, parallelize and solve these complicated arrays automatically. Practical implications – The source codes can be obtained online at http//myweb.ncku.edu.tw/∼juju. The major advantage of the scheme is that it is simple and systematic, so an efficient parallel finite element or meshless program can be established easily. Originality/value – With the minimum requirement of computer memory, an object-oriented C++ class and a Fortran-90 module were established to allocate, renumber, assemble, parallel, and solve the global stiffness matrix, so that the programmer does not need to handle them directly.


2004 ◽  
Vol 272-276 ◽  
pp. 693-694 ◽  
Author(s):  
W Scholz ◽  
D Suess ◽  
R Dittrich ◽  
T Schrefl ◽  
V Tsiantos ◽  
...  

2013 ◽  
Vol 49 (5) ◽  
pp. 2413-2416 ◽  
Author(s):  
Yasuhito Takahashi ◽  
Tadashi Tokumasu ◽  
Masafumi Fujita ◽  
Takeshi Iwashita ◽  
Hiroshi Nakashima ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document