Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4633278 | Applied Mathematics and Computation | 2009 | 13 Pages |
Abstract
We say that X=[xij]i,j=1n is symmetric centrosymmetric if xij=xji and xn-j+1,n-i+1,1⩽i,j⩽n. In this paper we present an efficient algorithm for minimizing âAXB+CYD-Eâ where â·â is the Frobenius norm, AâRtÃn,BâRnÃs,CâRtÃm,DâRmÃs,EâRtÃs and XâRnÃn is symmetric centrosymmetric with a specified central submatrix [xij]r⩽i,j⩽n-r,YâRmÃm is symmetric with a specified central submatrix [yij]1⩽i,j⩽p. Our algorithm produces suitable X and Y such that AXB+CYD=E in finitely many steps, if such X and Y exists. We show that the algorithm is stable any case, and we give results of numerical experiments that support this claim.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Jiao-fen Li, Xi-yan Hu, Lei Zhang,