Parallel commutation of sparse linear systems on many core processor

摘要

In this paper, the authors describe the parallel implementation of a conjugate gradient method in a many-core system specially for solving the sparse linear systems. The new version of algorithm implementation differs from the one applied earlier [1], because it uses a special method for storing sparse coefficient matrices: only non-zero elements are stored and taken into account during computations, so that the sparsity of the coefficient matrix is taken full advantage of. Finally, A speedup of the parallel algorithm has been examined for different coefficient sparse matrices resulting in solving different physical problems.