Abstract
Descriptor representations are considered that are given by ( E, A, B, C, D) with D = 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 transformations turn out to be more simple than in the “ D ≠ 0” case. Algorithms for rewriting an ( E, A, B, C, D) representation in ( E, A, B, C) form are also given. Finally, a realization procedure is presented for obtaining a minimal ( E, A, B, C) representation for a system that is given in polynomial matrix fractional form.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
