BIT Numerical Mathematics

, Volume 14, Issue 3, pp 347–358 | Cite as

Hashing the subscripts of a sparse matrix

  • E. v. d. S. de Villiers
  • L. B. Wilson


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.


Computational Mathematic Sparse Matrix Transformation Technique Sparse Matrice Storage Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Morris,Scatter Storage Techniques, Comm. of the ACM. Vol. 11, No 1 (January 1968), 38–44.CrossRefGoogle Scholar
  2. 2.
    V. Y. Lum, P. S. T. Yuen and M. Dodd,Key-to-Address Transform Techniques: A Fundamental Performance Study on Large Existing Formatted Files, Comm. of the ACM. Vol. 14, No. 4 (April 1971), 228–239.CrossRefGoogle Scholar
  3. 3.
    D. E. Knuth,The Art of Computer Programming, Vol III: Sorting and Searching, Addison-Wesley, 1973.Google Scholar
  4. 4.
    E. de Villiers and L. B. Wilson,Hash Coding Methods for Sparse Matrices, Univ. of Newcastle-upon-Tyne Computing Lab. Techn. Rep. 45, May 1973.Google Scholar

Copyright information

© BIT Foundations 1974

Authors and Affiliations

  • E. v. d. S. de Villiers
    • 1
  • L. B. Wilson
    • 1
  1. 1.Computing LaboratoryUniversity of NewcastleUpon TyneEngland

Personalised recommendations