Paper Info
Title
An iterative method for bisymmetric solutions and optimal approximation solution of AXB = C
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 AX̃B = C̃. © 2007 IEEE.
Year
DOI
Venue
2007
10.1109/ICNC.2007.231
Proceedings - Third International Conference on Natural Computation, ICNC 2007
Keywords
Field
DocType
null
Convergent matrix,Mathematical optimization,Matrix (mathematics),Iterative method,Mathematical analysis,Approximation theory,State-transition matrix,Centrosymmetric matrix,Mathematics,Matrix splitting,Matrix-free methods
Conference
Volume
Issue
ISSN
4
null
null
ISBN
Citations 
PageRank 
0-7695-2875-9
1
0.36
References 
Authors
1
3
Name
Order
Citations
PageRank
Yaxin Peng17316.82
Xiyan Hu212125.32
Lei Zhang3688.33