Title :
How to store a triangular matrix
Author :
LaPaugh, Andrea S. ; Lipton, Richard J. ; Sandberg, Jonathan S.
Author_Institution :
Dept. of Comput. Sci., Princeton Univ., NJ, USA
fDate :
7/1/1992 12:00:00 AM
Abstract :
The problem of storing a triangular matrix so that each row and column is stored as a vector, i.e. the locations form an arithmetic progression, is discussed. Storing rows and columns as vectors can speed up access significantly. It is shown that there is no such storage method that does not waste approximately one-half of the computer memory
Keywords :
data structures; file organisation; arithmetic progression; triangular matrix; vector; Arithmetic; Computer science; Costs; Data structures; Information technology; Laboratories; Read-write memory; Scattering; US Government; Writing;
Journal_Title :
Computers, IEEE Transactions on
