Skip to main content Skip to main navigation menu Skip to site footer

Уважаемые пользователи! На нашем хостинге ведутся технические работы, на сайте могут быть ошибки. Приносим свои извинения за временные неудобства.

Bulletin of the Abai KazNPU, the series of "Physical and Mathematical Sciences"

FRAGMENTED ALGORITHM FOR ADAPTED GRID CONSTRUCTION

Published September 2020
Al-Farabi Kazakh National University, Almaty
Astana IT University, Nur-Sultan,
Astana IT University, Nur-Sultan,
Abstract

The paper describes the use of a computational fragments management automation system called LuNA (Language
for Numerical Algorithms) for a fragmented solution for the problem of constructing an adaptive structured grid. The
main idea behind LuNA is to use a high-level representation of an application's algorithm to enable it to automatically
execute on hybrid node multicomputers without low-level programming by the researcher. The constructed computational
grid structure is adapted to the values of the given function by solving the system of differential equations by the finite
difference method. The inverse Beltrami equation is used as a differential meshing method. Several tests were carried out
on a supercomputer using the described fragmented algorithm, including on a large number of threads for a mesh of 500
million nodes.

.pdf (Рус)
Language

Рус

How to Cite

[1]
Ахмед-Заки, Д., Турар, О. and Лебедев, Д. 2020. FRAGMENTED ALGORITHM FOR ADAPTED GRID CONSTRUCTION. Bulletin of the Abai KazNPU, the series of "Physical and Mathematical Sciences". 71, 3 (Sep. 2020), 37–44. DOI:https://doi.org/10.51889/2020-3.1728-7901.05.