Modeling of physical network systems

DOI10.1016/J.SYSCONLE.2015.08.013zbMATH Open1358.93052arXiv1510.04984OpenAlexW2963209811MaRDI QIDQ518697FDOQ518697

Authors: Arjan van der Schaft 

Publication date: 30 March 2017

Published in: Systems \& Control Letters (Search for Journal in Brave)

Abstract: Conservation laws and balance equations for physical network systems typically can be described with the aid of the incidence matrix of a directed graph, and an associated symmetric Laplacian matrix. Some basic examples are discussed, and the extension to $k$-complexes is indicated. Physical distribution networks often involve a non-symmetric Laplacian matrix. It is shown how, in case the connected components of the graph are strongly connected, such systems can be converted into a form with balanced Laplacian matrix by constructive use of Kirchhoff's Matrix Tree theorem, giving rise to a port-Hamiltonian description. Application to the dual case of asymmetric consensus algorithms is given. Finally it is shown how the minimal storage function for physical network systems with controlled flows can be explicitly computed.

Full work available at URL: https://arxiv.org/abs/1510.04984

Recommendations

• Port-Hamiltonian systems on graphs
• Physical network systems and model reduction
• Structure-preserving model reduction of physical network systems
• Port-Hamiltonian systems: an introductory survey
• scientific article; zbMATH DE number 1816772

zbMATH Keywords

Laplacian matrixmatrix tree theoremport-Hamiltonian systemavailable storagephysical network

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Decentralized systems (93A14) Control/observation systems governed by ordinary differential equations (93C15) Applications of graph theory to circuits and networks (94C15) Transformations (93B17)

Cites Work

• Title not available (Why is that?)
• Dissipative dynamical systems. I: General theory
• Dissipative dynamical systems. II: Linear systems with quadratic supply rates
• Graph theoretic methods in multiagent networks
• Hamiltonian formulation of distributed-parameter systems with boundary energy flow
• Port-Hamiltonian systems on graphs
• Title not available (Why is that?)
• Port-Hamiltonian systems theory: an introductory overview
• Distributed algorithms for reaching consensus on general functions
• Structure and stability of certain chemical networks and applications to the kinetic proofreading model of T-cell receptor signal transduction
• The Behavioral Approach to Open and Interconnected Systems
• Scalable control of positive systems
• Laplacian dynamics on general graphs
• Discrete exterior geometry approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems
• Hamiltonian perspective on compartmental reaction-diffusion networks
• A graph-theoretical approach for the analysis and model reduction of complex-balanced chemical reaction networks
• Complex and detailed balancing of chemical reaction networks revisited
• Ports and terminals

Cited In (10)

• Zero dynamics and funnel control for linear electrical circuits
• Controllability-Gramian submatrices for a network consensus model
• Title not available (Why is that?)
• Evolution of social power over influence networks containing antagonistic interactions
• Port-Hamiltonian systems on graphs
• Structured identification for network reconstruction of RC-models
• Consensus dynamics with arbitrary sign-preserving nonlinearities
• Structure-preserving model reduction of physical network systems
• Title not available (Why is that?)
• Physical network systems and model reduction

This page was built for publication: Modeling of physical network systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q518697)