Hashing the subscripts of a sparse matrix
- 29 Downloads
It has been suggested that key transformation techniques might be a very effective way of manipulating sparse matrices particularly if the operations on the matrix access the elements in an unsystematic way. The purpose of the present paper is to investigate methods of hashing the subscripts of a matrix to give a suitable address in the scatter storage table. Various different types of sparse matrices are considered.
KeywordsComputational Mathematic Sparse Matrix Transformation Technique Sparse Matrice Storage Table
Unable to display preview. Download preview PDF.