快速可行和不可行矩阵乘法
Fast Feasible and Unfeasible Matrix Multiplication
摘要:
快速矩阵乘(以下简称MM)是一个高度认可的研究课题。1968年关于复杂性指数MM的上界3的记录到1987年下降到2.38以下,适用于许多计算领域的著名问题,并在计算理论中被广泛引用。进一步降低指数仍然是一个著名的挑战。在计算实践中MM的加速是一个独特的挑战,因为所有已知的算法支持指数低于2.7733,仅针对巨大尺寸的不可行MM改进了直接MM,大大超过了现在和任何可预见的未来感兴趣的尺寸。我们首先调查的主流研究的无限大小的MM的加速,包括在减少MM的指数的进展,评论其对计算的理论和实践的影响,并回顾各种基本概念和技术支持快速MM和自然在1980年推出的研究。然后,我们展示了递归的诅咒如何自然地进入了减少记录指数的游戏。最后,我们涵盖了最先进的高效可行MM,包括一些最有效的已知技术和算法,以及各种问题的数值和符号实现。我们希望,我们的审查将有助于推动和适当地集中在这一非常重要的领域作出进一步努力。
英文摘要:
Fast matrix-by-matrix multiplication (hereafter MM) is a highly recognized research subject. The record upper bound 3 of 1968 on the exponent of the complexity MM decreased below 2.38 by 1987, applies to celebrated problems in many areas of computing, and is extensively cited in the Theory of Computing. Further decrease of the exponent remains a celebrated challenge. Acceleration of MM in the Practice of Computing is a distinct challenge, because all known algorithms supporting the exponents below 2.7733 improve straightforward MM only for unfeasible MM of immense size, greatly exceeding the sizes of interest nowadays and in any foreseeable future. We first survey the mainstream study of the acceleration of MM of unbounded sizes, cover the progress in decreasing the exponents of MM, comment on its impact on the theory and practice of computing, and recall various fundamental concepts and techniques supporting fast MM and naturally introduced in that study by 1980. Then we demonstrate how the curse of recursion naturally entered the game of decreasing the record exponents. Finally we cover the State of the Art of efficient feasible MM, including some most efficient known techniques and algorithms as well as various issues of numerical and symbolic implementation. We hope that our review will help motivate and properly focus further effort in this highly important area.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。