An iterative method for the least squares symmetric solution of matrix equation(AXB = C)
โ Scribed by Jin-jun Hou; Zhen-yun Peng; Xiang-lin Zhang
- Book ID
- 106487727
- Publisher
- Springer US
- Year
- 2006
- Tongue
- English
- Weight
- 195 KB
- Volume
- 42
- Category
- Article
- ISSN
- 1017-1398
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Based on the projection theorem m Hfibert space, by making use of the generahzed singular value decompomtion and the canomcal correlation decomposition, an analytical expression of the least-squares solutmn for the matrix equatmn (AXB, GXH) = (C, D) with the minimum-norm is derived An algorithm for
In this paper, an iterative algorithm is constructed to solve the minimum Frobenius norm residual problem: min over bisymmetric matrices. By this algorithm, for any initial bisymmetric matrix X 0 , a solution X \* can be obtained in finite iteration steps in the absence of roundoff errors, and the
In this paper, two efficient iterative methods are presented to solve the symmetric and skew symmetric solutions of a linear matrix equation AXB + CYD = E, respectively, with real pair matrices X and Y . By these two iterative methods, the solvability of the symmetric and skew symmetric solutions fo