Discretization of a two-dimensional domain
Автор: Davlatov S.O., Sheralieva S.A.
Журнал: Форум молодых ученых @forum-nauka
Статья в выпуске: 6 (106), 2025 года.
Бесплатный доступ
This article describes one of the algorithms for discritising a two-dimensional bounded domain for numerically solving mixed problems. Based on this algorithm, a program for area approximation has been created in the Delphi 7 programming language.
Algorithm, mixed problem, node, grid, segment, arc
Короткий адрес: https://sciup.org/140311920
IDR: 140311920
Статья научная
