Solving general sparse linear systems with LU factorization and graph coloring

The fast solution of sparse linear systems is a very critical problem in many applications. As of November 2015, the cuSPARSE library offers routines for the solution of sparse linear systems based on LU decomposition, in particular cusparse<t>csrilu02 and cusparse<t>csrsv2_solve Furthermore, cuSPARSE offers the cusparse<t>csrcolor which implements graph coloring. The use of graph coloring for incomplete LU-factorization is described in Graph Coloring: More Paral...
More