Яндекс.Метрика

D. Prokhorov, Y. Bazaikin, V. Lisitsa

Том: 8th Russian Supercomputing Days, RuSCDays 2022. Lecture Notes in Computer Science (Moscow, Russia, September 26-27)
Том: 13708 , Год издания: 2022
Многотомное издание: 8th Russian Supercomputing Days, RuSCDays 2022. Lecture Notes in Computer Science (Moscow, Russia, September 26-27)
Издатель: Springer International Publishing , Место издания: Berlin
Страницы: 313-327

Аннотация

The sintering simulation is an actual problem in computational mathematics since computer simulation allows performing much more experiments than can be performed using chemical or physical techniques, especially in the case of studying the materials intrinsic structure. The most perspective approach for the sintering simulation is a phase-field method. Usually, this approach requires solving the system of the Cahn-Hilliard and Allen-Cahn equation. The main difficulty is that number of Allen-Cahn equations is equal to the number of different grains in the sample. It causes requirements in computational resources to increase not only with increasing the grid size but with increasing the number of grains in the sample; if finite differences are used for solving the system. The paper presents the sintering simulation algorithm, which tracks the individual grains. This feature allows solving each of the Allen-Cahn equations only in a small subdomain corresponding to the current grain. The algorithm is implemented using Graphic Processor Units.
индекс в базе ИАЦ: 028780