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

动态矩阵求逆:改进算法及匹配条件下界

Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds

Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak

摘要:

动态矩阵求逆问题是指在元素和列更新时保持矩阵的逆。它是许多复杂性尚未得到很好理解的动态问题的最佳算法背后的主要子程序,例如维护矩阵的最大特征值、秩和行列式以及维护可达性、距离、最大匹配大小和$k$ -图中的路径/循环。了解动态矩阵求逆的复杂性是理解这些问题的关键。在本文中,我们提出了(i)改进算法的动态矩阵求逆和他们的扩展到一些增量/前瞻的变种,和(ii)变种的在线矩阵向量猜想[Henzinger等人。STOC'15],如果真的,意味着这些算法是紧的。我们的算法自动导致上述问题的更快的动态算法,其中一些在我们的架构下也很紧,例如可达性和最大匹配大小(实际上,Abboud和V. Williams [FOCS'14]要求缩小这两个问题的差距)。这些问题中的大多数的先前最佳界限可以追溯到十多年前[Sankowski FOCS'04,COCOON'05,SODA'07; Kavitha FSTTCS'08; Mucha and Sankowski Mascica '10; Bosek et al. FOCS'14]。我们的改进主要来自于使用快速矩阵乘法“再一次”的能力,以保持一个特定的变换矩阵,该变换矩阵只能在组合上保持(即没有快速矩阵乘法)。奇怪的是,不像其他动态问题,这种方法,一旦成功,可以重复几次(“引导”),我们的示意图意味着,这不是动态矩阵求逆和一些相关的问题。然而,当提供了一个小的额外的“前瞻”信息时,我们可以执行这样的重复以进一步降低边界。

英文摘要:

The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best algorithms for many dynamic problems whose complexity is not yet well-understood, such as maintaining the largest eigenvalue, rank and determinant of a matrix and maintaining reachability, distances, maximum matching size, and $k$-paths/cycles in a graph. Understanding the complexity of dynamic matrix inverse is a key to understand these problems. In this paper, we present (i) improved algorithms for dynamic matrix inverse and their extensions to some incremental/look-ahead variants, and (ii) variants of the Online Matrix-Vector conjecture [Henzinger et al. STOC'15] that, if true, imply that these algorithms are tight. Our algorithms automatically lead to faster dynamic algorithms for the aforementioned problems, some of which are also tight under our conjectures, e.g. reachability and maximum matching size (closing the gaps for these two problems was in fact asked by Abboud and V. Williams [FOCS'14]). Prior best bounds for most of these problems date back to more than a decade ago [Sankowski FOCS'04, COCOON'05, SODA'07; Kavitha FSTTCS'08; Mucha and Sankowski Algorithmica'10; Bosek et al. FOCS'14]. Our improvements stem mostly from the ability to use fast matrix multiplication ``one more time'', to maintain a certain transformation matrix which could be maintained only combinatorially previously (i.e. without fast matrix multiplication). Oddly, unlike other dynamic problems where this approach, once successful, could be repeated several times (``bootstrapping''), our conjectures imply that this is not the case for dynamic matrix inverse and some related problems. However, when a small additional ``look-ahead'' information is provided we can perform such repetition to drive the bounds down further.

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

↑