Automatic Domain Decomposition in Finite Element Method – A Comparative Study | Zendy

A. Kaveh | Zendy; Mohammad Reza Seddighian | Zendy; Pouya Hassani | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Automatic Domain Decomposition in Finite Element Method – A Comparative Study

Author(s) -

A. Kaveh,

Mohammad Reza Seddighian,

Pouya Hassani

Publication year - 2021

Publication title -

periodica polytechnica civil engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.406

H-Index - 19

eISSN - 1587-3773

pISSN - 0553-6626

DOI - 10.3311/ppci.18519

Subject(s) - polygon mesh , cluster analysis , heuristic , finite element method , computer science , decomposition , algorithm , graph , simple (philosophy) , mathematics , mathematical optimization , theoretical computer science , artificial intelligence , engineering , ecology , philosophy , computer graphics (images) , structural engineering , epistemology , biology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research