This chapter introduces some basic definitions and results on graph theory, consensus decomposition of linear space theory, matrix theory, linear system theory, and singular system theory, which will be used in the following chapters. First, the definitions of directed graph, spanning tree, and Laplacian matrix, etc. are given, and properties of Laplacian matrix are addressed. Then the concepts of consensus subspace, complement consensus subspace, and state/output space decomposition are defined. Third, the properties of Kronecker product and Schur complement lemma are introduced. Moreover, the definitions and criteria for controllability, observability, and stability of linear time-invariant systems are summarized, and some results on partial stability of linear systems are also given. Finally, the definitions and results on the regularity, equivalent form, admissibility, and controllability of singular systems are introduced.
Singular System Theory Linear Space Theory Schur Complement Lemma Laplacian Matrix Spanning Tree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.
Ren W, Beard RW (2005) Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Trans Autom Control 50(5):655–661MathSciNetCrossRefzbMATHGoogle Scholar
Xi JX, Cai N, Zhong YS (2010) Consensus problems for high-order linear time-invariant swarm systems. Phys A 389(24):5619–5627CrossRefGoogle Scholar