pith. sign in

arxiv: 1904.13067 · v1 · pith:RZ6ZCBPBnew · submitted 2019-04-30 · 🧮 math.OC

Distributed Solver for Discrete-Time Lyapunov Equations Over Dynamic Networks with Linear Convergence Rate

classification 🧮 math.OC
keywords convergencealgorithmconstantdiscrete-timedistributeddtledynamicequations
0
0 comments X
read the original abstract

This paper investigates the problem of solving discrete-time Lyapunov equations (DTLE) over a multi-agent system, where every agent has access to its local information and communicates with its neighbors. To obtain a solution to DTLE, a distributed algorithm with uncoordinated constant step sizes is proposed over time-varying topologies. The convergence properties and the range of constant step sizes of the proposed algorithm are analyzed. Moreover, a linear convergence rate is proved and the convergence performances over dynamic networks are verified by numerical simulations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.