Automatic Domain Decomposition in Finite Element Method – A Comparative Study
Abstract
In this paper, an automatic data clustering approach is presented using some concepts of the graph theory. Some Cluster Validity Index (CVI) is mentioned, and DB Index is defined as the objective function of meta-heuristic algorithms. Six Finite Element meshes are decomposed containing two- and three- dimensional types that comprise simple and complex meshes. Six meta-heuristic algorithms are utilized to determine the optimal number of clusters and minimize the decomposition problem. Finally, corresponding statistical results are compared.
Keywords:
optimization, meta-heuristic algorithm, graph theory, finite element method, graph clustering optimization, k-median, automatic clustering, parallel processingPublished Online
2022-03-30
How to Cite
Kaveh, A., Seddighian, M. R., Hassani, P. “Automatic Domain Decomposition in Finite Element Method – A Comparative Study”, Periodica Polytechnica Civil Engineering, 66(2), pp. 323–334, 2022. https://doi.org/10.3311/PPci.18519
Issue
Section
Research Article
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (see The Effect of Open Access). As soon as the paper is accepted, finally submitted and edited, the paper will appear in the "OnlineFirst" page of the journal, thus from this point no other internet-based publication is necessary.

