An automatic way of finding robust elimination trees for a multi-frontal sparse solver for radical 2D hierarchical meshes

Handle URI:
http://hdl.handle.net/10754/564857
Title:
An automatic way of finding robust elimination trees for a multi-frontal sparse solver for radical 2D hierarchical meshes
Authors:
AbouEisha, Hassan M. ( 0000-0003-4560-7175 ) ; Gurgul, Piotr; Paszyńska, Anna; Paszyński, Maciej R.; Kuźnik, Krzysztof M.; Moshkov, Mikhail ( 0000-0003-0085-9483 )
Abstract:
In this paper we present a dynamic programming algorithm for finding optimal elimination trees for the multi-frontal direct solver algorithm executed over two dimensional meshes with point singularities. The elimination tree found by the optimization algorithm results in a linear computational cost of sequential direct solver. Based on the optimal elimination tree found by the optimization algorithm we construct heuristic sequential multi-frontal direct solver algorithm resulting in a linear computational cost as well as heuristic parallel multi-frontal direct solver algorithm resulting in a logarithmic computational cost. The resulting parallel algorithm is implemented on NVIDIA CUDA GPU architecture based on our graph-grammar approach. © 2014 Springer-Verlag.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Applied Mathematics and Computational Science Program; Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group; Computer Science Program
Publisher:
Springer Science + Business Media
Journal:
Parallel Processing and Applied Mathematics
Conference/Event name:
10th International Conference on Parallel Processing and Applied Mathematics, PPAM 2013
Issue Date:
2014
DOI:
10.1007/978-3-642-55195-6_50
Type:
Conference Paper
ISSN:
03029743
Appears in Collections:
Conference Papers; Applied Mathematics and Computational Science Program; 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.authorGurgul, Piotren
dc.contributor.authorPaszyńska, Annaen
dc.contributor.authorPaszyński, Maciej R.en
dc.contributor.authorKuźnik, Krzysztof M.en
dc.contributor.authorMoshkov, Mikhailen
dc.date.accessioned2015-08-04T07:23:15Zen
dc.date.available2015-08-04T07:23:15Zen
dc.date.issued2014en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-55195-6_50en
dc.identifier.urihttp://hdl.handle.net/10754/564857en
dc.description.abstractIn this paper we present a dynamic programming algorithm for finding optimal elimination trees for the multi-frontal direct solver algorithm executed over two dimensional meshes with point singularities. The elimination tree found by the optimization algorithm results in a linear computational cost of sequential direct solver. Based on the optimal elimination tree found by the optimization algorithm we construct heuristic sequential multi-frontal direct solver algorithm resulting in a linear computational cost as well as heuristic parallel multi-frontal direct solver algorithm resulting in a logarithmic computational cost. The resulting parallel algorithm is implemented on NVIDIA CUDA GPU architecture based on our graph-grammar approach. © 2014 Springer-Verlag.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectAdaptive finite element methoden
dc.subjectDynamic programmingen
dc.subjectElimination treeen
dc.subjectGraph grammaren
dc.subjectParallel multi-frontal direct solveren
dc.titleAn automatic way of finding robust elimination trees for a multi-frontal sparse solver for radical 2D hierarchical meshesen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Groupen
dc.contributor.departmentComputer Science Programen
dc.identifier.journalParallel Processing and Applied Mathematicsen
dc.conference.date8 September 2013 through 11 September 2013en
dc.conference.name10th International Conference on Parallel Processing and Applied Mathematics, PPAM 2013en
dc.conference.locationWarsawen
dc.contributor.institutionAGH University of Science and Technology, Krakow, Polanden
dc.contributor.institutionJagiellonian University, Krakow, Polanden
kaust.authorAbouEisha, Hassan M.en
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.