• 论文 • 上一篇    下一篇

“Descriptor”系统可控性计算的稳定算法

储德林,蔡大用   

  1. 清华大学 ;清华大学
  • 出版日期:1992-02-20 发布日期:1992-02-20

储德林,蔡大用. “Descriptor”系统可控性计算的稳定算法[J]. 数值计算与计算机应用, 1992, 13(2): 145-151.

A STABLE ALGORITHM FOR COMPUTING CONTROLLABILITY RELATED TO“DESCRIPTOR”SYSTEMS

  1. Chu De-lin;Cai Da-yong Tsinghua University
  • Online:1992-02-20 Published:1992-02-20
可控性计算是控制理论中研究较多的一个课题,近年来已引起了数值计算工作者的巨大兴趣.可控的数学定义如下:
In this paper, the controllability problem related to "Descriptor" systems is considered. Astable algorithm is given. Theoretical analysis and a numerical example show that the algorithmis very effective for compuing controllability of "Descriptor" systems, and can be used to com-pare controllablity of linear-invariant systems by applying the precondition techniques.
()

[1] C. C. Paige, Properties of Numerical Algorithms Related to Controllability, IEEE Trans. Auto. Contr.,ACC-26(1981) ,pp. 130-138.
[2] J. H. Wilkinson, The Algebraic eigenvalue Problem, London: Oxford, Univ. Press, 1965.
[3] P. Van. Dooren, The Generalized Eigenstructure Problem Applications in Linear System Theorey, Ph. D.Dissertation, Katholieke Univ. Leuven, Leuven, Belgium, 1979.
[4] M. L. J. Hautus, Controllability and Observaility For a Linear System, in Procc. Kon. Ned. Akad.Wetensh. Ser. A., Vol 72(1969) , pp 433-448.
[5] W. M. Wonhan, Linear Multivariable Control A Geometric Approach Spring-Verlag, Beerlin, Heidelberg,New York, 1979.
[6] D. G. Luenberger, Introduction to Dynamic System, New York: Wiley, 1981.
[7] R. F. Sincovec, A. M. Erisman, E. L. Yip, M. A. Epton, Analysis of Descriptor Systems Using Numerical Algorithms,IEEE Trans. Auto. Contr., Ac-26(1981) . pp 139-147.
[8] 储德林,计算可控性的稳定算法,待发表.
No related articles found!
阅读次数
全文


摘要