应用科学学报 ›› 1983, Vol. 1 ›› Issue (1): 33-42.

• 论文 • 上一篇    下一篇

Rosenbrock最小实现算法的改进与发展

张钟俊1, 华兆麟1, 吴修敬1, 黄午阳2   

  1. 1. 上海交通大学;
    2. 上海市业余工业大学
  • 收稿日期:1982-01-04 出版日期:1983-03-31 发布日期:1983-03-31

AN IMPROVEMENT AND EXTENSION ON ROSENBROCK'S ALGORITHM FOR MINIMUM REALIZATION

ZHANG ZHONGJUN1, HUA ZHAOLIN1, WU XIOUJING1, HUANG WUYANG2   

  1. 1. Shanghai Jiao Tong University;
    2. Shanghai Part-time Institute of Technology
  • Received:1982-01-04 Online:1983-03-31 Published:1983-03-31

摘要: 在研究线性时不变多变量系统时,由已知的传递函数G(s)求得其最小实现是线性系统理论的基本问题之-.六十年代以来已发表了一些论文[1~5].
本文的一个内容是改进Rosenbrock的最小实现算法,以降低运算时矩阵的阶数和减少运算工作量.又由于Rosenbrock的最小实现算法所得到的不是标准形,所以本文的另一个内容是对获得Luenberger标准形提出一种算法.

Abstract: One of the fundamental problems in linear time-invariant multivariable system theory is to obtain minimum realization from a given transfer matrix. In this paper, Rosenbrock's algorithm for minimum realization is improved to reduce the order of the matrix polynomials of the transfer function matrix and to reduce the computing time. As the minimum realization so obtained is not in canonical form, the authors attempt to develop another algorithm to transform the first one into Luenberger's canonical form. Both algorithms are tested on DJS-130 computer.