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

Laplacian线性方程组对偶随机Kaczmarz解算器的潜力评估

Evaluating the Potential of a Dual Randomized Kaczmarz Solver for Laplacian Linear Systems

Erik G. Boman, Kevin Deweese, John R. Gilbert

摘要:

Kelner等人提出了一种求解Laplacian线性方程组的新方法,该方法涉及到图中基本圈的随机采样和更新。Kelner等人证明了这种方法复杂性的渐近界,但没有报告实验结果。我们寻求既评估这种方法的性能,并探讨在实践中改进它。我们比较这种方法的性能,其他拉普拉斯求解器在各种现实世界的图形。我们考虑不同的方式来提高这种方法的性能,通过探索不同的方式选择的周期和更新的顺序,提供更多的灵活性和潜在的并行性的目标。我们提出了一个并行模型的Kelner等人。方法,用于评估潜在的并行性在每次迭代更新的边缘的跨度。我们提供的实验结果比较潜在的并行性的基本周期的基础和我们的扩展周期集。我们的初步实验表明,选择一个非基本的一组周期可以节省显着的工作相比,一个基本的周期的基础。

英文摘要:

A new method for solving Laplacian linear systems proposed by Kelner et al. involves the random sampling and update of fundamental cycles in a graph. Kelner et al. proved asymptotic bounds on the complexity of this method but did not report experimental results. We seek to both evaluate the performance of this approach and to explore improvements to it in practice. We compare the performance of this method to other Laplacian solvers on a variety of real world graphs. We consider different ways to improve the performance of this method by exploring different ways of choosing the set of cycles and the sequence of updates, with the goal of providing more flexibility and potential parallelism. We propose a parallel model of the Kelner et al. method, for evaluating potential parallelism in terms of the span of edges updated at each iteration. We provide experimental results comparing the potential parallelism of the fundamental cycle basis and our extended cycle set. Our preliminary experiments show that choosing a non-fundamental set of cycles can save significant work compared to a fundamental cycle basis.

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

↑