DocumentCode
1598539
Title
An Iterative Method for Bisymmetric Solutions and Optimal Approximation Solution of AXB=C
Author
Peng, Ya-Xin ; Hu, Xi-Yan ; Zhang, Lei
Author_Institution
Central South Univ., Changsha
Volume
4
fYear
2007
Firstpage
829
Lastpage
832
Abstract
The bisymmetric solutions of the matrix equation AXB = C are too difficult to be obtained by applying matrices decomposition. In this paper, an iterative method is applied to solve this problem. By this, the solvability of the equation AXB = C over bisymmetric X can be determined automatically, and its solution can be obtained in finite iterative steps when it is consistent, its least-norm solution can be obtained by choosing a special kind of starting iterative matrix, furthermore, its optimal approximation solution to a given matrix can be derived by finding the least- norm solution of a new equation AXcircB = Ccirc.
Keywords
approximation theory; iterative methods; matrix algebra; bisymmetric solutions; iterative method; matrix equation; optimal approximation solution; Computers; Econometrics; Educational institutions; Equations; Iterative methods; Mathematics; Matrix decomposition; Parameter estimation; Symmetric matrices; Tin;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation, 2007. ICNC 2007. Third International Conference on
Conference_Location
Haikou
Print_ISBN
978-0-7695-2875-5
Type
conf
DOI
10.1109/ICNC.2007.231
Filename
4344787
Link To Document