Designing linear distributed algorithms with memory for fast convergence

DOI10.1002/RNC.1778zbMATH Open1274.93014OpenAlexW1593017780MaRDI QIDQ2862014FDOQ2862014

Sandip Roy, Ali Saberi, Mengran Xue, Yan Wan

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)

Cites Work

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

Cited In (2)

• Two fault-tolerant control problems for multiple-integrator networks
• Fault-tolerant stabilization in discrete-time multiple-integrator networks with general information sharing

This page was built for publication: Designing linear distributed algorithms with memory for fast convergence

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