A closed form formula for the intersection of two complex matrices under the star order (Q753890)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A closed form formula for the intersection of two complex matrices under the star order
scientific article

    Statements

    A closed form formula for the intersection of two complex matrices under the star order (English)
    0 references
    1990
    0 references
    Two complex \(m\times n\) matrices A and B are *-orthogonal (B\(\perp A)\) if \(B^*A=0\) and \(AB^*=0\) [cf. \textit{M. R. Hestenes}, Pac. J. Math. II: 225-245 (1961; Zbl 0109.247)]. It is known that the relation \(B\perp (A- B)\) introduces a partial ordering \(B\preccurlyeq A\) and a *-order on the space \(\underline C^{m,n}\) of all complex \(m\times n\) matrices. Moreover \(\underline C^{m,n}\) forms a lower semilattice, that is, for arbitrary A, \(B\in \underline C^{m,n}\) their greatest lower bound (or *-intersection) \(A\wedge B=\sup \{C\in \underline C^{m,n}| C\preccurlyeq A,C\preccurlyeq B\}\) under the *-order always exists. \textit{R. E. Hartwig} and \textit{K. Spindelböck} [Linear Multilinear Algebra 13, 323-331 (1983; Zbl 0575.15009)] presented for a certain pair of special matrices some closed form formulae for the intersection \(A\wedge B\). In the paper under review the author presents such a formula in terms of A, B, \(A^*\), \(B^*\), \(A^{\dag}\), \(B^{\dag}\), etc. for an arbitrary pair of complex matrices. He also shows how this closed form expression leads to an effective procedure for computing \(A\wedge B\).
    0 references
    star order
    0 references
    partial ordering
    0 references
    greatest lower bound
    0 references
    intersection
    0 references

    Identifiers