抄録
In this paper, a solvability condition of an exact model matching problem for a structurd descriptor system is studied by using a graph theory.
Several researche studies have been carried out disturbance decoupling conditions for a structurd system in a state space form. Normally, a state space form is obtained by a system transformation of a descriptor form; however, representations of mathematical structures do not have physical structures of a real system if there exists dependencies between elemant of matrices on the transformation procedure. Thus we discuss the structured descriptor system in here.
Firstly, we consider a solvability condition of the disturbance decoupling problem for the descriptor system, and formulate an exact model matching problem. Finally, we apply the result of structural disturbance decoupling problem to the exact model matching problem for a structured descriptor system, and show its solvability condition.
