A practical method for compressing sparse matrices with variant entries

Abstract

A row displacement method compresses efficiently a sparse matrix into a one-dimensional array. The access time with this method is O(l), but the application was restricted to the static matrices. In order to extend the use of the row displacement method to the dynamic matrices, the algorithms for insertion and deletion are proposed and the effectivity is confirmed by theoretical and empirical observations.

Keywords:

• A large sparse matrix
• dynamic data structure
• fast access
• storing and searching
• table compression
• table look up

C.R. Categories:

• E.1
• F.2.2
• H.3.3