Abstract
In this paper we propose a matrix minimization algorithm for linear, time-invariant, implicit ( E, A, B, C) descriptions of the type: Ex( t) = Ax( t) + Bu( t); y( t) = Cx( t). Given the initial matrices ( E, A, B, C), we obtain an externally equivalent minimal realization ( E m , A m , B m , C m ) after applying a matricial procedure based on maximal, row and column, compressions.
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.
