arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.02515cs.DScs.SCmath.CO
收藏

小树宽图对称矩阵的有效对角化

Efficient diagonalization of symmetric matrices associated with graphs of small treewidth

Martin Fürer, Carlos Hoppen, Vilmar Trevisan

摘要:

设$M=(m_{ij})$是$n$阶的对称矩阵,其元素位于任意域$\mathbb{F}$中,$G$是顶点集为$\{1,\ldots,n\}$的图,使得不同顶点$i$和$j$相邻当且仅当$m_{ij} \neq 0$ .我们引入了一个动态规划算法,找到一个对角矩阵,是全等$M$。如果$G$是以宽度为$k$的树分解$\mathcal{T}$给出的,那么这可以在时间$O(k|\mathcal{T}| + k^2 n)$中完成,其中$|\mathcal{T}|$表示$\mathcal{T}$中的节点数。除其他事项外,这允许计算行列式,秩和惯性的对称矩阵在时间$O(k|\mathcal{T}| + k^2 n)$。

英文摘要:

Let $M=(m_{ij})$ be a symmetric matrix of order $n$ whose elements lie in an arbitrary field $\mathbb{F}$, and let $G$ be the graph with vertex set $\{1,\ldots,n\}$ such that distinct vertices $i$ and $j$ are adjacent if and only if $m_{ij} \neq 0$. We introduce a dynamic programming algorithm that finds a diagonal matrix that is congruent to $M$. If $G$ is given with a tree decomposition $\mathcal{T}$ of width $k$, then this can be done in time $O(k|\mathcal{T}| + k^2 n)$, where $|\mathcal{T}|$ denotes the number of nodes in $\mathcal{T}$. Among other things, this allows one to compute the determinant, the rank and the inertia of a symmetric matrix in time $O(k|\mathcal{T}| + k^2 n)$.

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

↑