.png){kind=icon}
返回
A Parallelizable Algorithm for Stabilizing Large Sparse Linear Systems With Uncertain Interconnections
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2022.3164250.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Sparse matrices
Decentralized control
Matrix decomposition
Linear systems
Large-scale systems
Topology
Stability analysis
Large-scale systems
reconfigurable interconnections
uncertainty
decentralized control
sparse matrices
block triangular structure
parallel graph theoretic decompositions
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏分享收藏Fatigue life assessment of concrete members under variable amplitude loading: An analytical approach
PREAI
分享收藏RECONSTRUCTION OF TRAUMATIC ABSENCE OF THE THUMB BY MICROVASCULAR FREE TISSUE TRANSFER FROM THE FOOT.png)
Hand Clinics
Hand ClinicsIF0
PREAI
分享收藏Stabilization of Networked Control Systems With Sparse Observer-Controller Networks具有稀疏观测器-控制器网络的网络控制系统的镇定
OAAI
OAAI分享收藏分享收藏
查看更多内容