A Distributed Algorithm for Solving Positive Definite Linear Equations Over Networks With Membership Dynamics.

This paper considers the problem of solving a symmetric positive definite system of linear equations over a network of agents with arbitrary asynchronous interactions and membership dynamics. The latter implies that each agent is allowed to join and leave the network at any time, for infinitely many times, and lose all its memory upon leaving. We develop Subset Equalizing (SE), a distributed async...