I would strongly assume that this must exist already somewhere but I couldn’t find the solution so I thought it would be interesting to post it here. The closest to this I could find is widely linear estimation (e.g., Picinbono, TSP, 1995), but it’s not quite the same.
Consider the following widely linear system of equations:
A⋅x+B⋅x∗=c,
where A,B∈CN×N are square invertible matrices and x,c∈CN×1 vectors of corresponding dimension. We would like to find the vector x which satisfies this equation given A, B, and c, if it exists.
This is a system of equations but it is not linear in x. It is widely linear though and this implies that it is linear in Re{x} and in Im{x}. Therefore, it can easily be rewritten as a set of linear equations by introducing the real and imaginary parts of all quantities, i.e., A=AR+ȷAI, B=BR+ȷBI, c=cR+ȷcI, and x=xR+ȷxI. Inserting this into the widely linear system of equations and separating real and imaginary parts we obtain
([AR+BR]⋅xR+[−AI+BI]⋅xI)+ȷ⋅([AI+BI]⋅xR+[AR–BR]⋅xI)=cR+ȷcI.
As both sides of the equations are complex numbers, they are equal only if the real parts are equal and the imaginary parts are equal. Hence we have two real-valued systems of equation, which we can write in one larger system:
[AR+BR−AI+BIAI+BIAR–BR]⋅[xRxI]=[cRcI].
˜C⋅[xRxI]=[cRcI].
Consequently we have exactly one solution in x if and only if the block matrix ˜C is non-singular, which implies additional conditions on A and B. For instance, a sufficient (but not necessary) condition is that AR+BR and its Schur complement AR–BR–(AI+BI)⋅(AR+BR)−1⋅(−AI+BI) are both invertible.
*Update* We found a simpler, solution, please read the follow-up blog post on the closed-form solution that avoids real-valued stacking.
Leave a comment