Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (19): 55-57.DOI: 10.3778/j.issn.1002-8331.2009.19.016

• 研究、探讨 • Previous Articles     Next Articles

Improved algorithm of sparse matrix multiplying

JIANG Chuan-qun,DU Yi   

  1. School of Computer and Information,Shanghai Second Polytechnic University,Shanghai 201209,China
  • Received:2008-04-21 Revised:2008-07-09 Online:2009-07-01 Published:2009-07-01
  • Contact: JIANG Chuan-qun

稀疏矩阵相乘的一个改进算法

蒋川群,杜 奕   

  1. 上海第二工业大学 计算机与信息学院,上海 201209
  • 通讯作者: 蒋川群

Abstract: The multiplication of sparse matrix can be used in many applied problems.A novel multiplying algorithm of sparse matrix is presented here.Using the row vector as computing unit instead of single element,the matrix’s revolution is avoided,and the scan times are reduced largely.By the list of three-tuple and small additional aided space,the multiplication of sparse matrix is achieved.Experiment results show that the new method is effective.

摘要: 稀疏矩阵的乘法运算可用于解决许多实际的应用问题。提出一种新颖的稀疏矩阵相乘算法,算法实现中将计算单元由单个元素扩展至行向量,避免了矩阵的转置,减少了扫描次数。利用三元组和少量的额外辅助空间实现稀疏矩阵的相乘。实验结果表明了该算法的有效性。