Weighted least squares solutions to general coupled Sylvester matrix equations

Authors:
Bin Zhou;Zhao-Yan Li;Guang-Ren Duan;Yong Wang
Affiliations:
Center for Control Theory and Guidance Technology, Harbin Institute of Technology, Harbin, 150001, PR China;Department of Mathematics, Harbin Institute of Technology, Harbin, 150001, PR China;Center for Control Theory and Guidance Technology, Harbin Institute of Technology, Harbin, 150001, PR China;Department of Mathematics, Harbin Institute of Technology, Harbin, 150001, PR China
Venue:
Journal of Computational and Applied Mathematics
Year:
2009

Citing 9
Cited 11

Robust and optimal control

Robust and optimal control
Optimal Sampled-Data Control Systems

Optimal Sampled-Data Control Systems
On the generalized ADI method for the matrix equation X -AXB = C

Journal of Computational and Applied Mathematics
On Iterative Solutions of General Coupled Matrix Equations

SIAM Journal on Control and Optimization
The reflexive and anti-reflexive solutions of the matrix equation AHXB=C

Journal of Computational and Applied Mathematics
Vector least-squares solutions for coupled singular matrix equations

Journal of Computational and Applied Mathematics
Solutions to generalized Sylvester matrix equation by Schur decomposition

International Journal of Systems Science
An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation AXB=C

Journal of Computational and Applied Mathematics
Iterative solutions of coupled discrete Markovian jump Lyapunov equations

Computers & Mathematics with Applications

Iterative solutions to matrix equations of the form AiXBi=Fi

Computers & Mathematics with Applications
Matrix equations over (R,S)-symmetric and (R,S)-skew symmetric matrices

Computers & Mathematics with Applications
Iterative solutions to coupled Sylvester-conjugate matrix equations

Computers & Mathematics with Applications
On the reflexive and anti-reflexive solutions of the generalised coupled Sylvester matrix equations

International Journal of Systems Science
On the global Krylov subspace methods for solving general coupled matrix equations

Computers & Mathematics with Applications
Finite iterative algorithms for the reflexive and anti-reflexive solutions of the matrix equation A1X1B1+A2X2B2=C

Mathematical and Computer Modelling: An International Journal
Eigenstructure assignment for linear parameter-varying systems with applications

Mathematical and Computer Modelling: An International Journal
An efficient algorithm for solving general coupled matrix equations and its application

Mathematical and Computer Modelling: An International Journal
Accelerating a Recurrent Neural Network to Finite-Time Convergence for Solving Time-Varying Sylvester Equation by Using a Sign-Bi-power Activation Function

Neural Processing Letters
Efficient iterative solutions to general coupled matrix equations

International Journal of Automation and Computing
Developing Bi-CG and Bi-CR methods to solve generalized Sylvester-transpose matrix equations

International Journal of Automation and Computing

Quantified Score

Hi-index	7.29

Visualization

Abstract

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 detail 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.