摘要
给定线性系统(A,B),A∈R^(n×n),B∈R^(n×m),则可控性可以定义为: 定义:若rank(B AB…A^(n-1)B)=n,则(A,B)可控. 可控性是自动控制理论的重要概念,并已得到大量研究,产生了多种数值判别算法.然而正如C.C.Paige所分析,从数值计算的观点考虑,对大量已存在的算法需从数值稳定性的角度重新加以观察.首先考虑到计算误差的不可避免性。
In this paper, the controllability problem is considered, and a new algorithm is given. Thealgorithm is based on orthogonal transformation, and is possessed of the following characters:computational simplicity: Saving space: practicability and numerical stability. It is shown bya numerical example that the new algorithm is more effective than many existing algorithms.
出处
《数值计算与计算机应用》
CSCD
北大核心
1992年第1期1-6,共6页
Journal on Numerical Methods and Computer Applications
