Abstract

For a linear time-invariant system x˙(t)=Ax(t)+Bu(t), the Kronecker canonical form (KCF) of the matrix pencil (sI−A|B) provides the controllability indices, also called column minimal indices, of the system and their sum corresponds to the dimension of the controllable subspace. In this paper we introduce a fast numerical algorithm for computing the sets of column/row minimal indices of a singular pencil sF−G using a rank-updating technique and the properties of piecewise arithmetic progression sequences defined by the size of the null spaces of appropriate Toeplitz matrices. The method is demonstrated and tested on various data sets.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call