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 spa...

Full description

Saved in:
Bibliographic Details
Published in14th International Conference on Computer and Information Technology (ICCIT 2011) pp. 611 - 616
Main Authors Rahaman, A. S. Md M., Akhter, J., Rahman, M. T.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2011
Subjects
Conjugate gradient
Equations
Graphics processing unit
linear system
Linear systems
manycore
Mathematical model
PCGA
Sparse matrices
sparse matrix
Symmetric matrices
Vectors
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:1612849075
9781612849072
DOI:10.1109/ICCITechn.2011.6164861