The common \((P,Q)\) generalized reflexive and anti-reflexive solutions to \(AX=B\) and \(XC=D\) (Q295366)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The common \((P,Q)\) generalized reflexive and anti-reflexive solutions to \(AX=B\) and \(XC=D\)
scientific article

    Statements

    The common \((P,Q)\) generalized reflexive and anti-reflexive solutions to \(AX=B\) and \(XC=D\) (English)
    0 references
    0 references
    0 references
    13 June 2016
    0 references
    If \(A\) is a complex matrix, let \(A^\ast\) denote its conjugate transpose, \(A^\dag\) its Moore-Penrose inverse, and let \(E_A=I - AA^\dag\) and \(F_A=I - A^\dag A\). A square complex matrix \(P\) is called a generalized reflection matrix if \(P^\ast=P\) and \(P^{2} =I\). A complex matrix \(A\) is called a \((P,Q)\) generalized reflexive (anti-reflexive) matrix with respect to the generalized reflection matrices \(P\), \(Q\) if \(A = PAQ\) (\(A = - PAQ\)). The author considers the following pair of matrix equations: \(AX = B\) and \(XC = D\), where the matrices \(A\), \(B\), \(C\), \(D\) are given. It is well known that this system is solvable if and only if \(AA^\dag B= B\), \(DC^\dag C = D\), \(BC=AD\) and \(X = A^\dag B + F_ADC^\dag + F_AVE_C\), where \(V\) is a variable matrix. The solvability of this system under certain added constraints has been studied extensively. Motivated by this work, the author studies the \((P,Q)\) generalized reflexive and anti-reflexive solutions of the above system, presenting some new conditions for their existence and their representations and also the explicit expression for the nearest matrix in the above solution set, to a given matrix with respect to the Frobenius norm.
    0 references
    reflexive solution
    0 references
    anti-reflexive solutions
    0 references
    common solution
    0 references
    matrix equation
    0 references
    matrix nearness problem
    0 references
    Moore-Penrose inverse
    0 references
    reflection matrix
    0 references

    Identifiers