Partition of Unstructured Finite Element Meshes by a Multilevel Approach

Authors:
Noureddine Bouhmala;Xing Cai
Affiliations:
-;-
Venue:
PARA '00 Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and Academia
Year:
2000

Citing 3
Cited 0

Domain decomposition: parallel multilevel methods for elliptic partial differential equations

Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
Computational Partial Differential Equations: Numerical Methods and Diffpack Programming

Computational Partial Differential Equations: Numerical Methods and Diffpack Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the topic of partitioning unstructured finite element meshes by a class of multilevel graph partitioning algorithms. Two issues are studied, where the first issue concerns the coarsening phase in such multilevel graph partitioning algorithms. In particular, we propose a new heuristic for matching the vertices of a graph during the coarsening phase. We compare our heuristic with two other known matching heuristics in respect of matching ratio and quality of the final partition. As the second issue of the paper, we look at the relation between the parallel efficiency of finite element computation and different aspects of the partition quality.