具有指定初等因子的最近矩阵多项式
Nearest matrix polynomials with a specified elementary divisor
摘要:
考虑了从给定的$n \times n$矩阵多项式的次数$k$到具有固定标量$λ_0$和$2 \leqslant r \leqslant kn$的初等因子$(λ-λ_0)^j, \, j \geqslant r,$的矩阵多项式的集合的距离的问题。证明了非正则多项式任意接近于具有所需初等因子的正则矩阵多项式。对于经常矩阵多项式的问题被证明是相当于找到最小的结构保持扰动,使一定的块Toeplitz矩阵变得适当的秩亏。然后通过两种不同的优化来表征距离。第一个表明,如果$λ_0$还不是矩阵多项式的特征值,那么该问题等价于计算结构化奇异值的广义概念。距离是通过BFGS和Matlab的全局搜索算法从第二次优化计算的。还推导了距离的上界和下界,并进行了数值实验,将它们与距离的计算值进行比较。
英文摘要:
The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(λ-λ_0)^j, \, j \geqslant r,$ for a fixed scalar $λ_0$ and $2 \leqslant r \leqslant kn$ is considered. It is established that polynomials that are not regular are arbitrarily close to a regular matrix polynomial with the desired elementary divisor. For regular matrix polynomials the problem is shown to be equivalent to finding minimal structure preserving perturbations such that a certain block Toeplitz matrix becomes suitably rank deficient. This is then used to characterize the distance via two different optimizations. The first one shows that if $λ_0$ is not already an eigenvalue of the matrix polynomial, then the problem is equivalent to computing a generalized notion of a structured singular value. The distance is computed via algorithms like BFGS and Matlab's globalsearch algorithm from the second optimization. Upper and lower bounds of the distance are also derived and numerical experiments are performed to compare them with the computed values of the distance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。