The geometric mean decomposition (Q1763844)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The geometric mean decomposition
scientific article

    Statements

    The geometric mean decomposition (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    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.
    0 references
    geometric mean decomposition
    0 references
    matrix factorization
    0 references
    unitary factorization
    0 references
    singular value decomposition
    0 references
    Schur decomposition
    0 references
    \textbf{QR} decomposition
    0 references
    MIMO systems
    0 references
    algorithms
    0 references
    signal processing
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references