- Tytuł:
- Element partition trees for h-refined meshes to optimize direct solver performance. Part I: Dynamic programming
- Autorzy:
-
Aboueisha, H.
Calo, V. M.
Jopek, K.
Moshkov, M.
Paszyńska, A.
Paszyński, M.
Skotniczny, M. - Powiązania:
- https://bibliotekanauki.pl/articles/330823.pdf
- Data publikacji:
- 2017
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
h-adaptive finite element method
ordering
element partition tree
extensions of dynamic programming
multifrontal direct solvers
metoda elementów skończonych
porządkowanie danych
programowanie dynamiczne - Opis:
- We consider a class of two- and three-dimensional h-refined meshes generated by an adaptive finite element method. We introduce an element partition tree, which controls the execution of the multi-frontal solver algorithm over these refined grids. We propose and study algorithms with polynomial computational cost for the optimization of these element partition trees. The trees provide an ordering for the elimination of unknowns. The algorithms automatically optimize the element partition trees using extensions of dynamic programming. The construction of the trees by the dynamic programming approach is expensive. These generated trees cannot be used in practice, but rather utilized as a learning tool to propose fast heuristic algorithms. In this first part of our paper we focus on the dynamic programming approach, and draw a sketch of the heuristic algorithm. The second part will be devoted to a more detailed analysis of the heuristic algorithm extended for the case of hp-adaptive grids.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2017, 27, 2; 351-365
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł