Solving and Algorithm for Least-Norm General Solution to Constrained Sylvester Matrix Equation

Abstract

Keeping in view that a lot of physical systems with inverse problems can be written by matrix equations, the least-norm of the solution to a general Sylvester matrix equation with restrictions A1X1=C1,X1B1=C2,A2X2=C3,X2B2=C4,A3X1B3+A4X2B4=Cc, is researched in this chapter. A novel expression of the general solution to this system is established and necessary and sufficient conditions for its existence are constituted. The novelty of the proposed results is not only obtaining a formal representation of the solution in terms of generalized inverses but the construction of an algorithm to find its explicit expression as well. To conduct an algorithm and numerical example, it is used the determinantal representations of the Moore–Penrose inverse previously obtained by one of the authors.