Show simple item record

dc.contributor.authorPaszyńska, A.
dc.contributor.authorPaszyński, M.
dc.contributor.authorJopek, K.
dc.contributor.authorWoźniak, M.
dc.contributor.authorGoik, D.
dc.contributor.authorGurgul, P.
dc.contributor.authorAbouEisha, H.
dc.contributor.authorMoshkov, Mikhail
dc.contributor.authorCalo, Victor M.
dc.contributor.authorLenharth, A.
dc.contributor.authorNguyen, D.
dc.contributor.authorPingali, K.
dc.date.accessioned2015-04-22T13:55:33Z
dc.date.available2015-04-22T13:55:33Z
dc.date.issued2015-04-22
dc.identifier.citationQuasi-Optimal Elimination Trees for 2D Grids with Singularities 2015, 2015:1 Scientific Programming
dc.identifier.issn1058-9244
dc.identifier.issn1875-919X
dc.identifier.doi10.1155/2015/303024
dc.identifier.urihttp://hdl.handle.net/10754/550467
dc.description.abstractWe construct quasi-optimal elimination trees for 2D finite element meshes with singularities.These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal.We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O(log(Ne log(Ne)), where N e is the number of elements in the mesh.We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.
dc.publisherHindawi Publishing Corporation
dc.relation.urlhttp://www.hindawi.com/journals/sp/2015/303024/
dc.rightsThis is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
dc.titleQuasi-Optimal Elimination Trees for 2D Grids with Singularities
dc.typeArticle
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentEarth Science and Engineering Program
dc.contributor.departmentNumerical Porous Media SRI Center (NumPor)
dc.identifier.journalScientific Programming
dc.eprint.versionPublisher's Version/PDF
dc.contributor.institutionJagiellonian University, 31007 Krakow, Poland
dc.contributor.institutionAGH University of Science and Technology, 30059 Krakow, Poland
dc.contributor.institutionInstitute for Computational Engineering and Science, University of Texas, Austin, TX 78712-1229, USA
kaust.personAbouEisha, Hassan M.
kaust.personMoshkov, Mikhail
kaust.personCalo, Victor M.
refterms.dateFOA2018-06-14T07:31:03Z


Files in this item

Thumbnail
Name:
303024.pdf
Size:
3.358Mb
Format:
PDF
Description:
Main article

This item appears in the following Collection(s)

Show simple item record