Issue No. 07 - July (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.256446
<p>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.</p>
triangular matrix; vector; arithmetic progression; data structures; file organisation.
J.S. Sandberg, R.J. Lipton, A.S. LaPaugh, "How to Store a Triangular Matrix", IEEE Transactions on Computers, vol. 41, no. , pp. 896-899, July 1992, doi:10.1109/12.256446