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

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

作　　者：储德林[1] 蔡大用[1] 

机构地区：[1]清华大学

出　　处：《数值计算与计算机应用》1992年第2期145-151,共7页Journal on Numerical Methods and Computer Applications

摘　　要：可控性计算是控制理论中研究较多的一个课题,近年来已引起了数值计算工作者的巨大兴趣.可控的数学定义如下: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.

关 键 词：控制论 可控性 稳定算法 

分 类 号：O231[理学—运筹学与控制论]