Algorithms for constructing a finite element mesh of compound domains
Askhad PolatovNational University of Uzbekistan, 4, University Street, Tashkent 100174, Republic of UzbekistanSultan GaynazarovNational University of Uzbekistan, 4, University Street, Tashkent 100174, Republic of UzbekistanAkhmat IkramovNational University of Uzbekistan, 4, University Street, Tashkent 100174, Republic of UzbekistanSardor JumaniyozovNational University of Uzbekistan, 4, University Street, Tashkent 100174, Republic of Uzbekistan
ABI
Аннотация
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.
Мавзулар
Идентификаторлар
Иқтибослар ва манбалар
Кўрсаткичлар — AkademScholar · Тез орада