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

GF上稠密矩阵的有效分解(2)

Efficient Decomposition of Dense Matrices over GF(2)

Martin R. Albrecht, Clément Pernet

摘要:

在这项工作中,我们描述了一个有效的实现算法的层次结构的分解稠密矩阵的领域与两个元素(GF(2))。矩阵分解是求解稠密线性和非线性方程组的一个重要组成部分,因此许多研究致力于提高此类算法的渐近复杂性。在这项工作中,我们讨论了在M4 RI库中的知名和改进的算法的实现。我们讨论的重点是M4 RI算法的一个新的变种-在这项工作中表示MMPF-它允许相当大的性能增益在实践中相比,以前最快的实现。我们提供了x86_64 CPU上的性能数据来证明我们方法的可行性。

英文摘要:

In this work we describe an efficient implementation of a hierarchy of algorithms for the decomposition of dense matrices over the field with two elements (GF(2)). Matrix decomposition is an essential building block for solving dense systems of linear and non-linear equations and thus much research has been devoted to improve the asymptotic complexity of such algorithms. In this work we discuss an implementation of both well-known and improved algorithms in the M4RI library. The focus of our discussion is on a new variant of the M4RI algorithm - denoted MMPF in this work -- which allows for considerable performance gains in practice when compared to the previously fastest implementation. We provide performance figures on x86_64 CPUs to demonstrate the viability of our approach.

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

↑