Geometric and algebraic structure at infinity of discrete time linear periodic systems

AbstractA notion of structure at infinity for linear discrete time periodic system is proposed and investigated. In particular, two equivalent characterizations of such notion are given: a geometric one and an algebraic one. The first is based on an extension to the periodic case of the controlled invariant subspace algorithm, and the second is based on a newly developed periodic version of the structure algorithm. An application to a model matching problem is described