Scaling: a canonical design problem for networks

DOI10.1080/00207170701355069zbMath1133.93309OpenAlexW2140275778MaRDI QIDQ5423843

Sandip Roy, Ali Saberi

Publication date: 31 October 2007

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

Full work available at URL: https://doi.org/10.1080/00207170701355069

zbMATH Keywords

diagonal matricesgraph-algebralinear-algebraic formulation of the design problem of networks

Mathematics Subject Classification ID

Design techniques (robust design, computer-aided design, etc.) (93B51) Eigenvalue problems (93B60) Canonical structure (93B10)

Related Items

Constructing consensus controllers for networks with identical general linear agents ⋮ On time-scale designs for networks ⋮ Majorisations for the eigenvectors of graph-adjacency matrices ⋮ Fault-tolerant stabilisation in double-integrator 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 ⋮ Fault-Tolerant Stabilization in Discrete-Time Multiple-Integrator Networks with General Information Sharing ⋮ Designing linear distributed algorithms with memory for fast convergence

Cites Work

• Recent directions in matrix stability
• Decentralized control of linear multivariable systems
• Fast linear iterations for distributed averaging
• On the determination of a diagonal solution of the Lyapunov equation
• On the existence of positive diagonal<tex>P</tex>such that<tex>PA + A^{T}P < 0</tex>
• On the stabilization of decentralized control systems
• Stabilization with decentralized feedback control
• Information Flow and Cooperative Control of Vehicle Formations