Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum

DOI10.1109/TCNS.2015.2428411zbMath1372.65104MaRDI QIDQ5358492

Themistoklis Charalambous, Mikael Johansson, Michael G. Rabbat, Christoforos N. Hadjicostis

Publication date: 21 September 2017

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (8)

A dynamical approach to efficient eigenvalue estimation in general multiagent networks ⋮ Exponential convergence of distributed optimization for heterogeneous linear multi-agent systems over unbalanced digraphs ⋮ Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems ⋮ Distributed algorithm for social cost minimization with second-order nonlinear dynamics over weight-unbalanced digraphs ⋮ Seeking strategy design for distributed nonsmooth games and its application ⋮ Finite-time general function consensus for multi-agent systems over signed digraphs ⋮ Distributed optimization over directed graphs with row stochasticity and constraint regularity ⋮ Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms

This page was built for publication: Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum