• DocumentCode
    3294018
  • Title

    On matrix factorization and finite-time average-consensus

  • Author

    Ko, Chih-Kai ; Gao, Xiaojie

  • Author_Institution
    Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
  • fYear
    2009
  • fDate
    15-18 Dec. 2009
  • Firstpage
    5798
  • Lastpage
    5803
  • Abstract
    We study the finite-time average-consensus problem for arbitrary connected networks. Viewing this consensus problem as a factorization of 1/n11T by suitable families of matrices, we prove the existence of a finite factorization and provide tight bounds on the size of the minimal factorization by exhibiting finite-time average-consensus algorithms and bounding their runtimes. We also show that basic matrix theory yields insights into the structure of finite-time consensus algorithms.
  • Keywords
    algorithm theory; matrix decomposition; arbitrary connected networks; finite factorization; finite time average consensus algorithm; matrix factorization; matrix theory; minimal factorization; Convergence; Distributed computing; Equations; Fluctuations; Oscillators; Runtime; Satellites; Stochastic processes; Temperature sensors; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on
  • Conference_Location
    Shanghai
  • ISSN
    0191-2216
  • Print_ISBN
    978-1-4244-3871-6
  • Electronic_ISBN
    0191-2216
  • Type

    conf

  • DOI
    10.1109/CDC.2009.5399577
  • Filename
    5399577
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3294018