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

Handle URI:
http://hdl.handle.net/10754/550843
Title:
Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids
Authors:
AbouEisha, Hassan M. ( 0000-0003-4560-7175 ) ; Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Calo, Victor M. ( 0000-0002-1805-4045 ) ; Paszynski, Maciej; Goik, Damian; Jopek, Konrad
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.
KAUST Department:
Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Physical Sciences and Engineering (PSE) Division
Citation:
Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids 2014, 29:947 Procedia Computer Science
Publisher:
Elsevier BV
Journal:
Procedia Computer Science
Conference/Event name:
14th Annual International Conference on Computational Science, ICCS 2014
Issue Date:
6-Jun-2014
DOI:
10.1016/j.procs.2014.05.085
Type:
Conference Paper
ISSN:
18770509
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S1877050914002622
Appears in Collections:
Conference Papers; Physical Sciences and Engineering (PSE) Division; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAbouEisha, Hassan M.en
dc.contributor.authorMoshkov, Mikhailen
dc.contributor.authorCalo, Victor M.en
dc.contributor.authorPaszynski, Maciejen
dc.contributor.authorGoik, Damianen
dc.contributor.authorJopek, Konraden
dc.date.accessioned2015-04-28T12:32:31Zen
dc.date.available2015-04-28T12:32:31Zen
dc.date.issued2014-06-06en
dc.identifier.citationDynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids 2014, 29:947 Procedia Computer Scienceen
dc.identifier.issn18770509en
dc.identifier.doi10.1016/j.procs.2014.05.085en
dc.identifier.urihttp://hdl.handle.net/10754/550843en
dc.description.abstractIn 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.en
dc.publisherElsevier BVen
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S1877050914002622en
dc.rightsArchived with thanks to Procedia Computer Science. Under a Creative Commons license: http://creativecommons.org/licenses/by-nc-nd/3.0/en
dc.subjectmesh adaptationen
dc.subjectmulti-frontal direct solveren
dc.subjectelimination treesen
dc.subjectdynamic programmingen
dc.titleDynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Gridsen
dc.typeConference Paperen
dc.contributor.departmentComputer Science Programen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentPhysical Sciences and Engineering (PSE) Divisionen
dc.identifier.journalProcedia Computer Scienceen
dc.conference.date2014-06-10 to 2014-06-12en
dc.conference.name14th Annual International Conference on Computational Science, ICCS 2014en
dc.conference.locationCairns, QLD, AUSen
dc.eprint.versionPublisher's Version/PDFen
dc.contributor.institutionAGH University of Science and Technology, Krakow, Polanden
kaust.authorAbouEisha, Hassan M.en
kaust.authorMoshkov, Mikhailen
kaust.authorCalo, Victor M.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.