On the GPGPU parallelization issues of finite element approximate inverse preconditioning
DOI10.1016/j.cam.2011.07.016zbMath1228.65043OpenAlexW1970627903MaRDI QIDQ645719
P. I. Matskanidis, George A. Gravvanis, Konstantinos M. Giannoutakis, Christos K. Filelis-Papadopoulos
Publication date: 10 November 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.07.016
performancenumerical resultsfinite element methodsparse linear systemsCUDA programminggeneral purpose graphics processor unitsinverse preconditioningparallel approximate inverse algorithmsparallel preconditioned conjugate gradient type methods
Computational methods for sparse matrices (65F50) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
- High performance inverse preconditioning
- High performance finite element approximate inverse preconditioning
- Generalized extended to the limit sparse factorization techniques for solving unsymmetric finite element systems
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
- Explicit approximate inverse preconditioning techniques
- Iterative solution of linear systems in the 20th century
- The rate of convergence of explicit approximate inverse preconditioning
- Fast Parallel Finite Element Approximate Inverses
- Parallel Preconditioning with Sparse Approximate Inverses
