| 极点配置问题的一种简化算法 |
| |
| 引用本文： | 王翼.极点配置问题的一种简化算法[J].控制理论与应用,1985,2(1):117-121. |
| |
| 作者姓名： | 王翼 |
| |
| 作者单位： | 南开大学 |
| |
| 摘 要： | 本文提出极点配置问题的一个简化算法。该算法不需要计算控制系统的特征多项式,因此给实际计算带来方便。由于观测器的设计可化为极点配置问题,该算法也简化了观测器的设计。
|
| 收稿时间： | 4/6/1983 12:00:00 AM |
| 修稿时间： | 1984/4/20 0:00:00 |
A SIMPLIFIED ALGORITHM TO SOLVE THE PROBLEM OF POLE -ASSIGNMENT |
| |
| Wang Yi.A SIMPLIFIED ALGORITHM TO SOLVE THE PROBLEM OF POLE -ASSIGNMENT[J].Control Theory & Applications,1985,2(1):117-121. |
| |
| Authors: | Wang Yi |
| |
| Affiliation: | Nankai University |
| |
| Abstract: | In this paper, a simplified algorithm to solve the problem of pole-assignment in a linear time -invariant multivariable system is presented. Since this simplified algorithm requires no computation of the characteristics polynomial of the controlled system, it makes the practical calculation convenient.
Since the design of observer can be reduced to a pole-assignment problem, this algorithm also simplifies the procedure of observer design. |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《控制理论与应用》浏览原始摘要信息 |
|
点击此处可从《控制理论与应用》下载全文 |
|
