Document Type
Article
Publication Date
4-1-2022
Publisher
IEEE
Abstract
This paper proposes a new method for permuting sparse matrices into an upper block triangular from. The algorithm is highly parallelizable, which makes it suitable for large-scale systems with uncertain interconnection patterns. In such cases, the proposed decomposition can be used to develop flexible decentralized control strategies that produce a different gain matrix whenever the configuration changes. Applications to interconnected microgrids and supply and demand networks are provided to illustrate the versatility of the proposed approach.
Recommended Citation
Zečević, A., & Khanbaghi, M. (2022). A Parallelizable Algorithm for Stabilizing Large Sparse Linear Systems With Uncertain Interconnections. IEEE Access, 10, 35888–35899. https://doi.org/10.1109/ACCESS.2022.3164250
Comments
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https:// creativecommons.org/licenses/by/ 4.0/).