An iterative method for the least squares solutions of the linear matrix equations with some constraint

被引:8
|
作者
Cai, Jing [1 ,2 ]
Chen, Guoliang [1 ]
机构
[1] E China Normal Univ, Dept Math, Shanghai 200062, Peoples R China
[2] Huzhou Teachers Coll, Sch Sci, Huzhou 313000, Zhejiang, Peoples R China
关键词
iterative method; linear matrix equations system; linear operator; least norm solution; optimal approximation solution; SYMMETRIC-MATRICES; AXB; ALGORITHM; PAIR;
D O I
10.1080/00207161003643005
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, an iterative method is presented to solve the following constrained minimum Frobenius norm residual problem: [GRAPHICS] where A(i) is a linear operator from R-mxn onto R-pixqi, C-i is an element of R-pixqi, i = 1, 2, ... , r, S = {X : X = B(X)}, and B is a linear self- conjugate involution operator. By this method, for any initial matrix X-0 is an element of S, a solution can be obtained in finite iteration steps in the absence of roundoff errors. The least norm solution can be derived when an appropriate initial matrix is chosen. In addition, the optimal approximation solution in the solution set of the above problem to a given matrix can also be derived by this method. Several numerical examples are given to show the efficiency of the proposed iterative method.
引用
下载
收藏
页码:634 / 649
页数:16
相关论文
共 50 条