拉普拉斯矩阵
舒尔补语
理论计算机科学
补语(音乐)
拉普拉斯算子
基质(化学分析)
计算机科学
还原(数学)
代数数
数学
拓扑(电路)
图形
算法
组合数学
几何学
物理
表型
基因
数学分析
特征向量
复合材料
量子力学
生物化学
化学
互补
材料科学
作者
Florian Dörfler,Francesco Bullo
出处
期刊:IEEE Transactions on Circuits and Systems I-regular Papers
[Institute of Electrical and Electronics Engineers]
日期:2013-01-01
卷期号:60 (1): 150-163
被引量:491
标识
DOI:10.1109/tcsi.2012.2215780
摘要
Consider a weighted undirected graph and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a specified subset of nodes. The Kron reduction process is ubiquitous in classic circuit theory and in related disciplines such as electrical impedance tomography, smart grid monitoring, transient stability assessment, and analysis of power electronics. Kron reduction is also relevant in other physical domains, in computational applications, and in the reduction of Markov chains. Related concepts have also been studied as purely theoretic problems in the literature on linear algebra. In this paper we analyze the Kron reduction process from the viewpoint of algebraic graph theory. Specifically, we provide a comprehensive and detailed graph-theoretic analysis of Kron reduction encompassing topological, algebraic, spectral, resistive, and sensitivity analyses. Throughout our theoretic elaborations we especially emphasize the practical applicability of our results to various problem setups arising in engineering, computation, and linear algebra. Our analysis of Kron reduction leads to novel insights both on the mathematical and the physical side.
科研通智能强力驱动
Strongly Powered by AbleSci AI