On the Optimal Laplacian Jordan Structure for Synchronizability
Luca Dieci, Cinzia Elia, Alessandro Pugliese
Abstract
In this work, for a network of differential equations with a prescribed graph structure, our goal is to show how to select the Laplacian of the network in order to obtain the most favorable outcome insofar as synchronizability. That is, we will want to: (i) guarantee asymptotic stability of a synchronous solution (as measured by a negative value of the master stability function), (ii) minimize the normalized spread of the Laplacian eigenvalues, and (iii) have a transient as short as possible. Within the class of tridiagonal Laplacians, we give both necessary and sufficient conditions for satisfying our three criteria above, and give extension to banded Laplacians as well. Finally, we give extensive numerical results to elucidate our theoretical results and to compare to existing works.
Create a lesson
Related papers
Level-Set Geometry and the Theoretical Performance of PDHG for Conic Linear Optimization
Zikai Xiong, Robert M. Freund
Trajectory Manifolds for Nonlinear Data-Enabled Predictive Control
Arda Bayer
Optimizing Lyapunov Certificates via Stability-Preserving Quadratization for Polynomial Systems
Yubo Cai, Gioele Zardini
Regularity of a Multidimensional Principal-Agent Problem with Separable Effort Costs
Shuaijie Qian, Guan Qiao
Near-Optimal Exact-Value Zeroth-Order Complexity for Smooth Strongly Convex Optimization
Wendao Wu, Haihan Zhang, Chenheng Zhang et al.
A VU-calculus for composite functions and the U-Hessian of partly smooth functions
Shuai Liu