An optimal approximation problem for a matrix equation

Authors:
Yuanbei Deng;Daniel Boley
Affiliations:
College of Mathematics and Econometrics, Hunan University, Changsha, Hunan, People's Republic of China;Department of Computer Science and Engineering, University of Minnesota, Minneapolis, USA
Venue:
International Journal of Computer Mathematics - RECENT ADVANCES IN COMPUTATIONAL AND APPLIED MATHEMATICS IN SCIENCE AND ENGINEERING
Year:
2009

Citing 3
Cited 0

Matrix analysis

Matrix analysis
The symmetric Procrustes problem

BIT
Independence distribution preserving covariance structures for the multivariate linear model

Journal of Multivariate Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Chang and Wang discussed the consistent conditions for the symmetric solutions of the linear matrix equation (ATXA, BTXB)=(C, D) and obtained the general expressions for its symmetric solution and symmetric least-squares solution, but they could not give the minimum Frobenius norm symmetric solution for this equation or the related least-squares problem. In this paper, the explicit analytical expression of the symmetric optimal approximation solution (or the minimum Frobenius norm symmetric solution as a special case) for the least-squares problem of this linear matrix equation is obtained by using the projection theorem in the Hilbert space, the quotient singular value decomposition and the canonical correlation decomposition in the matrix theory for efficient tools; therefore, this result gives an answer to the open problem in Chang and Wang's paper in 1993.