SDD线性系统的一种近似对数时间求解器
A nearly-mlogn time solver for SDD linear systems
摘要:
提出了一种求解对称对角占优线性方程组的改进算法。在输入的$n\times n$对称对角占优矩阵$A$与$m$非零项目和一个矢量$b$,使$A\bar{x} = b$为一些(未知)矢量$\bar{x}$,我们的算法计算一个矢量$x$,使$||{x}-\bar{x}||_A < ε||\bar{x}||_A $ { $||\cdot||_A$表示A-范数}在时间$${\tilde O}(m\log n \log (1/ε)).$$求解器利用在一个标准的方式“预处理”链的逐步稀疏的图形。为了保证更快的运行时间,我们在构造链的算法上做了两方面的改进。新链利用了[Koutis,Miller,Peng,FOCS 2010]中给出的图稀疏化算法的先前未知属性,允许更强的预处理属性。我们还提出了一个算法的独立利益,构建近紧低拉伸生成树的时间$\tilde{O}(m\log{n})$,一个因素的$O(\log{n})$快于算法[亚伯拉罕,Bartal,内曼,FOCS 2008]。这种加速直接反映在预处理链的构建时间上。
英文摘要:
We present an improved algorithm for solving symmetrically diagonally dominant linear systems. On input of an $n\times n$ symmetric diagonally dominant matrix $A$ with $m$ non-zero entries and a vector $b$ such that $A\bar{x} = b$ for some (unknown) vector $\bar{x}$, our algorithm computes a vector $x$ such that $||{x}-\bar{x}||_A < ε||\bar{x}||_A $ {$||\cdot||_A$ denotes the A-norm} in time $${\tilde O}(m\log n \log (1/ε)).$$ The solver utilizes in a standard way a `preconditioning' chain of progressively sparser graphs. To claim the faster running time we make a two-fold improvement in the algorithm for constructing the chain. The new chain exploits previously unknown properties of the graph sparsification algorithm given in [Koutis,Miller,Peng, FOCS 2010], allowing for stronger preconditioning properties. We also present an algorithm of independent interest that constructs nearly-tight low-stretch spanning trees in time $\tilde{O}(m\log{n})$, a factor of $O(\log{n})$ faster than the algorithm in [Abraham,Bartal,Neiman, FOCS 2008]. This speedup directly reflects on the construction time of the preconditioning chain.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。