Dominant eigenvalue minimization with trace preserving diagonal perturbation: subset design problem
From MaRDI portal
Publication:1640253
DOI10.1016/j.automatica.2017.12.007zbMath1387.93079OpenAlexW2776965680MaRDI QIDQ1640253
Jackeline Abad Torres, Sandip Roy
Publication date: 14 June 2018
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2017.12.007
Eigenvalue problems (93B60) Applications of graph theory to circuits and networks (94C15) Basic linear algebra (15A99)
Related Items
Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method ⋮ Control‐channel interactions in diffusive dynamical networks: A graph‐theoretic perspective
Cites Work
- Unnamed Item
- Unnamed Item
- Security concepts for the dynamics of autonomous vehicle networks
- Graph-theoretic analysis of network input-output processes: zero structure and its implications on remote feedback control
- Dominant eigenvalues under trace-preserving diagonal perturbations
- Line-sum symmetry via the DomEig algorithm
- Maximizing the spectral radius of fixed trace diagonal perturbations of nonnegative matrices
- The dominant eigenvalue of an essentially nonnegative tensor
- Heterogeneity in multiple transmission pathways: modelling the spread of cholera and other waterborne disease in networks with a common water source
- A Comparative Study of Algorithms for Matrix Balancing
- Line-sum-symmetric scalings of square nonnegative matrices
- Shorter Notes: Convexity of the Dominant Eigenvalue of an Essentially Nonnegative Matrix
- Kron Reduction of Graphs With Applications to Electrical Networks
- Observability of complex systems
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- Sparse Resource Allocation for Linear Network Spread Dynamics
- Controllability Metrics, Limitations and Algorithms for Complex Networks
- Optimal Resource Allocation for Network Protection Against Spreading Processes
