摘要
许多实际的应用问题可以被归结为稀疏矩阵的计算 ,讨论了稀疏矩阵乘法运算的并行算法 ,稀疏矩阵中的元素采用三元组表示法作为它的存储结构 。
Many applied problems in practice can be summed up as the computation of sparse matrix. A parallel algorithm about sparse matrix multiplication is discussed in this paper. A element of the sparse matrix is represented with a record in clude three fields, then all elements are represented with a array. The parallel algorithm is of higher parallel degree and better running efficiency.
出处
《湘潭大学自然科学学报》
CAS
CSCD
2000年第1期1-3,共3页
Natural Science Journal of Xiangtan University
基金
国家自然科学基金
湖南省教委基金资助!(69974043)
