Recursive structure of S-matrices and an \(O(m^ 2)\) algorithm for recognizing sign solvability

DOI10.1016/0024-3795(87)90347-8zbMath0628.65034OpenAlexW2000044784MaRDI QIDQ1093326

Victor Klee

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(87)90347-8

zbMATH Keywords

algorithmsS-matrixrecursive structureS-star matrixstrong sign solvability of linear systems

Mathematics Subject Classification ID

Related Items (11)

A qualitative analysis of \(\dot x=Ax+b\) ⋮ Qualitative comparative statics ⋮ Mixed dominating matrices ⋮ Detecting stable matrices ⋮ Conditional \(S\)-matrices. ⋮ Sign-solvable linear complementarity problems ⋮ Robust economic models ⋮ Affine semigroup rings that are complete intersections ⋮ Mixed matrices and binomial ideals ⋮ On the recognition of \(S\)-systems ⋮ Rectangular \(L\)-matrices

Cites Work

• Recognizing sign solvable graphs
• Signsolvability revisited
• Graph-theoretical approach to qualitative solvability of linear systems
• The Theory of Qualitative Linear Systems
• Qualitative Economics and the Scope of the Correspondence Principle
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item

This page was built for publication: Recursive structure of S-matrices and an \(O(m^ 2)\) algorithm for recognizing sign solvability