A class of fast staircase algorithms for generalized state-space systems
Several methods are presented for defining generalized state space models (GSSM), with emphasis on 'fast' techniques for transforming GSSMs to condensed state space models (SSM). The fast forms are configured to yield invariant transfer functions. Details of the decomposition process are summarized in terms of the determination of eigenvalues which are separated within staircase matrices. Applications of the techniques are illustrated through implementation of a unimodular transformation which does not affect the finite eigenvalues, by demonstrating deadbeat control of a GSSM, which the definition of a reduced observer of a GSSM, and by embedding a polynomial matrix into a unimodular matrix.