Abstract
A general linear descriptor system Eitẋ = Ax + Bu, where E, A∈Cn, n, B∈Cn, mx∈Cn, u∈Cm, E singular, is called controllable if rank [αE − βA, B] = n for all (α, β) ≠ (0, 0), α, β∈C. Let f: Cn, n + m → Cn, n + m be a linear transformation form f(X) = CXD. We characterize all such linear transformations that leave the set C = {[αE − βA, B]|rank[αE− βA, B] = n∀(α, β)≠(0, 0), α, β∈C} invariant and show that only the well-known transformations that leave controllability invariant can occur.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.