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

基于快速矩阵乘法的快速矩阵求逆

On Fast Matrix Inversion via Fast Matrix Multiplication

Zak Tonks

摘要:

Volker Strassen在1969年首先提出了一种算法,以最坏情况下的运行时间比传统的$\mathcal{O}(n^3)$操作更少的矩阵相乘。他还提出了一种递归算法,其中逆矩阵,并计算决定因素使用矩阵乘法。James R. Bunch & John E. Hopcroft在1974年改进了这一点,提供修改的逆算法的情况下,主子矩阵是奇异的,以及其他改进。我们涵盖多元多项式矩阵求逆的情况下,它是指出,传统的方法,假设一个领域将经历重大挫折。最初,作者和其他人发表了一个通过矩阵乘法的无分数求逆公式的演示文稿以及动机,但是对这个演示文稿的分析是初步的。因此,我们提供了一个讨论的真正复杂性的分数所产生的矩阵乘法,并达到其局限性。

英文摘要:

Volker Strassen first suggested an algorithm to multiply matrices with worst case running time less than the conventional $\mathcal{O}(n^3)$ operations in 1969. He also presented a recursive algorithm with which to invert matrices, and calculate determinants using matrix multiplication. James R. Bunch & John E. Hopcroft improved upon this in 1974 by providing modifications to the inversion algorithm in the case where principal submatrices were singular, amongst other improvements. We cover the case of multivariate polynomial matrix inversion, where it is noted that conventional methods that assume a field will experience major setbacks. Initially, the author and others published a presentation of a fraction free formulation of inversion via matrix multiplication along with motivations, however analysis of this presentation was rudimentary. We hence provide a discussion of the true complexities of this fraction free method arising from matrix multiplication, and arrive at its limitations.

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

↑