Network flows as least squares solvers for linear equations

Yang Liu, Youcheng Lou, Brian D.O. Anderson, Guodong Shi

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    6 Citations (Scopus)

    Abstract

    This paper presents a first-order continuous-time distributed step-size algorithm for computing the least squares solution to a linear equation over networks. Given the uniqueness of the solution and nonintegrable step size, the convergence results are provided for fixed graphs. For the nonunique solution and square integrable step size, the convergence is shown for constantly connected switching graphs. We also validate the results and illustrate possible impacts on the convergence speed using a few numerical examples.

    Original languageEnglish
    Title of host publication2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages1046-1051
    Number of pages6
    ISBN (Electronic)9781509028733
    DOIs
    Publication statusPublished - 28 Jun 2017
    Event56th IEEE Annual Conference on Decision and Control, CDC 2017 - Melbourne, Australia
    Duration: 12 Dec 201715 Dec 2017

    Publication series

    Name2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
    Volume2018-January

    Conference

    Conference56th IEEE Annual Conference on Decision and Control, CDC 2017
    Country/TerritoryAustralia
    CityMelbourne
    Period12/12/1715/12/17

    Fingerprint

    Dive into the research topics of 'Network flows as least squares solvers for linear equations'. Together they form a unique fingerprint.

    Cite this