Minimization Problems for Generalized Reflexive and Generalized Anti-Reflexive Matrices

نویسنده

  • Yongxin Yuan
چکیده

Let R ∈ Cm×m and S ∈ Cn×n be nontrivial unitary involutions, i.e., R = R = R−1 = ±Im and S = S = S−1 = ±In. A ∈ Cm×n is said to be a generalized reflexive (anti-reflexive) matrix if RAS = A (RAS = −A). Let ρ be the set of m × n generalized reflexive (anti-reflexive) matrices. Given X ∈ Cn×p, Z ∈ Cm×p, Y ∈ Cm×q and W ∈ Cn×q, we characterize the matrices A in ρ that minimize ‖AX−Z‖2+‖Y HA−WH‖2, and, given an arbitrary à ∈ Cm×n, we find a unique matrix among the minimizers of ‖AX − Z‖2 + ‖Y A − WH‖2 in ρ that minimizes ‖A − Ã‖. We also obtain sufficient and necessary conditions for existence of A ∈ ρ such that AX = Z, Y A = W, and characterize the set of all such matrices A if the conditions are satisfied. These results are applied to solve a class of left and right inverse eigenproblems for generalized reflexive (anti-reflexive) matrices. Keywords—approximation, generalized reflexive matrix, generalized anti-reflexive matrix, inverse eigenvalue problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

‎Finite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices

A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$‎. ‎An $ntimes n$‎ ‎complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$)‎. ‎In this paper‎, ‎we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...

متن کامل

Iterative algorithm for the generalized ‎$‎(P‎,‎Q)‎$‎-reflexive solution of a‎ ‎quaternion matrix equation with ‎$‎j‎$‎-conjugate of the unknowns

In the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} ‎{underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$‎. ‎By this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎When the‎ ‎matrix equation is consistent over...

متن کامل

The .p;q/ Generalized Anti-reflexive Extremal Rank Solutions to a System of Matrix Equations

Let n n complex matrices P andQ be nontrivial generalized reflection matrices, i.e., P D P D P 1 ¤ In, Q DQ DQ 1 ¤ In. A complex matrix A with order n is said to be a .P;Q/ generalized anti-reflexive matrix, if PAQ D A. We in this paper mainly investigate the .P;Q/ generalized anti-reflexive maximal and minimal rank solutions to the system of matrix equation AX D B . We present necessary and su...

متن کامل

Anti-reflexive Solutions for a Class of Matrix Equations

In this paper, the generalized anti-reflexive solution for matrix equations (BX = C , XD = E), which arise in left and right inverse eigenpairs problem, is considered. With the special properties of generalized anti-reflexive matrices, the necessary and sufficient conditions for the solvability and a general expression of the solution are obtained. Furthermore, the related optimal approximation...

متن کامل

An Iterative Algorithm for the Generalized Reflexive Solutions of the Generalized Coupled Sylvester Matrix Equations

An iterative algorithm is constructed to solve the generalized coupled Sylvester matrix equations AXB − CYD,EXF − GYH M,N , which includes Sylvester and Lyapunov matrix equations as special cases, over generalized reflexive matrices X and Y . When the matrix equations are consistent, for any initial generalized reflexive matrix pair X1, Y1 , the generalized reflexive solutions can be obtained b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013