arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1007.2117math.NAcs.NAcs.SC
收藏

任意阶矩阵的Strassen矩阵乘法算法

Strassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order

University of Jena(耶拿大学)

Ivo Hedtke

AI总结:

研究Strassen算法用于任意n×n矩阵时,因填充零行/列导致的额外计算量,分析最坏、最好和平均情况下的填充数d及其对浮点运算次数的影响。

摘要:

Volker Strassen著名的矩阵乘法算法仅适用于$(m2^k \times m2^k)$矩阵。对于任意$(n \times n)$矩阵,必须向给定矩阵添加零行和零列才能使用Strassen算法。Strassen给出了如何为任意$n$设置$m$和$k$以确保$n\leq m2^k$的策略。本文研究额外零行和零列的数量$d$,以及其在最坏情况($d=n/16$)、最好情况($d=1$)和平均情况($d\approx n/48$)下对算法浮点运算次数的影响。本工作的目的是详细分析额外零行和零列的数量,以及由Strassen不良参数引起的额外工作量。Strassen使用参数$m$和$k$证明其矩阵乘法算法需要少于$4.7n^{\log_2 7}$次浮点运算。本文表明,与最坏情况下的最优策略相比,这些参数在最坏情况下会导致约20%的额外工作量。这是寻找更好参数的主要原因。

英文摘要:

The well known algorithm of Volker Strassen for matrix multiplication can only be used for $(m2^k \times m2^k)$ matrices. For arbitrary $(n \times n)$ matrices one has to add zero rows and columns to the given matrices to use Strassen's algorithm. Strassen gave a strategy of how to set $m$ and $k$ for arbitrary $n$ to ensure $n\leq m2^k$. In this paper we study the number $d$ of additional zero rows and columns and the influence on the number of flops used by the algorithm in the worst case ($d=n/16$), best case ($d=1$) and in the average case ($d\approx n/48$). The aim of this work is to give a detailed analysis of the number of additional zero rows and columns and the additional work caused by Strassen's bad parameters. Strassen used the parameters $m$ and $k$ to show that his matrix multiplication algorithm needs less than $4.7n^{\log_2 7}$ flops. We can show in this paper, that these parameters cause an additional work of approx. 20 % in the worst case in comparison to the optimal strategy for the worst case. This is the main reason for the search for better parameters.

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

↑