On Matrix Factorization and Scheduling for Finite-Time Average-Consensus

On Matrix Factorization and Scheduling for Finite-Time Average-Consensus

We study the problem of communication scheduling for finite-time average-consensus in arbitrary connected networks. Viewing this consensus problem as a factorization of 1/n 11<sup>T</sup> by network-admissible families of matrices, we prove the existence of finite factorizations, provid...

Full description

Bibliographic Details
Main Author: Ko, Chih-Kai
Format: Others
Published: 2010
Online Access:https://thesis.library.caltech.edu/5763/1/consensus.pdf
Ko, Chih-Kai (2010) On Matrix Factorization and Scheduling for Finite-Time Average-Consensus. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/GCT7-5Y66. https://resolver.caltech.edu/CaltechTHESIS:05022010-193157687 <https://resolver.caltech.edu/CaltechTHESIS:05022010-193157687>

Internet

https://thesis.library.caltech.edu/5763/1/consensus.pdf
Ko, Chih-Kai (2010) On Matrix Factorization and Scheduling for Finite-Time Average-Consensus. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/GCT7-5Y66. https://resolver.caltech.edu/CaltechTHESIS:05022010-193157687 <https://resolver.caltech.edu/CaltechTHESIS:05022010-193157687>

Similar Items