Adding a Single State Memory Optimally Accelerates Symmetric Linear Maps

DOI10.1109/TAC.2016.2516247MaRDI QIDQ2980289zbMATH OpenOpenAlexFDO

Authors Alain Sarlette

Publication date 3 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.0402

Mathematics Subject Classification ID

Applications of difference equations (39A60) Feedback control (93B52) Discrete-time control/observation systems (93C55) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05)

Abstract: Previous papers have proposed to add memory registers to the dynamics of discrete-time linear systems in order to accelerate their convergence. In particular, it has been proved that adding one memory slot per agent allows faster convergence towards average consensus. We here prove that this situation emph{cannot} be improved by adding more memory slots, when the knowledge about the self-adjoint linear map to be accelerated reduces to bounds on its extreme eigenvalues.

Cited in

(4)

• Characterizing limits and opportunities in speeding up Markov chain mixing
• An accelerated distributed gradient method with local memory
• Linear time average consensus and distributed optimization on fixed graphs
• Adaptive event-triggered consensus control of multi-agent systems with prescribed performance and input quantization

This page was built for publication: Adding a Single State Memory Optimally Accelerates Symmetric Linear Maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980289)