How to Store a Triangular Matrix

Andrea S. LaPaugh, Richard J. Lipton

Research output: Contribution to journalArticlepeer-review


We consider 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. Storing rows and columns as vectors can speed up access significantly. We show that there is no such storage method that does not waste approximately one half of the computer memory.

Original languageEnglish (US)
Pages (from-to)896-899
Number of pages4
JournalIEEE Transactions on Computers
Issue number7
StatePublished - Jul 1992

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


  • Arithmetic progressions
  • diophantine analysis
  • inter-leaved memory
  • row or column access of a matrix
  • storage of matrices
  • triangular matrix


Dive into the research topics of 'How to Store a Triangular Matrix'. Together they form a unique fingerprint.

Cite this