线性矩阵行列式的实根求法
Real root finding for determinants of linear matrices
摘要:
设$\A_0, \A_1, \ldots, \A_n$为具有有理系数的大小为$m$的方阵。本文主要研究实行列式簇$\{\X \in\RR^n \: :\: \det(\A_0+x_1\A_1+\cdots+x_n\A_n)=0\}$的连通分支中一点的精确计算。这样的问题发现在许多领域,如控制理论,计算几何,优化等,使用标准的复杂性结果,这个问题可以解决使用$m^{O(n)}$算术运算的应用。在对矩阵系数的一般性假设下,我们给出了一个求解该问题的算法,其运行时间在${{n+m}\choose{n}}^{3}$中基本上是二次的。我们还报告与计算机实现该算法的实验。它的实际性能说明了复杂性估计。特别是,我们强调,对于这个问题的子家庭,其中$m$是固定的,复杂性是多项式在$n$。
英文摘要:
Let $\A_0, \A_1, \ldots, \A_n$ be given square matrices of size $m$ with rational coefficients. The paper focuses on the exact computation of one point in each connected component of the real determinantal variety $\{\X \in\RR^n \: :\: \det(\A_0+x_1\A_1+\cdots+x_n\A_n)=0\}$. Such a problem finds applications in many areas such as control theory, computational geometry, optimization, etc. Using standard complexity results this problem can be solved using $m^{O(n)}$ arithmetic operations. Under some genericity assumptions on the coefficients of the matrices, we provide an algorithm solving this problem whose runtime is essentially quadratic in ${{n+m}\choose{n}}^{3}$. We also report on experiments with a computer implementation of this algorithm. Its practical performance illustrates the complexity estimates. In particular, we emphasize that for subfamilies of this problem where $m$ is fixed, the complexity is polynomial in $n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。