Solving constrained matrix equations and Cramer rule (Q702646)

The authors consider the matrix equation \(AXB=D\) where the matrices with complex entries \(A\), \(B\), \(D\) are respectively \(m\times n\), \(p\times q\), \(m\times q\), under the constraints \(R(X)\subseteq T\), \(N(X)\supseteq \widetilde{S}\) for the predetermined subspaces \(T\subseteq {\mathbb C}^n (\dim T\leq \operatorname{rank} A)\), \(\widetilde{S}\subseteq {\mathbb C}^p (\dim \widetilde{S}\geq p-\operatorname{rank}B)\). Here \(R(X)\) and \(N(X)\) denote the range and the null space of the matrix \(X\). They present the solution using generalized inverses and give its explicit expression using the Cramer rule.