Dynamic programming algorithm for generation of optimal elimination trees for multi-frontal direct solver over h-refined grids
MetadataShow full item record
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.
Paper presented at ICCS 2014: 14th International Conference on Computational Science
Showing items related by title, author, creator and subject.
Kuznik, K.; Paszynski, M.; Calo, Victor (2012)This paper introduces the graph grammar based model for developing multi-thread multi-frontal parallel direct solver for two dimensional isogeometric finite element method. Execution of the solver algorithm has been ...
Grammar-based multi-frontal solver for one dimensional isogeometric analysis with multiple right-hand-sidesKuznik, K.; Paszynski, M.; Calo, Victor (2013)This paper introduces a grammar-based model for developing a multi-thread multi-frontal parallel direct solver for onedimensional isogeometric finite element method. The model includes the integration of B-splines for ...
Paszynski, M.; Kuznik, K.; Calo, Victor (2012)In this paper we present a multi-frontal direct solver algorithm for one and two dimensional isogeometric finite element method. The solver algorithm is tested on heat transfer model problem. The algorithm is partitioned ...