GRAPH-THEORETIC METHODS FOR THE COMPUTATION OF DISTURBANCE DECOUPLINGFEEDBACK MATRICES FOR STRUCTURED SYSTEMS

Structured 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 properti es of the graph representing the structure of the system. Further, a g raph oriented method is derived for the efficient computation of a fee dback that actually solves the disturbance decoupling problem. It is b elieved that the method is especially useful in case of sparse system matrices. The method may also be advantageous in case some of the entr ies in the system matrices have an unknown value since the influence o f the various entries is easy to establish.