Study on the Sparse Matrix Transpose Algorithms Based on Compressed Storage

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 pogram language based on the definition proposed.By analyzing the time complexity of several sparse matrix transposition algorithms,which based on the compression storage structure dicussed here,the advantages and disadvantages of the algorithms discussed are summarized.