Dominant eigenvalue minimization with trace preserving diagonal perturbation: subset design problem
From MaRDI portal
Publication:1640253
DOI10.1016/J.AUTOMATICA.2017.12.007zbMATH Open1387.93079OpenAlexW2776965680MaRDI QIDQ1640253FDOQ1640253
Authors: J. 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
Recommendations
- Dominant eigenvalues under trace-preserving diagonal perturbations
- Optimization of the spectral radius of nonnegative matrices
- Maximizing the spectral radius of fixed trace diagonal perturbations of nonnegative matrices
- On Maximizing the Minimum Eigenvalue of a Linear Combination of Symmetric Matrices
- Maximizing the smallest eigenvalue of a symmetric matrix: a submodular optimization approach
Basic linear algebra (15A99) Eigenvalue problems (93B60) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Title not available (Why is that?)
- Controllability of multi-agent systems from a graph-theoretic perspective
- The dominant eigenvalue of an essentially nonnegative tensor.
- Controllability Metrics, Limitations and Algorithms for Complex Networks
- Title not available (Why is that?)
- A Comparative Study of Algorithms for Matrix Balancing
- Line-sum-symmetric scalings of square nonnegative matrices
- Optimal Resource Allocation for Network Protection Against Spreading Processes
- Heterogeneity in multiple transmission pathways: modelling the spread of cholera and other waterborne disease in networks with a common water source
- Shorter Notes: Convexity of the Dominant Eigenvalue of an Essentially Nonnegative Matrix
- Maximizing the spectral radius of fixed trace diagonal perturbations of nonnegative matrices
- Kron Reduction of Graphs With Applications to Electrical Networks
- Security concepts for the dynamics of autonomous vehicle networks
- Observability of complex systems
- 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
- Sparse Resource Allocation for Linear Network Spread Dynamics
Cited In (4)
- Maximizing the smallest eigenvalue of a symmetric matrix: a submodular optimization approach
- Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method
- Control‐channel interactions in diffusive dynamical networks: A graph‐theoretic perspective
- Dominant eigenvalues under trace-preserving diagonal perturbations
This page was built for publication: Dominant eigenvalue minimization with trace preserving diagonal perturbation: subset design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640253)
