SIAM Journal on Scientific and Statistical Computing
Parallel Preconditioning with Sparse Approximate Inverses
SIAM Journal on Scientific Computing
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Journal of Computational Physics
An Improved Magma Gemm For Fermi Graphics Processing Units
International Journal of High Performance Computing Applications
Finite Elements in Analysis and Design
A parallel algebraic multigrid solver on graphics processing units
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
Hi-index | 0.00 |
The solution of large systems of linear equations is typically achieved by iterative methods. The rate of convergence of these methods can be substantially improved by the use of preconditioners, which can be either applied in a black-box fashion to the linear system, or exploit properties specific to the underlying problem for maximum efficiency. However, with the shift towards multi- and many-core computing architectures, the design of sufficiently parallel preconditioners is increasingly challenging. This work presents a parallel preconditioning scheme for a state-of-the-art semiconductor device simulator and allows for the acceleration of the iterative solution process of the resulting system of linear equations. The method is based on physical properties of the underlying system of partial differential equations and results in a block preconditioner scheme, where each block can be computed in parallel by established serial preconditioners. The efficiency of the proposed scheme is confirmed by numerical experiments using a serial incomplete LU factorization preconditioner, which is accelerated by one order of magnitude on both multi-core central processing units and graphics processing units with the proposed scheme.