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

稀疏矩阵的极小多项式和行列式的线性时间交互证明

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix

Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé, Gilles Villard

摘要:

计算问题证书是每个输出的附加数据结构,它可以被证明每个输出正确性的可能随机化验证算法使用。在本文中,我们给出了一个算法,计算一个证书的最小多项式的稀疏或结构化的nxn矩阵在一个抽象的领域,足够大的基数,其蒙特卡罗验证的复杂性需要一个单一的矩阵向量乘法和线性数量的额外的字段操作。我们还提出了一种新的预条件,确保不可约的特征多项式的一般预条件矩阵。这个预处理器需要线性时间来应用,并且只使用两个随机条目。然后,我们结合这两种技术给出算法,计算证书的行列式,从而为特征多项式,其蒙特卡洛验证的复杂性,因此也是线性的。

英文摘要:

Computational problem certificates are additional data structures for each output, which can be used by a-possibly randomized-verification algorithm that proves the correctness of each output. In this paper, we give an algorithm that computes a certificate for the minimal polynomial of sparse or structured nxn matrices over an abstract field, of sufficiently large cardinality, whose Monte Carlo verification complexity requires a single matrix-vector multiplication and a linear number of extra field operations. We also propose a novel preconditioner that ensures irreducibility of the characteristic polynomial of the generically preconditioned matrix. This preconditioner takes linear time to be applied and uses only two random entries. We then combine these two techniques to give algorithms that compute certificates for the determinant, and thus for the characteristic polynomial, whose Monte Carlo verification complexity is therefore also linear.

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

↑