期刊
MATHEMATICAL METHODS IN THE APPLIED SCIENCES
卷 34, 期 13, 页码 1562-1579出版社
WILEY
DOI: 10.1002/mma.1459
关键词
matrix equation; iterative method; generalized centro-symmetric matrix; symmetric orthogonal matrix
An nxn real matrix P is said to be a symmetric orthogonal matrix if P=P-1=P-T. An nxn real matrix Y is called a generalized centro-symmetric with respect to P, if Y=PYP. It is obvious that every matrix is also a generalized centro-symmetric matrix with respect to I. In this work by extending the conjugate gradient approach, two iterative methods are proposed for solving the linear matrix equation AYB+(CYD)-D-T=E and the minimum Frobenius norm residual problem min parallel to AYB+(CYD)-D-T-E parallel to over the generalized centro-symmetric Y, respectively. By the first (second) algorithm for any initial generalized centro-symmetric matrix, a generalized centro-symmetric solution (least squares generalized centro-symmetric solution) can be obtained within a finite number of iterations in the absence of round-off errors, and the least Frobenius norm generalized centro-symmetric solution (the minimal Frobenius norm least squares generalized centro-symmetric solution) can be derived by choosing a special kind of initial generalized centro-symmetric matrices. We also obtain the optimal approximation generalized centro-symmetric solution to a given generalized centro-symmetric matrix Y-0 in the solution set of the matrix equation (minimum Frobenius norm residual problem). Finally, some numerical examples are presented to support the theoretical results of this paper. Copyright (C) 2011 John Wiley & Sons, Ltd.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据