有限域上矩阵约简的渐近复杂性
The asymptotic complexity of matrix reduction over finite fields
摘要:
考虑域上可逆n \times n矩阵.高斯-约当消去法使用最多n^2行操作将这个矩阵简化为单位矩阵,并且通常可能需要许多操作。在文献[1]中,作者考虑了q元有限域上n个\times n可逆矩阵的集合GL(n;q)中的矩阵,并给出了一个只使用行运算的算法,其性能渐近优于Gauss-Jordan消去法。更具体地说,他们的“条纹消除算法”具有渐近复杂性\frac{n^2}{\log_q{n}}。此外,他们证明了,直到一个常数的因素,这个算法是最好的可能,因为几乎所有的矩阵在GL(n;g)需要渐近至少\frac{n^2}{2\log_q{n}}操作。在这个简短的说明中,我们证明了“条纹消除算法”是渐近最优的GL(n;q)中几乎所有的矩阵需要渐近至少frac{n^2}{ \log_q{n} }操作。
英文摘要:
Consider an invertible n \times n matrix over some field. The Gauss-Jordan elimination reduces this matrix to the identity matrix using at most n^2 row operations and in general that many operations might be needed. In [1] the authors considered matrices in GL(n;q), the set of n \times n invertible matrices in the finite field of q elements, and provided an algorithm using only row operations which performs asymptotically better than the Gauss-Jordan elimination. More specifically their `striped elimination algorithm' has asymptotic complexity \frac{n^2}{\log_q{n}}. Furthermore they proved that up to a constant factor this algorithm is best possible as almost all matrices in GL(n;g) need asymptotically at least \frac{n^2}{2\log_q{n}} operations. In this short note we show that the `striped elimination algorithm' is asymptotically optimal by proving that almost all matrices in GL(n;q) need asymptotically at least frac{n^2}{\log_q{n}} operations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。