Block checker/diagonal transformation matrices, their properties, and the interplay with fast-lifting
Tomomichi Hagiwara · International Journal of Systems Science · 2010
This article introduces what we call block checker matrices with some specific structures characterised by a set of integers, and then introduces the permutation matrices called block checker/diagonal (BCD) transformation matrices that relate block checker matrices with block diagonal matrices through similarity transformations. The study is motivated by the importance of the fast-lifting technique in control theory, especially in the study of sampled-data systems and time-delay systems. More precisely, it is partly motivated by the desire for alleviating the bother of describing the class of the matrices commuting with block diagonal matrices, and for such a purpose the permutation with BCD transformation matrices is helpful. The study further extends to investigating the various useful properties among BCD transformation matrices, as well as their interplay relations with various variants of fast-lifting, e.g. full-vector fast-lifting and subvector-wise fast-lifting, or one-stage fast-lifting and two-stage fast-lifting. The usefulness of the results in the context of the fast-lifting treatment is also suggested.