The geometric mean decomposition
Let \({\mathbb C}\) be the field of complex numbers. The matrix \({\mathbb H}\) in \({\mathbb C}^{m\times m}\) is said to have a geometric mean decomposition if \({\mathbb H}\)=\textbf{QRP}\(^\star\), where \({\mathbb P}\), \({\mathbb Q}\) are matrices with orthonormal columns and \({\mathbb R}\) is a real upper triangular matrix with diagonal elements all equal to the geometric mean of the positive singular values of \({\mathbb H}\). The authors develop algorithms for computing the geometric mean decomposition of a matrix \({\mathbb H}\). The interest in this problem arose in signal processing.
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 41472 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- scientific article; zbMATH DE number 3349178 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Inequalities between the Two Kinds of Eigenvalues of a Linear Transformation
- Joint transceiver design for MIMO communications using geometric mean decomposition
- On constructing unit triangular matrices with prescribed singular values
- The generalized triangular decomposition
- Writing on dirty paper (Corresp.)
This page was built for publication: The geometric mean decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763844)