An integer programming problem and rank decomposition of block upper triangular matrices
The background for this paper is formed by articles which deal with sums of idempotent elements in Banach algebras. For the general background the immediate motivation for this paper comes from a paper by \textit{H. Bart}, \textit{T. Ehrhardt} and \textit{B. Silbermann} [Sums of idempotents and logarithmic residues in matrix algebras. Operator Theory: Advances and Applications (to appear)] where logarithmic residues of analytic matrix valued functions are identified as sums of idempotent matrices. The rank decomposition theorem is the topic of the present paper. A necessary and sufficient condition is given for blank upper rectangular matrices satisfying certain rank constraints. The condition is formulated in terms of the ranks of certain submatrices of \(A\). The proof goes by reduction to an integer programming problem. This integer programming problem has a totally unimodular constraint matrix which makes it possible to utilize Farkas' lemma. In describing the contents of the paper, the authors outline the main steps. In Section 2, they use column operations to bring \(A\) into a simple ``block column reduced form. The process resembles that of reducing a matrix to column echelon form. In Section 3, the problem of decomposing \(A\) (assumed to be in ``block column form) is reduced to an integer programming problem involving \({1\over 2} k (k+1)\) equations and \({1\over 6} k (k+1)(k+ 2)\) unknowns where \(A\) can be partitioned as a block matrix \(A= (A_{ij})^k_{i,j= 1}\).
- Mixed decomposition in block integer linear programming problems
- On Block-Structured Integer Programming and Its Applications
- A decomposition procedure for one class of block programming problems
- On the Index of Block Upper Triangular Matrices
- Completing triangular block matrices with maximal and minimal ranks
- The best reduction of matrices to block-triangular form for hierarchical decomposition problems
- scientific article; zbMATH DE number 1183042
- On integer programming with bounded determinants
- Certain block problems of discrete optimization. I: A general approach to forming decomposition solution schemes
- Publication:3200881
- Finite sums of idempotents and logarithmic residues on connected domains
- scientific article; zbMATH DE number 1574892 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Logarithmic residues in Banach algebras
- Logarithmic residues, generalized idempotents, and sums of idempotents in Banach algebras
- Sums of idempotent matrices
- Sums of idempotents
- The length problem for a sum of idempotents
- When is a matrix a sum of idempotents?
- Zero sums of idempotents in Banach algebras
- Logarithmic residues, generalized idempotents, and sums of idempotents in Banach algebras
- Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs
- Unions of rank/trace complete preorders
- Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence
- Sums of idempotents and logarithmic residues in zero pattern matrix algebras
- Rank decomposition in zero pattern matrix algebras.
- Additive decomposition of matrices under rank conditions and zero pattern constraints
This page was built for publication: An integer programming problem and rank decomposition of block upper triangular matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968759)
