Designing linear distributed algorithms with memory for fast convergence
From MaRDI portal
Publication:2862014
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
- scientific article; zbMATH DE number 3139993 (Why is no real title available?)
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- A new focus in the science of networks: towards methods for design
- An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs
- Convergence speed in distributed consensus and averaging
- Scaling: a canonical design problem for networks
- Second-degree iterative methods for the solution of large linear systems
- Stabilization with decentralized feedback control
- The Design of Multi-Lead-Compensators for Stabilization and Pole Placement in Double-Integrator Networks
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)