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

整数行列式的一种内省算法

An introspective algorithm for the integer determinant

Jean-Guillaume Dumas, Anna Urbanska

摘要:

给出了一个求整数矩阵A的行列式的算法。该算法是内省的,在这个意义上,它使用了几个不同的算法,以并发的方式运行。在算法的过程中,来自不同方法的部分结果可以被组合。然后,根据每个方法的当前运行时间,算法可以强调特定的变体。使用非常快速的线性代数模块化例程,我们的实现是一个数量级的速度比其他现有的实现。此外,我们还证明了该算法的期望复杂度仅为O(n^3 log^{2.5}(n| |A||时间复杂度为O(Omega n^{1.5} log^2(n| |A||)+ n^{2.5}log^3(n| |A||在稀疏情况下,其中||A||是矩阵绝对值中的最大项,Ω是稀疏矩阵情况下的矩阵向量乘法的成本。

英文摘要:

We present an algorithm computing the determinant of an integer matrix A. The algorithm is introspective in the sense that it uses several distinct algorithms that run in a concurrent manner. During the course of the algorithm partial results coming from distinct methods can be combined. Then, depending on the current running time of each method, the algorithm can emphasize a particular variant. With the use of very fast modular routines for linear algebra, our implementation is an order of magnitude faster than other existing implementations. Moreover, we prove that the expected complexity of our algorithm is only O(n^3 log^{2.5}(n ||A||)) bit operations in the dense case and O(Omega n^{1.5} log^2(n ||A||) + n^{2.5}log^3(n||A||)) in the sparse case, where ||A|| is the largest entry in absolute value of the matrix and Omega is the cost of matrix-vector multiplication in the case of a sparse matrix.

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

↑