The generalized triangular decomposition

Source abstract

Given a complex matrix H \mathbf {H} , we consider the decomposition H = Q R P ∗ \mathbf {H} = \mathbf {QRP}^* , where R \mathbf {R} is upper triangular and Q \mathbf {Q} and P \mathbf {P} have orthonormal columns. Special instances of this decomposition include the singular value decomposition (SVD) and the Schur decomposition where R \mathbf {R} is an upper triangular matrix with the eigenvalues of H \mathbf {H} on the diagonal. We show that any diagonal for R \mathbf {R} can be achieved that satisfies Weyl’s multiplicative majorization conditions: $$∏ i = 1 k | r i | ≤ ∏ i = 1 k σ i , 1 ≤ k > K , ∏ i = 1 K | r i | = ∏ i = 1 K σ i , \prod _{i=1}^k |r_{i}| \le \prod _{i=1}^k \sigma _i, \; \; 1 \le k > K, \quad \prod _{i=1}^K |r_{i}| = \prod _{i=1}^K \sigma _i,$$ where K K is the rank of H \mathbf {H} , σ i \sigma _i is the i i -th largest singular value of H \mathbf {H} , and r i r_{i} is the i i -th largest (in magnitude) diagonal element of R \mathbf {R} . Given a vector r \mathbf {r} which satisfies Weyl’s conditions, we call the decomposition H = Q R P ∗ \mathbf {H} = \mathbf {QRP}^* , where R \mathbf {R} is upper triangular with prescribed diagonal r \mathbf {r} , the generalized triangular decomposition (GTD). A direct (nonrecursive) algorithm is developed for computing the GTD. This algorithm starts with the SVD and applies a series of permutations and Givens rotations to obtain the GTD. The numerical stability of the GTD update step is established. The GTD can be used to optimize the power utilization of a communication channel, while taking into account quality of service requirements for subchannels. Another application of the GTD is to inverse eigenvalue problems where the goal is to construct matrices with prescribed eigenvalues and singular values.