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 |
| Summary: | 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 elimination tree is the computational cost associated with the multi-frontal solver algorithm executed over such tree. We illustrate the paper with several examples of optimal trees found for grids with point, isotropic edge and anisotropic edge mixed with point singularity. We show the comparison of the execution time of the multi-frontal solver algorithm with results of MUMPS solver with METIS library, implementing the nested dissection algorithm. © The Authors. Published by Elsevier B.V. |
|---|