Show simple item record

dc.contributor.authorPaszyńska, Anna
dc.contributor.authorJopek, Konrad
dc.contributor.authorBanaś, Krzysztof
dc.contributor.authorPaszyński, Maciej
dc.contributor.authorGurgul, Piotr
dc.contributor.authorLenerth, Andrew
dc.contributor.authorNguyen, Donald
dc.contributor.authorPingali, Keshav
dc.contributor.authorDalcin, Lisandro
dc.contributor.authorCalo, Victor M.
dc.date.accessioned2015-06-10T18:40:46Z
dc.date.available2015-06-10T18:40:46Z
dc.date.issued2015-06-01
dc.identifier.citationTelescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities 2015, 51:2744 Procedia Computer Science
dc.identifier.issn18770509
dc.identifier.doi10.1016/j.procs.2015.05.415
dc.identifier.urihttp://hdl.handle.net/10754/556723
dc.description.abstractThis paper describes a telescopic solver for two dimensional h adaptive grids with point singularities. The input for the telescopic solver is an h refined two dimensional computational mesh with rectangular finite elements. The candidates for point singularities are first localized over the mesh by using a greedy algorithm. Having the candidates for point singularities, we execute either a direct solver, that performs multiple refinements towards selected point singularities and executes a parallel direct solver algorithm which has logarithmic cost with respect to refinement level. The direct solvers executed over each candidate for point singularity return local Schur complement matrices that can be merged together and submitted to iterative solver. In this paper we utilize a parallel multi-thread GALOIS solver as a direct solver. We use Incomplete LU Preconditioned Conjugated Gradients (ILUPCG) as an iterative solver. We also show that elimination of point singularities from the refined mesh reduces significantly the number of iterations to be performed by the ILUPCG iterative solver.
dc.publisherElsevier BV
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S1877050915012235
dc.rightsArchived with thanks to Procedia Computer Science, Under a Creative Commons license http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjecthybrid solver
dc.subjectmulti-frontal solver
dc.subjecth adaptive finite element method
dc.subjectILUPCG
dc.subjectGALO
dc.titleTelescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities
dc.typeConference Paper
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentEarth Science and Engineering Program
dc.contributor.departmentNumerical Porous Media SRI Center (NumPor)
dc.contributor.departmentPhysical Science and Engineering (PSE) Division
dc.identifier.journalProcedia Computer Science
dc.conference.date2002-04-21 to 2002-04-24
dc.conference.nameInternational Conference on Computational Science, ICCS 2002
dc.conference.locationAmsterdam, NLD
dc.eprint.versionPublisher's Version/PDF
dc.contributor.institutionJagiellonian University, Krakow, Poland
dc.contributor.institutionAGH University of Science and Technology, Krakow, Poland
dc.contributor.institutionInstitute for Computational and Engineering Sciences, (ICES), TX, USA
kaust.personDalcin, Lisandro
kaust.personCalo, Victor M.
refterms.dateFOA2018-06-13T12:34:00Z
dc.date.published-online2015-06-01
dc.date.published-print2015


Files in this item

Thumbnail
Name:
1-s2.0-S1877050915012235-main.pdf
Size:
401.3Kb
Format:
PDF
Description:
Main article

This item appears in the following Collection(s)

Show simple item record