Element Partition Trees For H-Refined Meshes to Optimize Direct Solver Performance. Part I: Dynamic Programming

Hassan M. AbouEisha, Victor Manuel Calo, Konrad Jopek, Mikhail Moshkov, Anna Paszyńka, Maciej Paszyński, Marcin Skotniczny

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

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
Original languageEnglish (US)
Pages (from-to)351-365
Number of pages15
JournalInternational Journal of Applied Mathematics and Computer Science
Volume27
Issue number2
DOIs
StatePublished - Jul 13 2017

Fingerprint Dive into the research topics of 'Element Partition Trees For H-Refined Meshes to Optimize Direct Solver Performance. Part I: Dynamic Programming'. Together they form a unique fingerprint.

Cite this