The Compression Storage Research for Half Banded Matrix

Abstract

Matrix is a mathematical object, commonly used in scientific computing and engineering calculation. In the data structure we are not interested in data itself, but how to store the elements in the matrix, and make the various operations can run effectively. The main purpose of the compressed storage is to make more of the same nonzero elements share the same storage unit according to the distribution of matrix element, while the zero elements don't allocate storage space. In this paper, we studied the compressed storage problems of lower half banded matrix, and obtained the corresponding storage address mapping function, so as to help the scientific research worker.