Automatic Domain Decomposition in Finite Element Method - A Comparative Study

被引：1

作者：

Kaveh, Ali ^{[1
]}

Seddighian, Mohammad Reza ^{[1
]}

Hassani, Pouya ^{[2
]}

机构：

[1] Iran Univ Sci & Technol, Sch Civil Engn, Tehran 1684613114, Iran

[2] Urmia Univ, Fac Engn, Dept Civil Engn, Orumiyeh 5756151818, Iran

来源：

PERIODICA POLYTECHNICA-CIVIL ENGINEERING | 2022年 / 66卷 / 02期

关键词：

optimization; meta-heuristic algorithm; graph theory; finite element method; graph clustering optimization; k-median; automatic clustering; parallel processing; MULTIVARIATE DATA; OPTIMIZATION; ALGORITHM; NETWORKS;

D O I：

10.3311/PPci.18519

中图分类号：

TU [建筑科学];

学科分类号：

0813 ;

摘要：

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.

引用

页码：323 / 334

页数：12

共 45 条

[1]

[Anonymous], 2013, VISUAL EXPLORATIONS

[2] Locating Emergency Facilities Using the Weighted k-median Problem: A Graph-metaheuristic Approach [J].