Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > APPROXIMATE MATRIX MULTIPLICATION:
Reports tagged with Approximate Matrix Multiplication:
TR14-117 | 18th August 2014
Shiva Manne, Manjish Pal

Fast Approximate Matrix Multiplication by Solving Linear Systems

Comments: 1

In this paper, we present novel deterministic algorithms for multiplying two n \times n matrices approximately. Given two matrices A,B we return a matrix C' which is an \emph{approximation} to C = AB. We consider the notion of approximate matrix multiplication in which the objective is to make the Frobenius ... more >>>




ISSN 1433-8092 | Imprint