FRAGMENTED ALGORITHM FOR ADAPTED GRID CONSTRUCTION

2020

Closed access Metadata (CSL-JSON)
DOI 10.51889/2020-3.1728-7901.05
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

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.