Dynamic programming algorithm for generation of optimal elimination trees for multi-frontal direct solver over h-refined grids
In this paper we present a dynamic programming algorithm for finding optimal elimination trees for computational grids refined towards point or edge singularities. The elimination tree is utilized to guide the multi-frontal direct solver algorithm. Thus, the criterion for the optimization of the eli...
| Main Authors: | , , , , , |
|---|---|
| Format: | Conference Paper |
| Published: |
2014
|
| Online Access: | http://hdl.handle.net/20.500.11937/51303 |