优化对称矩阵的Gershgorin算法
Optimizing Gershgorin for Symmetric Matrices
摘要:
Gershgorin圆定理是一个众所周知的和有效的方法,用于根据其元素来界定矩阵的特征值。如果$A$是一个对称矩阵,通过写作$A = B + x{\bf 1}$,其中${\bf 1}$是具有单位元的矩阵,我们考虑了选择$x$给出$B$特征值的最优Gershgorin界的问题,从而导致$A$特征值的单侧界.我们表明,这$x$可以找到一个有效的线性规划(其解决方案可以在可能的情况下被写在封闭的形式),我们表明,对于大类矩阵,这种移位方法击败所有现有的分段线性或二次的特征值的界限。我们还将这种转移的范例,一些非线性估计,并表明在一定的对称性,这也会产生一个听话的线性规划。作为应用,我们给出了邻接矩阵的最低特征值的一个新的界,并研究了这种方法在获得某些矩阵的特征值估计方面的有效性.
英文摘要:
The Gershgorin Circle Theorem is a well-known and efficient method for bounding the eigenvalues of a matrix in terms of its entries. If $A$ is a symmetric matrix, by writing $A = B + x{\bf 1}$, where ${\bf 1}$ is the matrix with unit entries, we consider the problem of choosing $x$ to give the optimal Gershgorin bound on the eigenvalues of $B$, which then leads to one-sided bounds on the eigenvalues of $A$. We show that this $x$ can be found by an efficient linear program (whose solution can in may cases be written in closed form), and we show that for large classes of matrices, this shifting method beats all existing piecewise linear or quadratic bounds on the eigenvalues. We also apply this shifting paradigm to some nonlinear estimators and show that under certain symmetries this also gives rise to a tractable linear program. As an application, we give a novel bound on the lowest eigenvalue of a adjacency matrix in terms of the "top two" or "bottom two" degrees of the corresponding graph, and study the efficacy of this method in obtaining sharp eigenvalue estimates for certain classes of matrices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。