Abstract

ABSTRACTThis article presents a balancing‐based algorithm for reducing the complexity of structured discrete‐time linear time‐invariant (DT‐LTI) index‐2 descriptor systems. The proposed algorithm involves projecting the index‐2 system onto a hidden manifold, which converts it into a generalized system. However, this causes the system to lose its sparsity and become dense, which is impractical for large‐scale systems. To overcome this issue, the authors enhance the Smith‐based iterative method for solving discrete‐time algebraic Lyapunov equations, which allow for balanced truncation without explicitly forming the dense system. The proposed algorithm is shown to be efficient and robust through numerical simulations.

Full Text

Published Version

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 call

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.