基于压缩存储的稀疏矩阵转置算法研究

Study on the Sparse Matrix Transpose Algorithms Based on Compressed Storage

介绍了对稀疏矩阵进行压缩存储的几种存储方式,重点分析了稀疏矩阵的三元组压缩存储的不同存储结构,提出利用数组首下标元素存储稀疏矩阵总行数、总列数和非零元素总个数三个信息的改进的三元组顺序表存储定义方式,同时给出了用C语言编写的基于该定义上设计矩阵转置的几种算法。通过对各算法进行时间复杂度分析,总结出了几种算法的优缺点。

Several compression storage methods of the sparse matrix are described and focused on analysis of different compression storage technology about the triple list for the sparse matrix. After describing the compression storage definition about the triple list of the sparse matrix, an improved storage defining method is put forward to use an array element in the first subscript of the sequence triple list array to daclare the information about the total number of rows, the total number of columns and the the total number of non-zero elements of the sparse matrix, and then gives the matrix transposing algorithms written in C lyzing the time complexity of several sparse structure dicussed here, the advantages and pogram language based on the definition proposed. By anamatrix transposition algorithms, which based on the compression storage disadvantages of the algorithms discussed are summarized.