.png){kind=icon}
返回
Sensitivity-based link addition for robust linear dynamical networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2021.02.034.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A link addition problem is considered for a directed linear network in order to improve the network robustness. The robustness of network is quantified through a well-known measure of stability margin. Optimal identification of links such that the stability margin is maximized by their addition, requires solving a complex combinatorial problem. Here two efficient methods are proposed for suboptimal link addition by exploiting the sensitivity being embedded in the derivative of singular value and Lagrange multiplier. Numerical tests are presented to demonstrate the efficacy of the proposed methods. ? 2021 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keyword:
DESIGN
CONSENSUS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.7
论文数:
6.4K
被引数:
1.5W
机构
引用论文
.png){kind=icon}
查看更多内容