Incomplete-LU and Cholesky Preconditioned Iterative Methods Using CUSPARSE and CUBLAS
Maxim Naumov · 2012
In this white paper we show how to use the CUSPARSE and CUBLAS libraries to achieve a 2 × speedup over CPU in the incomplete-LU and Cholesky preconditioned iterative methods. We focus on the Bi-Conjugate Gradient Stabilized and Conjugate Gradient iterative methods, that can be used to solve large sparse nonsymmetric and symmetric positive definite linear systems, respectively. Also, we comment on the parallel sparse triangular solve, which is an essential building block in these algorithms. 1