Graph theoretic methods for the computation of disturbance decoupling feedback matrices for structured systems

AbstractStructured systems are considered for which the disturbance decoupling problem is known to be generically solvable. It is recalled how this generic solvability is in one-one correspondence with certain properties of the graph representing the structure of the system. Further, a graph oriented method is derived for the efficient computation of a feedback that actually solves the disturbance decoupling problem. It is believed that the method is especially useful in case of sparse system matrices. The method may also be advantageous in case some of the entries in the system matrices have an unknown value since the influence of the various entries is easy to establish