Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4958763 | Computers & Mathematics with Applications | 2017 | 19 Pages |
Abstract
Let RâCmÃm and SâCnÃn be nontrivial k-involutions if their minimal polynomials are both xkâ1 for some kâ¥2, i.e., Rkâ1=Râ1â ±I and Skâ1=Sâ1â ±I. We say that AâCmÃn is (R,S,μ)-symmetric if RASâ1=ζμA, and A is (R,S,α,μ)-symmetric if RASâα=ζμA with α,μâ{0,1,â¦,kâ1} and αâ 0. Let S be one of the subsets of all (R,S,μ)-symmetric and (R,S,α,μ)-symmetric matrices. Given XâCnÃr, YâCsÃm, BâCmÃr and DâCsÃn, we characterize the matrices A in S that minimize âAXâBâ2+âYAâDâ2 (Frobenius norm) under the assumption that R and S are unitary. Moreover, among the set S(X,Y,B,D)âS of the minimizers of âAXâBâ2+âYAâDâ2=min, we find the optimal approximate matrix AâS(X,Y,B,D) that minimizes âAâGâ to a given unstructural matrix GâCmÃn. We also present the necessary and sufficient conditions such that AX=B,YA=D is consistent in S. If the conditions are satisfied, we characterize the consistent solution set of all such A. Finally, a numerical algorithm and some numerical examples are given to illustrate the proposed results.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Wei-Ru Xu, Guo-Liang Chen,