In this paper, two new matrix-form iterative methods are presented to solve the least-squares problem:
and matrix nearness problem:
where matrices and are given; 1 and 2 are the set of constraint matrices, such as symmetric, skew symmetric, bisymmetric and centrosymmetric matrices sets and SXY is the solution pair set of the minimum residual problem. These new matrix-form iterative methods have also faster convergence rate and higher accuracy than the matrix-form iterative methods proposed by Peng and Peng (Numer. Linear Algebra Appl. 2006; 13: 473–485) for solving the linear matrix equation AXB+CYD=E. Paige's algorithms, which are based on the bidiagonalization procedure of Golub and Kahan, are used as the framework for deriving these new matrix-form iterative methods. Some numerical examples illustrate the efficiency of the new matrix-form iterative methods. Copyright © 2008 John Wiley & Sons, Ltd.
[1]
Guiping Xu,et al.
ON SOLUTIONS OF MATRIX EQUATION AXB + CYD = F
,
1998
.
[2]
C. Paige.
Bidiagonalization of Matrices and Solution of Linear Equations
,
1974
.
[3]
K. Chu,et al.
Singular value and generalized singular value decompositions and the solution of linear matrix equations
,
1987
.
[4]
Zhen-yun Peng,et al.
An efficient iterative method for solving the matrix equation AXB + CYD = E
,
2006,
Numer. Linear Algebra Appl..
[5]
Yuan Lei,et al.
Best Approximate Solution of Matrix Equation AXB+CYD=E
,
2005,
SIAM J. Matrix Anal. Appl..
[6]
J. K. Baksalary,et al.
The matrix equation AXB+CYD=E
,
1980
.