Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids

Hassan M. AbouEisha, Mikhail Moshkov, Victor M. Calo, Maciej Paszynski, Damian Goik, Konrad Jopek

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

Abstract

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.
Original languageEnglish (US)
Title of host publicationProcedia Computer Science
PublisherElsevier BV
Pages947-959
Number of pages13
DOIs
StatePublished - Jun 6 2014

Fingerprint Dive into the research topics of 'Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids'. Together they form a unique fingerprint.

Cite this