Rank decomposition in zero pattern matrix algebras.
From MaRDI portal
Recommendations
- Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs
- An integer programming problem and rank decomposition of block upper triangular matrices
- On the possible ranks among matrices with a given pattern
- Rank decomposition under combinatorial constraints
- Unions of rank/trace complete preorders
Cites work
- A structure theorem for some matrix algebras
- Algebras defined by patterns of zeros
- An integer programming problem and rank decomposition of block upper triangular matrices
- Echelon type canonical forms in upper triangular matrix algebras
- scientific article; zbMATH DE number 1574892 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Logarithmic residues in Banach algebras
- Sums of idempotents and logarithmic residues in zero pattern matrix algebras
Cited in
(6)- Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs
- Realization theory for poset-causal systems: controllability, observability and duality
- A partial order that is not rank/trace complete
- Unions of rank/trace complete preorders
- Additive decomposition of matrices under rank conditions and zero pattern constraints
- Rank decomposition and symmetric rank decomposition over arbitrary fields
This page was built for publication: Rank decomposition in zero pattern matrix algebras.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828830)
