Element Partition Trees for H-Refined Meshes to Optimize Direct Solver Performance. Part I: Dynamic Programming
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 comp...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Academic Publications
2017
|
| Online Access: | http://hdl.handle.net/20.500.11937/55871 |
| Summary: | 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 dynami c 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. © 2017 H. AbouEisha et al. |
|---|