Abstract
In this paper structured systems are considered and the generic rank of the transfer matrix of such systems is introduced. It is shown that this rank equals the maximum number of vertex disjoint paths from the input vertices to the output vertices in the graph that can be associated to the structured system. This maximum number of disjoint paths can be calculated using techniques from combinatorics. As an application a structural version of the well-known almost disturbance decoupling problem is proposed.
Similar content being viewed by others
References
W. K. Chen,Applied Graph Theory, North-Holland, Amsterdam, 1971.
S. Even and R. E. Tarjan, Network flow and testing connectivity,SIAM J. Comput.,4 (1975), 507–518.
J. C. Willems, Almost invariant subspaces: An approach to high gain feedback design—Part I: Almost controlled invariant subspaces,IEEE Trans. Automat. Control,26 (1981), 235–252.
J. C. Willems, Almost invariant subspaces: An approach to high gain feedback design—Part II: Almost conditionally invariant subspaces,IEEE Trans. Automat. Control,27 (1982), 1071–1085.
W. M. Wonham,Linear Multivariable Control: a Geometric Approach, Springer-Verlag, New York, 1985.
Author information
Authors and Affiliations
Additional information
The results in this paper were obtained while the author was affiliated with the Centre for Mathematics and Computer Science in Amsterdam, The Netherlands.
Rights and permissions
About this article
Cite this article
van der Woude, J.W. A graph-theoretic characterization for the rank of the transfer matrix of a structured system. Math. Control Signal Systems 4, 33–40 (1991). https://doi.org/10.1007/BF02551379
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02551379