Algorithms for constructing a finite element mesh of compound domains

In the present paper algorithms for constructing a finite element mesh of compound domains and minimizing the ribbon width of the system of resolving equations by the finite element method (FEM) are considered. A technology for constructing a finite element mesh by connecting elementary subdomains,...

Full description

Saved in:
Bibliographic Details
Main Authors: Polatov, Askhad, Gaynazarov, Sultan, Ikramov, Akhmat, Jumaniyozov, Sardor
Format: Conference Proceeding
Language:English
Subjects:
Algorithms
Finite element method
Mathematical analysis
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the present paper algorithms for constructing a finite element mesh of compound domains and minimizing the ribbon width of the system of resolving equations by the finite element method (FEM) are considered. A technology for constructing a finite element mesh by connecting elementary subdomains, a semi-automatic method for partitioning a two-dimensional multiply connected domain with a curvilinear boundary, and ordering the node numbers of a finite element mesh is described. In this case, the algorithms allow, by ordering the numbering of nodes, to determine such a sequence in which the ribbon width of non-zero coefficients of the system of resolving equations by the FEM will be locally minimal.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0199609