Linear systems with signed solutions
Linear systems, \(Ax= b\), for which the sign patterns \(A\) and \(b\) completely determine the set of sign patterns of vectors in the solution set are studied. These systems generalize the existing notion of sign-solvable linear systems. Linear systems with signed solutions are characterized in terms of two classes of matrices. The first class of \(L\)-matrices, plays a central role in the study of sign-solvable linear systems. The second class is new and generalizes the class of \(S^*\)-matrices that arise in sign-solvable linear systems. Several constructions for the new class of matrices are given. After the introduction section, there are sections on signed null-spaces; characterization of signed null-spaces; systems with signed solutions; and signed row-space.
- On sign inconsistent linear systems
- Some properties of matrices with signed null spaces.
- On the digraphs of sign solvable linear systems
- Conditional sign-solvability
- Set-systems with signed solutions
- A NOTE ON PARTIAL SIGN-SOLVABILITY
- Characterizations of matrices with nonzero signed row compound
- A combinatorial characteristic of CS-matrices
- Sign-consistency and solvability of constrained linear systems
- Sign-Solvable Cone-Systems
- Least Squares Sign-Solvability
- scientific article; zbMATH DE number 825098 (Why is no real title available?)
- On signed spaces
- scientific article; zbMATH DE number 2219152 (Why is no real title available?)
- scientific article; zbMATH DE number 2219198 (Why is no real title available?)
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- Linear solving for sign determination
- On matrices which have signed null-spaces
- Solving linear programs from sign patterns
- Sign-solvable linear complementarity problems
This page was built for publication: Linear systems with signed solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579511)
