An automatic way of finding robust elimination trees for a multi-frontal sparse solver for radical 2D hierarchical meshes
AuthorsAbouEisha, Hassan M.
Paszyński, Maciej R.
Kuźnik, Krzysztof M.
KAUST DepartmentComputer, 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
MetadataShow full item record
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.
PublisherSpringer Science + Business Media
Conference/Event name10th International Conference on Parallel Processing and Applied Mathematics, PPAM 2013