Automatic Domain Decomposition in Finite Element Method – A Comparative Study

Authors

  • Ali Kaveh
    Affiliation

    School of Civil Engineering, Iran University of Science and Technology, Narmak, 16846-13114 Tehran, Iran

  • Mohammad Reza Seddighian
    Affiliation

    School of Civil Engineering, Iran University of Science and Technology, Narmak, 16846-13114 Tehran, Iran

  • Pouya Hassani
    Affiliation

    Department of Civil Engineering, Faculty of Engineering, Urmia University, 5756151818 Urmia, Iran

https://doi.org/10.3311/PPci.18519

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 processing

Citation data from Crossref and Scopus

Crossref
Scopus
Google Scholar
Europe PMC

Published 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

Vol. 66 No. 2 (2022)

Section

Research Article