Domain Decomposition Coupled with Delaunay Mesh Generation

Authors:
Tomasz Jurczyk;Barbara Glut
Affiliations:
-;-
Venue:
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Year:
2002

Citing 6
Cited 0

Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
Performance of dynamic load balancing algorithms for unstructured mesh calculations

Concurrency: Practice and Experience
Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
An Empirical Comparison of Decomposition Algorithms for Complex Finite Element Meshes

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Graph partitioning for high-performance scientific simulations

Sourcebook of parallel computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a domain decomposition method for finite element meshes created using the Delaunay criterion. The decomposition is performed at the intermediate stage of the generation process and is successively refined as the number of nodes in the mesh increases. The efficiency of the algorithm and the quality of the partitioning is evaluated for different partition heuristics and various finite element meshes.