Vector least-squares solutions for coupled singular matrix equations (Q2370710)

The authors deal with the problem of computing the weighted least-squares solutions of coupled singular matrix equations. For this purpose, they apply a family of algorithms that solve the problem by means of Kronecker structures. Subsequently, they construct computationally efficient solutions of coupled restricted singular matrix equations. The need to compute the weighted Drazin and weighted Moore-Penrose inverses, and the use of \textit{Y. Tian}'s work [Linear Algebra Appl. 283, No.~1--3, 35--60 (1998; Zbl 0932.15004)] and \textit{H. Lev-Ari}'s results [Commun. Inf. Syst. 5, No.~1, 123--130 (2005; Zbl 1116.65050)] due to appearance in the solutions of these problems. The special cases of these problems are also considered which includes the coupled Sylvester matrix equations. In addition, the authors also recover the iterative methods to the weighted case in order to obtain the minimum D-norm G-vector least squares solutions for the coupled Sylvester matrix equations and the results lead to the least-squares solutions and invertible solutions, as a special case.