ФРАГМЕНТИРОВАННЫЙ АЛГОРИТМ ПОСТРОЕНИЯ АДАПТИВНОЙ СЕТКИ

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