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

张量的幂与快速矩阵乘法

Powers of Tensors and Fast Matrix Multiplication

François Le Gall

摘要:

本文给出了一种分析三线性形式(一种特殊的代数结构,也称为张量)的幂的方法,并得到了矩阵乘法的渐近复杂性的上界。与现有方法相比,该方法基于凸优化,具有多项式时间复杂度。作为应用,我们用这种方法研究了Coppermith和Winograd [Journal of符号计算,1990]给出的结构的幂,得到了方阵乘法指数的上界$ω<2.3728639$,它改进了已知的上界.

英文摘要:

This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with existing approaches, this method is based on convex optimization, and thus has polynomial-time complexity. As an application, we use this method to study powers of the construction given by Coppersmith and Winograd [Journal of Symbolic Computation, 1990] and obtain the upper bound $ω<2.3728639$ on the exponent of square matrix multiplication, which slightly improves the best known upper bound.

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

↑