arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1408.4230cs.DS
收藏

求解线性方程组的快速近似矩阵乘法

Fast Approximate Matrix Multiplication by Solving Linear Systems

Shiva Manne, Manjish Pal

摘要:

在本文中,我们提出了新的确定性算法乘以两个$n \times n$矩阵近似。给定两个矩阵$A,B$,我们返回一个矩阵$C'$,它是$C = AB$的\emph{approximation}。我们考虑近似矩阵乘法的概念,其目标是使误差矩阵$C-C'$的Frobenius范数任意小。我们的主要贡献是首先减少矩阵乘法问题,解决一组线性方程组,然后使用标准的技术,找到一个近似的解决方案,该系统在$\tilde{O}(n^2)$时间。据我们所知,这是第一次检查到设计二次时间确定性算法的近似矩阵乘法,保证任意低的\emph{absolute error} w.r.t.弗罗贝纽斯·诺姆。

英文摘要:

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 norm of the error matrix $C-C'$ arbitrarily small. Our main contribution is to first reduce the matrix multiplication problem to solving a set of linear equations and then use standard techniques to find an approximate solution to that system in $\tilde{O}(n^2)$ time. To the best of our knowledge this the first examination into designing quadratic time deterministic algorithms for approximate matrix multiplication which guarantee arbitrarily low \emph{absolute error} w.r.t. Frobenius norm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑