![]() |
Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
Civil-Comp Conferences
ISSN 2753-3239 CCC: 12
PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GPU AND CLOUD COMPUTING FOR ENGINEERING Edited by: P. Iványi, J. Kruis and B.H.V. Topping
Paper 2.3
An Enhanced Spectral Method for Mesh Partitioning Based on Matching Edges T. Fouque1, C.-H. Lai2, E. George2 and F. Magoulès1
1MICS, CentraleSupélec, Université Paris-Saclay, Gif-sur-Yvette, Île-de-France, France
Full Bibliographic Reference for this paper
T. Fouque, C.-H. Lai, E. George, F. Magoulès, "An Enhanced Spectral Method for Mesh Partitioning Based on Matching Edges", in P. Iványi, J. Kruis, B.H.V. Topping, (Editors), "Proceedings of the Eighth International Conference on
Parallel, Distributed, GPU and Cloud Computing for Engineering", Civil-Comp Press, Edinburgh, UK,
Online volume: CCC 12, Paper 2.3, 2025,
Keywords: finite element method, mesh partitioning, spectral method, planar graph, parallel computing, domain decomposition.
Abstract
In this article, we present an original method for mesh partitioning based on a multilevel approach followed by a spectral method applied to the coarsened graph.
Opposite to other mesh partitioning algorithms based on spectral method, our approach takes into account the number of nodes as a parameter in the coarsened graph, ensuring a higher quality of the partitions.
In the case of planar meshes, we prove some theoretical results of this new coarse spectral bisection method related to this partitioning.
The numerical experiments confirm the efficiency of this method on different test cases.
download the full-text of this paper (PDF, 15 pages, 589 Kb)
go to the previous paper |
|