arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.1693math.NAcs.DScs.NA
收藏

计算对称对角占优矩阵的对数行列式近线性时间

Computing the log-determinant of symmetric, diagonally dominant matrices in near-linear time

University of California, Berkeley(加州大学伯克利分校)

Timothy Hunter, Ahmed El Alaoui, Alexandre Bayen

AI总结:

本文提出新算法计算对称对角占优矩阵的对数行列式,时间复杂度接近线性,优于传统三次方算法。

摘要:

我们提出新的算法用于计算对称对角占优矩阵的对数行列式。现有算法在最坏情况下具有三次方复杂度。我们的算法在非零条目数量近线性时间内以高概率计算近似对数行列式。该算法基于Spielman和Teng为拉普拉斯矩阵引入的超稀疏近似,最终使用Koutis、Miller和Peng在求解线性系统上下文中的改进版本。我们还提出更简单的算法,用于计算上界和下界,并可能更适用于实际应用。

英文摘要:

We present new algorithms for computing the log-determinant of symmetric, diagonally dominant matrices. Existing algorithms run with cubic complexity with respect to the size of the matrix in the worst case. Our algorithm computes an approximation of the log-determinant in time near-linear with respect to the number of non-zero entries and with high probability. This algorithm builds upon the utra-sparsifiers introduced by Spielman and Teng for Laplacian matrices and ultimately uses their refined versions introduced by Koutis, Miller and Peng in the context of solving linear systems. We also present simpler algorithms that compute upper and lower bounds and that may be of more immediate practical interest.

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

↑