一个避免求解 Lyapunov 方程的简单极点配置增益矩阵 $K$
A simple pole-shifting gain matrix $K$ which avoids solving Lyapunov equations
AI总结:
针对可控对极点配置中求解 Lyapunov 方程计算量大的问题,提出一个显式增益矩阵 $K$,确保闭环矩阵特征值实部小于指定负值,避免求解该方程。
摘要:
众所周知,如果 $A\in\mathbb{C}^{N\times N}$ 和 $B\in\mathbb{C}^{N\times M}$ 构成可控对(即 Kalman 矩阵 $[B\\ |\\ AB\\ | \\ \dots\\ |\\ A^{N-1}B]$ 满秩),则存在 $K\in\mathbb{C}^{M\times N}$ 使得矩阵 $A+BK$ 的特征值均具有负实部。矩阵 $K$ 不唯一,通常由 Lyapunov 方程的解定义,当 $N$ 较大时,从计算角度来看不易处理。在本工作中,我们证明,对于一般矩阵 $A$ 和 $B$,若满足可控性 Kalman 秩条件,则 $$K=-\overline{B}^\top\sum_{k=1}^N\left[(\overline{A}^\top+γ_kI)^{-1}\right]\left\{\sum_{k=1}^N\left[(A+γ_kI)^{-1}B\overline{B}^\top(\overline{A}^\top+γ_kI)^{-1}\right]\right\}^{-1}$$ 可确保矩阵 $A+BK$ 的所有特征值实部小于 $-γ_1$。此处,$0<γ_1<γ_2<\dots<γ_N$ 为 $N$ 个正数,足够大以保证每个 $k$ 对应的 $A+γ_kI$ 可逆。
英文摘要:
It is well known that if $A\in\mathbb{C}^{N\times N}$ and $B\in\mathbb{C}^{N\times M}$ form a controllable pair (in the sense that the Kalman matrix $[B\ |\ AB\ | \ \dots\ |\ A^{N-1}B]$ has full rank) then, there exists $K\in\mathbb{C}^{M\times N}$ such that the matrix $A+BK$ has only eigenvalues with negative real parts. The matrix $K$ is not unique, and is usually defined by a solution of a Lyapunov equation, which, in case of large $N$, is not easily manageable from the computational point of view. In this work, we show that, for general matrices $A$ and $B$, if they satisfy the controllability Kalman rank condition, then $$K=-\overline{B}^\top\sum_{k=1}^N\left[(\overline{A}^\top+γ_kI)^{-1}\right]\left\{\sum_{k=1}^N\left[(A+γ_kI)^{-1}B\overline{B}^\top(\overline{A}^\top+γ_kI)^{-1}\right]\right\}^{-1}$$ ensures that the matrix $A+BK$ has all the eigenvalues with the real part less than $-γ_1$. Here, $0<γ_1<γ_2<\dots<γ_N$ are $N$ positive numbers, large enough such that $A+γ_kI$ is invertible, for each $k$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。