Telescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities
| Autor: | Krzysztof Banaś, Victor M. Calo, Donald Nguyen, Andrew Lenerth, Anna Paszyńska, Keshav Kumar Pingali, Piotr Gurgul, Lisandro Dalcin, Maciej Paszyński, Konrad Jopek |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Mathematical optimization
Logarithm Computer science hybrid solver h adaptive finite element method multi-frontal solver Solver Computer Science::Numerical Analysis Finite element method Matrix (mathematics) ILUPCG GALO ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Computer Science::Mathematical Software Schur complement General Earth and Planetary Sciences Applied mathematics Point (geometry) Gravitational singularity Greedy algorithm General Environmental Science |
| Zdroj: | ICCS |
| ISSN: | 1877-0509 |
| DOI: | 10.1016/j.procs.2015.05.415 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|