Telescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities

Anna Paszyńska, Konrad Jopek, Krzysztof Banaś, Maciej Paszyński, Piotr Gurgul, Andrew Lenerth, Donald Nguyen, Keshav Pingali, Lisandro Dalcin, Victor M. Calo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


This 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.
Original languageEnglish (US)
Title of host publicationProcedia Computer Science
PublisherElsevier BV
Number of pages5
StatePublished - Jun 1 2015

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01


Dive into the research topics of 'Telescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities'. Together they form a unique fingerprint.

Cite this