“Descriptor”系统极点配置问题的稳定算法

A STABLE ALGORITHM FOR POLE ASSIGNMENT RELATED TO DESCRIPTOR SYSTEMS

1.引 言 极点配置是控制理论中研究得较多的一个课题.近年来,引起了数值计算工作者浓厚的兴趣.极点配置问题的数学提法为 问题(P):给定矩阵 A∈R^(n×n),B∈R^(n×m),A={λ_1,…,λ_n},〈A,B〉可控。

In this paper, the pole assignment problem related to descriptor systems is considered. Astable algorithm is given. Firstly, the original problem is transformed into some independentlower dimension problems. Then, these lower dimension problems are solved. Finally, the al-gorithm given in this paper is illustrated by a numerical example.