Descriptor Representations Without Direct Feedthrough Term

摘要

Descriptor representations are considered that are given by (E,A,B,C,D) with Dequal to 0. Minimality under external equivalence is characterized in terms of the matrices E,A,B and C. Also, transformations are given by which minimal (E,A,B,C) representations are related under external equivalence. The results are compared with similar results for representations with D not equal to 0; the transformations turn out to be more simple in the D equals 0 case. A realization procedure is given for obtaining a minimal (E,A,B,C) representation for a system that is given by autoregressive equations.