基于三元组的稀疏矩阵乘法运算的改进

摘要

为了降低稀疏矩阵乘法运算时的时间复杂度和空间复杂度, 文章根据M矩阵的任一元素只能和N矩阵的j行元素相乘的特点,提出了两种基于三元组表示的稀疏矩阵乘法运算算法. 算法分析表明:第一改进算法在同等时间复杂度的情况下,降低了空间复杂度;第二改进算法在降低算法空间复杂度的同时也降低了时间复杂度.%Based on the fact that any element of matrix M only multiplies with the jth row elements of matrix N,this paper concludes that there are two multiplication operation of sparse matrix expressed as three triple to reduce the time complexity and space complexity of sparse matrix multiplication operation. Through algorithm analysis,it has shown that the first improved algorithm reduces the time complexity in the same as time complexity,and the second algorithm reduces the space and time complexity.