Rank decomposition under zero pattern constraints and L-free directed graphs
DOI10.1016/J.LAA.2021.03.010zbMATH Open1464.15002OpenAlexW3134624588MaRDI QIDQ2020704FDOQ2020704
Authors: Torsten Ehrhardt, Harm Bart, B. Silbermann
Publication date: 24 April 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.03.010
Recommendations
- Rank decomposition in zero pattern matrix algebras.
- L-free directed bipartite graphs and echelon-type canonical forms
- Rank decomposition under combinatorial constraints
- An integer programming problem and rank decomposition of block upper triangular matrices
- scientific article; zbMATH DE number 741201
integer programmingadditive decompositionrank constraints\(\mathsf{L}\)-free graphblock (upper triangular) matricesdirected (bipartite) graphzero pattern constraints
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Partial orders, general (06A06) Integer programming (90C10) Canonical forms, reductions, classification (15A21) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A structure theorem for some matrix algebras
- Logarithmic residues in Banach algebras
- Logarithmic residues, generalized idempotents, and sums of idempotents in Banach algebras
- An integer programming problem and rank decomposition of block upper triangular matrices
- Sums of idempotent matrices
- Sums of idempotents and logarithmic residues in zero pattern matrix algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- When is a matrix a sum of idempotents?
- Title not available (Why is that?)
- Algebras defined by patterns of zeros
- Logarithmic residues, Rouché's theorem, and spectral regularity: The \(C^{\ast}\)-algebra case
- N-free posets as generalizations of series-parallel posets
- Unions of rank/trace complete preorders
- L-free directed bipartite graphs and echelon-type canonical forms
- How small can a sum of idempotents be?
- A partial order that is not rank/trace complete
- Rank decomposition in zero pattern matrix algebras.
- Echelon type canonical forms in upper triangular matrix algebras
Cited In (4)
This page was built for publication: Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020704)