Efficient diagonalization of symmetric matrices associated with graphs of small treewidth

Martin Fürer, Carlos Hoppen, Vilmar Trevisan

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,\dots ,n\}$ such that disti…