An Iterative Method for the Generalized Bisymmetric Solution of Matrix Equation AXB=C
首发时间:2008-02-21
Abstract:For fixed generalized reflection matrix P, i.e., P^T=P, P^2=I, then matrix X is said to be generalized bisymmetric, if $X=PXP$ and $X=X^T$. In this paper, an iterative method is established to solve the linear matrix equation $AXB=C$ over generalized bisymmetric $X$. For any initial generalized bisymmetric matrix $X_1$, when $AXB=C$ is consistent, we can obtain the generalized bisymmetric solution of the matrix equation AXB=C within finite iterative steps by the iteration method in the absence of roundoff errors; Moreover, the least-norm solution $X^*$ can be obtained by choosing a special kind of initial generalized bisymmetric matrix. In addition, the unique optimal approximation solution $\\\\\\\\\\\\\\\\hat X$ to given matrix $X_0 $ in Frobenius norm can be derived by finding the least-norm generalized bisymmetric solution $\\\\\\\\\\\\\\\\widetilde X^\\\\\\\\\\\\\\\\ast$ of the new matrix equation $A\\\\\\\\\\\\\\\\widetilde X B=\\\\\\\\\\\\\\\\widetilde C$, here, $\\\\\\\\\\\\\\\\widetilde X=X-X_0$, and $\\\\\\\\\\\\\\\\widetilde C=C-AX_0B$. Given numerical examples show that the algorithm is quite efficient.
keywords: Iterative method Generalized bisymmetric solution Least-norm solution Optimal approximation
点击查看论文中文信息
求解矩阵方程AXB=C广义双对称解的迭代解法
摘要:对于某个广义反射阵P,满足P^T=P, P^2=I, 那么称矩阵X是广义双对称的,如果满足X=PXP及X=X^T.本文给出了求解矩阵方程AXB=C广义双对称解的迭代解法.在不考虑机器误差的情况下,当矩阵方程AXB=C相容时,对任意广义双对称X_1,矩阵方程AXB=C的解可以经过有限步迭代得到;特别地,通过选择特殊地初始广义双对称矩阵极小范数解X^*.另外,对于给定矩阵X_0的最佳逼近解$\\\\\\\\\\\\\\\\hat X$,可以通过求解新的矩阵方程$A\\\\\\\\\\\\\\\\widetilde X B=\\\\\\\\\\\\\\\\widetilde C$得到(利用上述迭代解法),其中$\\\\\\\\\\\\\\\\widetilde X=X-X_0$,$\\\\\\\\\\\\\\\\widetilde C=C-AX_0B$.最后给出的数值例子说明,该算法是有效的.
基金:
论文图表:
引用
No.1876119360212035****
同行评议
共计0人参与
勘误表
求解矩阵方程AXB=C广义双对称解的迭代解法
评论
全部评论0/1000