An adaptive mesh refinement scheme for hierarchical hybrid grids

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F25%3A10260666" target="_blank" >RIV/61989100:27240/25:10260666 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/article/10.21136/AM.2025.0186-25" target="_blank" >https://link.springer.com/article/10.21136/AM.2025.0186-25</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.21136/AM.2025.0186-25" target="_blank" >10.21136/AM.2025.0186-25</a>

Jazyk výsledku

angličtina

Název v původním jazyce

An adaptive mesh refinement scheme for hierarchical hybrid grids

Popis výsledku v původním jazyce

This work introduces an adaptive mesh refinement technique for hierarchical hybrid grids with the goal to reach scalability and maintain excellent performance on massively parallel computer systems. On the block-structured hierarchical hybrid grids, this is accomplished by using classical, unstructured refinement only on the coarsest level of the hierarchy, while keeping the number of structured refinement levels constant over the whole domain. This leads to a compromise, where the excellent performance characteristics of hierarchical hybrid grids can be maintained at the price that the flexibility of generating locally refined meshes is constrained. Furthermore, the mesh adaptivity often relies on a posteriori error estimators or error indicators, which tend to become computationally expensive. Again, with the goal of preserving scalability and performance, a method is proposed that leverages the grid hierarchy and the full multigrid scheme. Utilizing the sequence of approximations on the nested hierarchy of grids permits the computation of a cheap error estimator that is well-suited for large-scale parallel computing. We present the theoretical foundations for both global and local error estimates, and present a rigorous analysis of their effectivity. The proposed method, including the error estimator and the adaptive coarse grid refinement, is implemented in the finite element framework HyTeG. Extensive numerical experiments are conducted to validate the effectiveness, as well as performance and scalability.

Název v anglickém jazyce

An adaptive mesh refinement scheme for hierarchical hybrid grids

Popis výsledku anglicky

This work introduces an adaptive mesh refinement technique for hierarchical hybrid grids with the goal to reach scalability and maintain excellent performance on massively parallel computer systems. On the block-structured hierarchical hybrid grids, this is accomplished by using classical, unstructured refinement only on the coarsest level of the hierarchy, while keeping the number of structured refinement levels constant over the whole domain. This leads to a compromise, where the excellent performance characteristics of hierarchical hybrid grids can be maintained at the price that the flexibility of generating locally refined meshes is constrained. Furthermore, the mesh adaptivity often relies on a posteriori error estimators or error indicators, which tend to become computationally expensive. Again, with the goal of preserving scalability and performance, a method is proposed that leverages the grid hierarchy and the full multigrid scheme. Utilizing the sequence of approximations on the nested hierarchy of grids permits the computation of a cheap error estimator that is well-suited for large-scale parallel computing. We present the theoretical foundations for both global and local error estimates, and present a rigorous analysis of their effectivity. The proposed method, including the error estimator and the adaptive coarse grid refinement, is implemented in the finite element framework HyTeG. Extensive numerical experiments are conducted to validate the effectiveness, as well as performance and scalability.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

O - Projekt operacniho programu

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Applications of Mathematics

ISSN

0862-7940

e-ISSN

1572-9109

Svazek periodika

70

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

31

Strana od-do

875-905

Kód UT WoS článku

001638940400010

EID výsledku v databázi Scopus

—