Graph Theoretic Methods for the Computation of Disturbance Decoupling FeedbackMatrices for Structured Systems

摘要

Structured systems for which the disturbance decoupling problem is known to begenerically solvable are considered. It is recalled how this generic solvability is in one-one correspondence with certain properties of the graph representing the structure of the system. 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 the case of sparse system matrices.