A Survey of Indexing Techniques for Sparse Matrices
- 1 June 1973
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 5 (2) , 109-133
- https://doi.org/10.1145/356616.356618
Abstract
Indexing schemes of main interest are the bit map, address map, row-column, and the threaded list Major variations of the indexing techniques above mentioned are noted, as well as the particular indexing scheme inherent in diagonal or band matrices. The concluding section of the paper compares the types of methods, discusses their suitabihty for different types of processing, and makes suggestions eoneernlng the adaptability and flexibility of the maj or exmting methods of indexing algorithms for application to user problemsKeywords
This publication has 18 references indexed in Scilit:
- The Growth of Interest in Microprogramming: A Literature SurveyACM Computing Surveys, 1969
- Optimal elimination for sparse symmetric systems as a graph problem.Quarterly of Applied Mathematics, 1968
- Row-column permutation of sparse matricesThe Computer Journal, 1967
- Computable Error Bounds for Direct Solution of Linear EquationsJournal of the ACM, 1967
- A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous EquationsThe Computer Journal, 1966
- On the Product Form of Inverses of Sparse MatricesSIAM Review, 1966
- On an Approach to Techniques for the Analysis of the Structure of Large Systems of EquationsSIAM Review, 1962
- A modified inversion procedure for product form of the inverse linear programming codesCommunications of the ACM, 1962
- Algorithm 16: crout with pivotingCommunications of the ACM, 1960
- The Analysis of Large Structural SystemsThe Computer Journal, 1960