How to Store a Triangular Matrix

Andrea S. LaPaugh; Richard J. Lipton

doi:10.1109/12.256446

How to Store a Triangular Matrix

Andrea S. LaPaugh, Richard J. Lipton

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English (US)
Pages (from-to)	896-899
Number of pages	4
Journal	IEEE Transactions on Computers
Volume	41
Issue number	7
DOIs	https://doi.org/10.1109/12.256446
State	Published - Jul 1992

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Keywords

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

Access to Document

10.1109/12.256446

Cite this

@article{3ca3b88f12da43f780fb87778884e853,

title = "How to Store a Triangular Matrix",

abstract = "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.",

keywords = "Arithmetic progressions, diophantine analysis, inter-leaved memory, row or column access of a matrix, storage of matrices, triangular matrix",

author = "LaPaugh, {Andrea S.} and Lipton, {Richard J.}",

year = "1992",

month = jul,

doi = "10.1109/12.256446",

language = "English (US)",

volume = "41",

pages = "896--899",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "7",

}

TY - JOUR

T1 - How to Store a Triangular Matrix

AU - LaPaugh, Andrea S.

AU - Lipton, Richard J.

PY - 1992/7

Y1 - 1992/7

N2 - 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.

AB - 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.

KW - Arithmetic progressions

KW - diophantine analysis

KW - inter-leaved memory

KW - row or column access of a matrix

KW - storage of matrices

KW - triangular matrix

UR - http://www.scopus.com/inward/record.url?scp=0026891327&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026891327&partnerID=8YFLogxK

U2 - 10.1109/12.256446

DO - 10.1109/12.256446

M3 - Article

AN - SCOPUS:0026891327

SN - 0018-9340

VL - 41

SP - 896

EP - 899

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 7

ER -

How to Store a Triangular Matrix

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this