arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1901.01285math.OC
收藏

基于Gramian的有向网络模型约简

Gramian-Based Model Reduction of Directed Networks

Xiaodong Cheng, Jacquelien M. A. Scherpen

摘要:

研究了线性有向网络系统的模型降阶问题,其中节点间的互连关系用一般弱连通有向图描述。首先,给出了半稳定系统的伪能控性和伪能观性Gramian的定义,并用类Lyapunov方程刻画了它们的解。然后,我们引入了一个概念的顶点clusterability,以保证有界的近似误差,并使用新提出的Gramians,以方便评估每对顶点的相异性。提出了一种聚类算法,生成一个合适的图聚类,其特征矩阵被用作Petrov-Galerkin约简框架中的投影。所得到的降阶系统保持了弱连通有向网络结构,逼近误差由伪Gramian计算。最后通过数值算例说明了该方法的有效性。

英文摘要:

This paper investigates a model reduction problem for linear directed network systems, in which the interconnections among the vertices are described by general weakly connected digraphs. First, the definitions of pseudo controllability and observability Gramians are proposed for semistable systems, and their solutions are characterized by Lyapunov-like equations. Then, we introduce a concept of vertex clusterability to guarantee the boundedness of the approximation error and use the newly proposed Gramians to facilitate the evaluation of the dissimilarity of each pair of vertices. An clustering algorithm is thereto provided to generate an appropriate graph clustering, whose characteristic matrix is employed as the projections in the Petrov-Galerkin reduction framework. The obtained reduced-order system preserves the weakly connected directed network structure, and the approximation error is computed by the pseudo Gramians. Finally, the efficiency of the proposed approach is illustrated by numerical examples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑