Telescopic hybrid fast solver for 3D elliptic problems with point singularities
MetadataShow full item record
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.
Paper presented at International Conference On Computational Science, ICCS 2015: Computational Science at the Gates of Nature
Showing items related by title, author, creator and subject.
Garcia, D.; Pardo, D.; Dalcin, L.; Calo, Victor (2018)© 2018 Elsevier B.V. Starting from a highly continuous Isogeometric Analysis (IGA) discretization, refined Isogeometric Analysis (rIGA) introduces C 0 hyperplanes that act as separators for the direct LU factorization ...
Paszynski, M.; Pardo, D.; Calo, Victor (2015)We analyse the performance of direct solvers when applied to a system of linear equations arising from an h-adapted, <sup>C0</sup> finite element space. Theoretical estimates are derived for typical h-refinement patterns ...
Dynamic programming algorithm for generation of optimal elimination trees for multi-frontal direct solver over h-refined gridsAbouEisha, H.; Moshkov, M.; Calo, Victor; Paszynski, M.; Goik, D.; Jopek, K. (2014)In this paper we present a dynamic programming algorithm for finding optimal elimination trees for computational grids refined towards point or edge singularities. The elimination tree is utilized to guide the multi-frontal ...