Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4628729 | Applied Mathematics and Computation | 2013 | 9 Pages |
Abstract
A matrix X is called a least-squares solution of the matrix equation AXB=CAXB=C if it minimizes the F-norm of C-AXBC-AXB, a least-rank solution of AXB=CAXB=C if it minimizes the rank of C-AXBC-AXB. These two types of solution are not necessarily the same. In this paper, we establish necessary and sufficient conditions for the two types of solutions to coincide by using some matrix rank formulas and nested decompositions of matrices.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Yongge Tian, Hongxing Wang,