No Detail Found!

Controllability of certain real symmetric matrices with application to controllability of graphs

Author(s)
Zoran Stanic Faculty of Mathematics, University of Belgrade,Studentski trg 16, 11 000 Belgrade,Serbia
Abstract
If M is an n n real symmetric matrix and b is a real vector of length n, then the pair (M; b) is said to be controllable if all the eigenvalues of M are simple and M has no eigenvector orthogonal to b. Simultaneously, we say that M is controllable for b. There is an extensive literature concerning controllability of specified matrices, and in the recent past the matrices associated with graphs have received a great deal of attention. In this paper, we restate some known results and establish new ones related to the controllability of similar, commuting or Gram matrices. Then we apply the obtained results to get an analysis of controllability of some standard matrices associated with (particular) graphs.
Publication Details
Page(s) 9-13
DOI DOI not available
Published Journal: Discrete Mathematics Letters, Volume: 3, Issue: 0, Year: 2020

Request the full text from PASTIC

Keywords
commuting matrices, eigenvalues and eigenvectors, similar matrices, Gram matrix, controllability
References
are determined,Aguilar C. O.,Gharesifard B.,Bapat R. B.,Cvetkovic D.,Rowlinson P.,Z P.,Godsil C. D.,Haemers W. H.,Omidi G. R.,Farrugia A.,Klamka J.,Merris R.,Rahmani A.,Ji M.,Mesbahi M.,Egerstedt M. .1998 .Controllability of multi-agent systems from a graph theoretic perspective. SIAM J. Control Optim., 278(2019) : 221-236.
Stanic Z.,M.-G. Yoon P.,Rowlinson Z. .2009 .Stanic´, Controllability of multy-agent dynamical systems with a broadcasting control signal. Asian J., 48 : 162-186.
.2014 .. Control, 16 : 1066-1072.
0

Citations

0

Downloads

15

Views