Eigenvalues of the Sum of Matrices from Unitary Similarity Orbits

نویسندگان

  • Chi-Kwong Li
  • Yiu-Tung Poon
  • Nung-Sing Sze
چکیده

Abstract Let A and B be n×n complex matrices. Characterization is given for the set E(A,B) of eigenvalues of matrices of the form UAU + V BV for some unitary matrices U and V . Consequences of the results are discussed and computer algorithms and programs are designed to generate the set E(A,B). The results refine those of Wielandt on normal matrices. Extensions of the results to the sum of matrices from three or more unitary similarity orbits are also considered.

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

ثبت نام

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

منابع مشابه

A quadratic inequality for sum of co-adjoint orbits

We obtain an e¤ective lower bound on the distance of sum of coadjoint orbits from the origin. Even when the distance is zero, thus the symplectic quotient is well-de…ned, our result give a nontrivial constraint on these co-adjoint orbits. In the particular case of unitary groups, we recover the quadratic inequality for eigenvalues of Hermitian matrices satisfying A+B = C: This quadratic inequal...

متن کامل

Properties of matrices with numerical ranges in a sector

Let $(A)$ be a complex $(ntimes n)$ matrix and assume that the numerical range of $(A)$ lies in the set of a sector of half angle $(alpha)$ denoted by $(S_{alpha})$. We prove the numerical ranges of the conjugate, inverse and Schur complement of any order of $(A)$ are in the same $(S_{alpha})$.The eigenvalues of some kinds of matrix product and numerical ranges of hadmard product, star-congruen...

متن کامل

Least-squares approximation by elements from matrix orbits achieved by gradient flows on compact lie groups

Let S(A) denote the orbit of a complex or real matrix A under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the best approximation of a given matrix A0 by the sum of matrices in S(A1), . . . , S(AN ) in the sense of finding the Euclidean least-squares distance min {‖X1 + · ...

متن کامل

Ranks and determinants of the sum of matrices from unitary orbits

Abstract The unitary orbit U(A) of an n×n complex matrix A is the set consisting of matrices unitarily similar to A. Given two n × n complex matrices A and B, ranks and determinants of matrices of the form X +Y with (X,Y ) ∈ U(A)×U(B) are studied. In particular, a lower bound and the best upper bound of the set R(A,B) = { rank (X + Y ) : X ∈ U(A), Y ∈ U(B)} are determined. It is shown that ∆(A,...

متن کامل

Addition of Free Unitary Random Matrices

We consider a new class of non–hermitian random matrices, namely the ones which have the form of sums of freely independent terms which involve unitary matrices. After deriving some general identities describing additive properties of unitary matrices, we solve three particular models: CUE plus CUE, CUE plus . . . plus CUE (i. e. the sum of an arbitrary number of CUE matrices), and CUE plus a r...

متن کامل

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


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

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2008