Compressed Matrix Multiplication

Rasmus Pagh

Compressed Matrix Multiplication

Rasmus Pagh

Algorithms

Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

Abstract

Motivated by the problems of computing sample covariance matrices, and of transforming a collection of vectors to a basis where they are sparse, we present a simple algorithm that computes an approximation of the product of two n-by-n real matrices A and B.

Original language	English
Article number	9
Journal	ACM Transactions on Computation Theory
Volume	5
Issue number	3
ISSN	1942-3454
Publication status	Published - Aug 2013

Keywords

algorithm
matrix
matrix-multiplication

Cite this

@article{bc91bfd1d93a407bb300a693c3519ac6,

title = "Compressed Matrix Multiplication",

abstract = "Motivated by the problems of computing sample covariance matrices, and of transforming a collection of vectors to a basis where they are sparse, we present a simple algorithm that computes an approximation of the product of two n-by-n real matrices A and B.",

keywords = "algorithm, matrix, matrix-multiplication, algorithm, matrix, matrix-multiplication",

author = "Rasmus Pagh",

note = "Verificeret i ACM DL. Tidsskriftet er ikke med i autoritetslisten (lokal database i PURE). Skal vi indstille at tidsskriftet medtages i autoritetslisten fra 2014? 21.11.13 haal",

year = "2013",

month = aug,

language = "English",

volume = "5",

journal = "ACM Transactions on Computation Theory",

issn = "1942-3454",

publisher = "Association for Computing Machinery",

number = "3",

}

TY - JOUR

T1 - Compressed Matrix Multiplication

AU - Pagh, Rasmus

N1 - Verificeret i ACM DL. Tidsskriftet er ikke med i autoritetslisten (lokal database i PURE). Skal vi indstille at tidsskriftet medtages i autoritetslisten fra 2014? 21.11.13 haal

PY - 2013/8

Y1 - 2013/8

N2 - Motivated by the problems of computing sample covariance matrices, and of transforming a collection of vectors to a basis where they are sparse, we present a simple algorithm that computes an approximation of the product of two n-by-n real matrices A and B.

AB - Motivated by the problems of computing sample covariance matrices, and of transforming a collection of vectors to a basis where they are sparse, we present a simple algorithm that computes an approximation of the product of two n-by-n real matrices A and B.

KW - algorithm

KW - matrix

KW - matrix-multiplication

KW - algorithm

KW - matrix

KW - matrix-multiplication

M3 - Journal article

SN - 1942-3454

VL - 5

JO - ACM Transactions on Computation Theory

JF - ACM Transactions on Computation Theory

IS - 3

M1 - 9

ER -

Compressed Matrix Multiplication

Abstract

Keywords

Fingerprint

Cite this