Javascript must be enabled for the correct page display

Strong Structural Controllability of Systems on Colored Graphs

Baar, Wouter (2018) Strong Structural Controllability of Systems on Colored Graphs. Master's Thesis / Essay, Applied Mathematics.

[img]
Preview
Text
mAppM_2018_BaarW.pdf

Download (401kB) | Preview
[img] Text
Toestemming.pdf
Restricted to Registered users only

Download (81kB)

Abstract

In this thesis, strong structural controllability of networks on graphs is studied. In the study of strong structural controllability it is often assumed that the parameters appearing in the pattern matrix of the qualitative class are independent. In this thesis, we allow appearances of the same parameter in different locations, which leads to a constrained qualitative class. Networks with this underlying structure are represented by so-called colored graphs. Sufficient conditions for strong structural controllability of the systems associated with these colored graphs are given, by means of perfect matchings and balancing sets.

Item Type: Thesis (Master's Thesis / Essay)
Supervisor:
Supervisor nameSupervisor E mail
Trentelman, H.L.H.L.Trentelman@rug.nl
Degree programme: Applied Mathematics
Thesis type: Master's Thesis / Essay
Language: English
Date Deposited: 18 May 2018
Last Modified: 06 Jul 2018 06:08
URI: http://fse.studenttheses.ub.rug.nl/id/eprint/17243

Actions (login required)

View Item View Item