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

矩阵与其伴随矩阵相乘的快速算法

Some fast algorithms multiplying a matrix by its adjoint

Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic

摘要:

本文给出了一个2 × 2分块矩阵与其伴随矩阵相乘的非交换算法,伴随矩阵由矩阵环反同态定义。该算法在C上或在正特征中使用5个块积(3个递归调用和2个一般积)。由此产生的算法为任意尺寸是减少乘法矩阵的伴随一般矩阵产品,提高了一个常数因子以前已知的减少。我们还证明,有没有算法来自双线性形式只使用四个产品和其中之一的伴随。其次,我们给出了新的专用算法的复数域和四元数交替计算乘法利用结构的矩阵多项式算术所涉及的。然后,我们分析了这两种策略各自的优势范围。最后,我们提出了低内存占用的时间表,支持一个快速和内存效率的实际实施的主要领域。

英文摘要:

We present a non-commutative algorithm for the multiplication of a 2 x 2 block-matrix by its adjoint, defined by a matrix ring anti-homomorphism. This algorithm uses 5 block products (3 recursive calls and 2 general products)over C or in positive characteristic. The resulting algorithm for arbitrary dimensions is a reduction of multiplication of a matrix by its adjoint to general matrix product, improving by a constant factor previously known reductions. We prove also that there is no algorithm derived from bilinear forms using only four products and the adjoint of one of them. Second we give novel dedicated algorithms for the complex field and the quaternions to alternatively compute the multiplication taking advantage of the structure of the matrix-polynomial arithmetic involved. We then analyze the respective ranges of predominance of the two strategies. Finally we propose schedules with low memory footprint that support a fast and memory efficient practical implementation over a prime field.

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

↑