On the GPGPU parallelization issues of finite element approximate inverse preconditioning

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:236

Article

Filelis-Papadopoulos, C. K.¹  Gravvanis, G. A.¹  Matskanidis, P. I.¹  Giannoutakis, K. M.² 

[1] Democritus Univ Thrace, Dept Elect & Comp Engn, Sch Engn, GR-67100 Xanthi, Greece

[2] Ctr Res & Technol Hellas, Informat & Telemat Inst, GR-57001 Thermi, Greece

关键词: Finite element method;    Sparse linear systems;    Parallel approximate inverse algorithms;    Parallel preconditioned conjugate gradient type methods;    General Purpose Graphics Processor Units;    CUDA programming;   

DOI  :  10.1016/j.cam.2011.07.016

来源: Elsevier

【 摘 要 】

During the past decades, explicit finite element approximate inverse preconditioning methods have been extensively used for efficiently solving sparse linear systems on multiprocessor systems. The effectiveness of explicit approximate inverse preconditioning schemes relies on the use of efficient preconditioners that are close approximants to the coefficient matrix and are fast to compute in parallel. New parallel computational techniques are proposed for the parallelization of the Optimized Banded Generalized Approximate Inverse Finite Element Matrix (OBGAIFEM) algorithm, based on the concept of the fish bone computational approach, and for the Explicit Preconditioned Conjugate Gradient type methods on a General Purpose Graphics Processing Unit (GPGPU). The proposed parallel methods have been implemented using Compute Unified Device Architecture (CUDA) developed by NVIDIA. Finally, numerical results for the performance of the finite element explicit approximate inverse preconditioning for solving characteristic two dimensional boundary value problems on a massive multiprocessor interface on a GPU are presented. The CUDA implementation issues of the proposed methods are also discussed. (C) 2011 Elsevier B.V. All rights reserved.

【 授权许可】

Free