Discrete conservation laws and port-Hamiltonian systems on graphs and complexes

Details Discrete conservation laws and port-Hamiltonian systems on graphs and complexes Discrete conservation laws and port-Hamiltonian systems on graphs and complexes

2011-07-11

arxiv.org/abs/1107.2006v1

Mathematics

Optimization and Control

46 pages, 1 figure

Scientific paper

In this paper we present a unifying geometric framework for modeling various sorts of physical network dynamics as port-Hamiltonian systems. Basic idea is to associate with the incidence matrix of the graph a Dirac structure relating the flow and effort variables associated to the edges, internal vertices, and boundary vertices of the graph. This Dirac structure captures the basic conservation/balance laws of the system. Examples from different origins such as consensus algorithms and coordination control strategies for multi-agent systems share the same structure. The framework is extended to k-complexes primarily motivated by the discretization of continuous conservation laws.

Affiliated with

Also associated with

No associations

Rating

Discrete conservation laws and port-Hamiltonian systems on graphs and complexes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Discrete conservation laws and port-Hamiltonian systems on graphs and complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discrete conservation laws and port-Hamiltonian systems on graphs and complexes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137689