Designing linear distributed algorithms with memory for fast convergence
From MaRDI portal
Publication:2862014
DOI10.1002/RNC.1778zbMATH Open1274.93014OpenAlexW1593017780MaRDI QIDQ2862014FDOQ2862014
Authors: Sandip Roy, Yan Wan, Mengran Xue, 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
Recommendations
- Exponential convergence of a distributed algorithm for solving linear algebraic equations
- Continuous distributed algorithms for solving linear equations in finite time
- Distributed fixed point method for solving systems of linear algebraic equations
- A distributed algorithm for efficiently solving linear equations and its applications (special issue JCW)
- Decentralized gradient algorithm for solution of a linear equation
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)
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)
