The nondirect graph G(A) of an \(n\times n\)-matrix A is defined as a set of vertices \(\{\) 1,2,...,n\(\}\) and (i,j) is an edge of G(A) iff \(a_{ij}\neq 0\) or \(a_{ji}\neq 0\) (i\(\neq j)\). A matrix is called acyclic if its nondirected graph contains no cycles. The author finds necessary and sufficient conditions for an acyclic matrix A whose principal minors are nonnegative to be stable. The conditions are expressed in terms of G(A). Some conditions related to additive D-stable acyclic matrices are also given (A is called additive D-stable if \(D+\) is stable for every nonnegative diagonal matrix D).
- A Semi-Definite Lyapunov Theorem and the Characterization of Tridiagonal D-Stable Matrices
- Characterization of acyclic D-stable matrices
- Controllability, inertia, and stability for tridiagonal matrices
- scientific article; zbMATH DE number 3551822 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- Matrix Diagonal Stability and Its Implications
- Real, 3 x 3, D-stable matrices
- Second, third, and fourth order D-stability
- Stability of Multiple Markets: The Hicks Conditions
- Three types of matrix stability
- Recent directions in matrix stability
- Nonsingularity criteria for general combinatorially symmetric matrices
- On nonsingular acyclic M-matrices whose inverse is also acyclic
- scientific article; zbMATH DE number 3933235 (Why is no real title available?)
- Lyapunov diagonal semistability of acyclic matrices
- Maximal acyclic subgraphs and closest stable matrices
- Factoring matrices with a tree-structured sparsity pattern
- Qualitative stability of linear systems
- Characterization of acyclic D-stable matrices
This page was built for publication: Stability of acyclic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073134)
