DocumentCode
1007394
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
Volume
41
Issue
7
fYear
1992
fDate
7/1/1992 12:00:00 AM
Firstpage
896
Lastpage
899
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;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.256446
Filename
256446
Link To Document