Graph-theoretical approach to qualitative solvability of linear systems
From MaRDI portal
Cites work
Cited in
(21)- Sign-nonsingular matrices and even cycles in directed graphs
- Regular and singular orthants of tridiagonal matrices
- Recursive structure of S-matrices and an O(m^ 2) algorithm for recognizing sign solvability
- A qualitative analysis of x=Ax+b
- When the sign pattern of a square matrix determines uniquely the sign pattern of its inverse
- Nonsingularity criteria for matrices involving combinatorial considerations
- On the recognition of \(S\)-systems
- On the hardness of efficiently approximating maximal non-\(L\) submatrices.
- On the digraphs of sign solvable linear systems
- Conditional sign-solvability
- Qualitative comparative statics and audits of model performance
- Special parity of perfect matchings in bipartite graphs
- A note on sign-solvability of linear system of equations
- Substitutes and Complements in Constrained Linear Models
- From qualitative matrices to quantitative restrictions
- Qualitative stability and solvability of difference equations
- Recognizing sign solvable graphs
- On signed digraphs with all cycles negative
- Robust economic models
- Signsolvability revisited
- Qualitatively invertible matrices
This page was built for publication: Graph-theoretical approach to qualitative solvability of linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1839015)