arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2206.00550cs.CC
收藏

矩阵乘法的一个范式

A Normal Form for Matrix Multiplication Schemes

Manuel Kauers, Jakob Moosbauer

摘要:

小矩阵的精确乘法方案有一个大的对称群。该组定义了乘法方案集上的等价关系。有算法来判断两个方案是否等价。然而,对于大量的计划,成对的等价性检查变得繁琐。本文提出了一种计算矩阵乘法方案的范式的算法。这使我们能够有效地决定大量方案的成对等价性。

英文摘要:

Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithms to decide whether two schemes are equivalent. However, for a large number of schemes a pairwise equivalence check becomes cumbersome. In this paper we propose an algorithm to compute a normal form of matrix multiplication schemes. This allows us to decide pairwise equivalence of a larger number of schemes efficiently.

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

↑