Weighted least squares solutions to general coupled Sylvester matrix equations

This paper is concerned with weighted least squares Solutions to general coupled Sylvester matrix equations. Gradient based iterative algorithms are proposed to solve this problem. This type of iterative algorithm includes a wide class of iterative algorithms, and two special cases of them are studied in derail in this paper. Necessary and sufficient conditions guaranteeing the convergence of the proposed algorithms are presented. Sufficient conditions that are easy to compute are also given. The optimal step sizes such that the convergence rates of the algorithms, which are properly defined in this paper, are maximized and established. Several special cases of the weighted least Squares problem, Such as a least squares Solution to the coupled Sylvester matrix equations problem, solutions to the general coupled Sylvester matrix equations problem, and a Weighted least squares Solution to the linear matrix equation problem are simultaneously solved. Several numerical examples are given to illustrate the effectiveness of the proposed algorithms. (C) 2008 Elsevier B.V. All rights reserved.