Home > Papers

 
 
On the iterative bisymmetric solution of general coupled matrix equations
Li Dongping * #,Miao Shuxin ,Zheng Bing
School of Mathematics and Statistics, Lanzhou University,
*Correspondence author
#Submitted by
Subject:
Funding: Supported by the start-up fund of Lanzhou University and the Natural Science Foundation of Gansu（No.3ZS051-A25-020）
Opened online: 5 May 2009
Accepted by: none
Citation: Li Dongping,Miao Shuxin ,Zheng Bing .On the iterative bisymmetric solution of general coupled matrix equations[OL]. [ 5 May 2009] http://en.paper.edu.cn/en_releasepaper/content/31935
 
 
A matrix A = (ai;j) 2 Rn×n is called bisymmetric matrix if ai;j = aj;i =an+1-j;n+1-i holds for all 1≤i; j≤n. In this paper, an efficient algorithm is presented to find the bisymmetric solution of the general coupled matrix equations. When the general coupled matrix equations is consistent on bisymmetric solutions, then for any initial bisymmetric matrix group, a group of bisymmetric solution can be obtained within finite iterative steps in the absence of round off errors, and the least norm bisymmetric solution can be obtained by choosing a group of special kind of initial matrices. Finally, we test the algorithm and show it is effectiveness by a numerical example.
Keywords:The general coupled matrix equations;Least norm solution;Bisymmetric solution
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 272
Bookmarked 0
Recommend 5
Comments Array
Submit your papers