%0 Generic %1 Dorfler2011Kron %A Dörfler, Florian %A Bullo, Francesco %D 2011 %J arXiV > math.CO %K 05c50-graphs-and-linear-algebra 05c76-graph-operations 68r10-computer-science-graph-theory 94c05-analytic-circuit-theory 94c15-circuits-networks-applications-of-graph-theory kron %N 2950 %T Kron Reduction of Graphs with Applications to Electrical Networks %U http://arxiv.org/abs/1102.2950 %V 1102 %X Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the 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 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 in power networks, or analysis and simulation of induction motors and power electronics. More general applications of Kron reduction occur in sparse matrix algorithms, multi-grid solvers, finite--element analysis, and Markov chains. The Schur complement of a Laplacian matrix and related concepts have also been studied under different names and as purely theoretic problems in the literature on linear algebra. In this paper we propose a general graph-theoretic framework for Kron reduction that leads to novel and deep insights both on the mathematical and the physical side. We show the applicability of our framework to various practical problem setups arising in engineering applications and computation. Furthermore, we provide a comprehensive and detailed graph-theoretic analysis of the Kron reduction process encompassing topological, algebraic, spectral, resistive, and sensitivity analyses. Throughout our theoretic elaborations we especially emphasize the practical applicability of our results.

@electronic{Dorfler2011Kron, abstract = {{Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the 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 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 in power networks, or analysis and simulation of induction motors and power electronics. More general applications of Kron reduction occur in sparse matrix algorithms, multi-grid solvers, finite--element analysis, and Markov chains. The Schur complement of a Laplacian matrix and related concepts have also been studied under different names and as purely theoretic problems in the literature on linear algebra. In this paper we propose a general graph-theoretic framework for Kron reduction that leads to novel and deep insights both on the mathematical and the physical side. We show the applicability of our framework to various practical problem setups arising in engineering applications and computation. Furthermore, we provide a comprehensive and detailed graph-theoretic analysis of the Kron reduction process encompassing topological, algebraic, spectral, resistive, and sensitivity analyses. Throughout our theoretic elaborations we especially emphasize the practical applicability of our results.}}, added-at = {2019-03-01T00:11:50.000+0100}, archiveprefix = {arXiv}, author = {D\"{o}rfler, Florian and Bullo, Francesco}, biburl = {https://www.bibsonomy.org/bibtex/21218522cff67a5346b141b37f3278da5/gdmcbain}, citeulike-article-id = {8829149}, citeulike-attachment-1 = {doerfler_11_kron.pdf; /pdf/user/gdmcbain/article/8829149/1140252/doerfler_11_kron.pdf; 3ad73f96cf5713152aa5a19a85dd87019d9c6e98}, citeulike-linkout-0 = {http://arxiv.org/abs/1102.2950}, citeulike-linkout-1 = {http://arxiv.org/pdf/1102.2950}, day = 15, eprint = {1102.2950}, file = {doerfler_11_kron.pdf}, interhash = {2d4cb51093718490e8904347d514406a}, intrahash = {1218522cff67a5346b141b37f3278da5}, journal = {arXiV > math.CO}, keywords = {05c50-graphs-and-linear-algebra 05c76-graph-operations 68r10-computer-science-graph-theory 94c05-analytic-circuit-theory 94c15-circuits-networks-applications-of-graph-theory kron}, month = feb, number = 2950, posted-at = {2018-07-10 03:17:50}, priority = {5}, timestamp = {2019-03-01T00:11:50.000+0100}, title = {{Kron Reduction of Graphs with Applications to Electrical Networks}}, url = {http://arxiv.org/abs/1102.2950}, volume = 1102, year = 2011 }