Show simple item record

dc.contributor.authorAbouEisha, Hassan M.
dc.contributor.authorCalo, V. M.
dc.contributor.authorJopek, K.
dc.contributor.authorMoshkov, Mikhail
dc.contributor.authorPaszyńska, A.
dc.contributor.authorPaszyński, M.
dc.date.accessioned2018-12-31T13:24:05Z
dc.date.available2018-12-31T13:24:05Z
dc.date.issued2018-06-12
dc.identifier.citationAbouEisha H, Calo VM, Jopek K, Moshkov M, Paszyńska A, et al. (2018) Bisections-Weighted-by-Element-Size-and-Order Algorithm to Optimize Direct Solver Performance on 3D hp-adaptive Grids. Computational Science – ICCS 2018: 760–772. Available: http://dx.doi.org/10.1007/978-3-319-93701-4_60.
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.doi10.1007/978-3-319-93701-4_60
dc.identifier.urihttp://hdl.handle.net/10754/630484
dc.description.abstractThe hp-adaptive Finite Element Method (hp-FEM) generates a sequence of adaptive grids with different polynomial orders of approximation and element sizes. The hp-FEM delivers exponential convergence of the numerical error with respect to the mesh size. In this paper, we propose a heuristic algorithm to construct element partition trees. The trees can be transformed directly into the orderings, which control the execution of the multi-frontal direct solvers during the hp refined finite element method. In particular, the orderings determine the number of floating point operations performed by the solver. Thus, the quality of the orderings obtained from the element partition trees is important for good performance of the solver. Our heuristic algorithm has been implemented in 3D and tested on a sequence of hp-refined meshes. We compare the quality of the orderings found by the heuristic algorithm to those generated by alternative state-of-the-art algorithms. We show 50% reduction in flops number and execution time.
dc.publisherSpringer Nature
dc.relation.urlhttps://link.springer.com/chapter/10.1007%2F978-3-319-93701-4_60
dc.subjectHeuristic algorithms
dc.subjecthp adaptive finite element method
dc.subjectMulti-frontal direct solvers
dc.subjectNested-dissections
dc.subjectOrdering
dc.titleBisections-Weighted-by-Element-Size-and-Order Algorithm to Optimize Direct Solver Performance on 3D hp-adaptive Grids
dc.typeConference Paper
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentComputer Science Program
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.identifier.journalComputational Science – ICCS 2018
dc.conference.date2018-06-11 to 2018-06-13
dc.conference.name18th International Conference on Computational Science, ICCS 2018
dc.conference.locationWuxi, CHN
dc.contributor.institutionCurtin Institute for Computation, Curtin University, Perth, WA, 6845, , Australia
dc.contributor.institutionMineral Resources, Commonwealth Scientific and Industrial Research Organization (CSIRO), Kensington, WA, 6152, , Australia
dc.contributor.institutionApplied Geology Department, Western Australian School of Mines, Faculty of Science and Engineering, Curtin University, Perth, WA, , , Australia
dc.contributor.institutionFaculty of Computer Science, Electronics and Telecommunications, AGH University of Science and Technology, al. Mickiewicza 30, Krakow, 30-059, , Poland
dc.contributor.institutionFaculty of Physics, Astronomy and Applied Computer Science, Jagiellonian University, Łojasiewicza 11, Krakow, 30-348, , Poland
kaust.personAbouEisha, Hassan M.
kaust.personMoshkov, Mikhail
dc.date.published-online2018-06-12
dc.date.published-print2018


This item appears in the following Collection(s)

Show simple item record