Algorithm Research for Vector-Linked List Sparse Matrix Multiplication

The storage of non-zero elements of sparse matrix in the linked lists can dispense with transpose operation in the multiplication process, because multiplication shall be conducted only for elements in the two sparse matrices whose line number and column number are the same and whose values are not zero. As a result, the number of multiplications will be reduced. In the meantime, the use of linked list to store the elements of matrix will cut back the times of scanning the matrix elements. The theoretical analysis and experimental results show that algorithm of Vector-linked list sparse matrix multiplication has greater time efficiency and needs less storage space. It will lay the foundation for research in the field of image processing.