초록 close

Parallel execution of computational mechanics codes requires efficient mesh-partitioningtechniques. These mesh-partitioning techniques divide the mesh into specified number of submeshes ofapproximately the same size and at the same time, minimise the interface nodes of the submeshes. Thispaper describes a new mesh partitioning technique, employing Genetic Algorithms. The proposedalgorithm operates on the deduced graph (dual or nodal graph) of the given finite element mesh ratherthan directly on the mesh itself. The algorithm works by first constructing a coarse graph approximationusing an automatic graph coarsening method. The coarse graph is partitioned and the results areinterpolated onto the original graph to initialise an optimisation of the graph partition problem. In practice,hierarchy of (usually more than two) graphs are used to obtain the final graph partition. The proposedpartitioning algorithm is applied to graphs derived from unstructured finite element meshes describingpractical engineering problems and also several example graphs related to finite element meshes given inthe literature. The test results indicate that the proposed GA based graph partitioning algorithm generateshigh quality partitions and are superior to spectral and multilevel graph partitioning algorithms.