Designing linear distributed algorithms with memory for fast convergence

DOI10.1002/rnc.1778zbMath1274.93014OpenAlexW1593017780MaRDI QIDQ2862014

Sandip Roy, Mengran Xue, Yan Wan, Ali Saberi

Publication date: 13 November 2013

Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rnc.1778

zbMATH Keywords

distributed algorithmsnumerical algorithmslarge-scale networksdecentralized control theory

Mathematics Subject Classification ID

Decentralized systems (93A14) Large-scale systems (93A15)

Related Items

Two fault-tolerant control problems for multiple-integrator networks ⋮ Fault-Tolerant Stabilization in Discrete-Time Multiple-Integrator Networks with General Information Sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Second-degree iterative methods for the solution of large linear systems
• Stabilization with decentralized feedback control
• Convergence Speed in Distributed Consensus and Averaging
• The Design of Multi-Lead-Compensators for Stabilization and Pole Placement in Double-Integrator Networks
• Scaling: a canonical design problem for networks
• A new focus in the science of networks: towards methods for design
• An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs