Sparse Storage Technique for Sparse Matrix

In the computational field of science and engineering, many problems finally go to solve sparse linear equations and the sparse matrix has a few nonzero elements. For saving storage of computer and quickening elements' operation, it is very necessary to study storage technique for sparse matrix. Based on basal storage technique for matrix, this paper introduces some common storage methods for sparse matrix. After analyzing advantages and disadvantages of the methods, we show applied conditions for them. It is anticipant to provide some availability ways about effective solution for sparse linear equations.