Difference between revisions of "EECI08: Information Flow and Consensus"

From Murray Wiki
Jump to navigationJump to search
m (EECI: Information Flow and Consensus moved to EECI08: Information Flow and Consensus)
Line 1: Line 1:
{{eeci-sp08 header|next=[[NCS: Distributed Estimation and Control|Distributed Control]]|prev=[[NCS: Packet-Based Estimation and Control|Packet-Based Control]]}}
{{eeci-sp08 header|next=[[EECI08: Distributed Estimation and Control|Distributed Control]]|prev=[[EECI08: Packet-Based Estimation and Control|Packet-Based Control]]}}

Latest revision as of 20:26, 1 March 2009

Prev: Packet-Based Control Course home Next: Distributed Control

This lecture gives an introduction to some concepts and tools in graph theory. After giving the basic definitions of graphs and properties of graphs, we introduce the Laplacian of a matrix and discuss its properties and uses. Special emphasis is placed on the eigenvalues of the Laplacian, including the bounding of those eigenvalues using the Gershgorin disk theorem. The consensus problem is introduced as an example of the use of the basic concepts.

Lecture Materials