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 effciency of finite element computation and different aspects of the partition quality.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Elmroth, On grid partitioning for a high performance groundwater simulation software. In B. Engquist et al (eds), Simulation and Visualization on the Grid. Springer-Verlag, Berlin. Lecture Notes in Computational Science and Engineering, No. 13, 2000, pp 221–233.
G. Karypis, V. Kumar, Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrb. Comput. 48 (1998), pp. 96–129.
B. W. Kernighan, S. Lin, An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 49(1970), pp. 291–307.
H. P. Langtangen. Computational Partial Differential Equations-Numerical Methods and Diffpack Programming. Springer-Verlag, 1999.
B. F. Smith, P. E. Bjørstad, W. D. Gropp, Domain Decomposition, Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouhmala, N., Cai, X. (2001). Partition of Unstructured Finite Element Meshes by a Multilevel Approach. In: Sørevik, T., Manne, F., Gebremedhin, A.H., Moe, R. (eds) Applied Parallel Computing. New Paradigms for HPC in Industry and Academia. PARA 2000. Lecture Notes in Computer Science, vol 1947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-70734-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-70734-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41729-3
Online ISBN: 978-3-540-70734-9
eBook Packages: Springer Book Archive