A Caltech Library Service

On matrix factorization and scheduling for finite-time average-consensus


Ko, Chih-Kai (2010) On matrix factorization and scheduling for finite-time average-consensus. Dissertation (Ph.D.), California Institute of Technology.


We study the problem of communication scheduling for finite-time average-consensus in arbitrary connected networks. Viewing this consensus problem as a factorization of $\M$ by network-admissible families of matrices, we prove the existence of finite factorizations, provide scheduling algorithms for finite-time average consensus, and derive almost tight lower bounds on the size of the minimal factorization.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:Finite-time average-consensus, matrix factorization, resource allocation, scheduling, algorithm
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Electrical Engineering
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Schulman, Leonard J.
Thesis Committee:
  • Doyle, John Comstock
  • Ho, Tracey C.
  • Low, Steven H.
  • Umans, Christopher M.
  • Schulman, Leonard J. (chair)
Defense Date:5 January 2010
Record Number:CaltechTHESIS:05022010-193157687
Persistent URL:
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:5763
Deposited By: Chih-Kai Ko
Deposited On:21 May 2010 15:55
Last Modified:22 Aug 2016 21:19

Thesis Files

PDF - Final Version
See Usage Policy.


Repository Staff Only: item control page