A restricted signature normal form for Hermitian matrices, quasi-spectral decompositions, and applications
نویسندگان
چکیده
منابع مشابه
Perturbations of Hermitian Matrices and Applications to Spectral Symbols
It is often observed in practice that matrix sequences {An}n generated by discretization methods applied to linear differential equations, possess a Spectral Symbol, that is a measurable function describing the asymptotic distribution of the eigenvalues of An. Sequences composed by Hermitian matrices own real spectral symbols, that can be derived through the axioms of Generalized Locally Toepli...
متن کاملDecompositions and potentials for normal form games
We introduce a method of decomposing a p-player normal form game into 2p simultaneously-played component games, each distinguished by the set of “active” players whose choices influence payoffs. We then prove that a normal form game is a potential game if and only if in each of the component games, all active players have identical payoff functions, and that in this case, the sum of these share...
متن کاملCongruence of Hermitian Matrices by Hermitian Matrices
Two Hermitian matrices A, B ∈ Mn(C) are said to be Hermitian-congruent if there exists a nonsingular Hermitian matrix C ∈ Mn(C) such that B = CAC. In this paper, we give necessary and sufficient conditions for two nonsingular simultaneously unitarily diagonalizable Hermitian matrices A and B to be Hermitian-congruent. Moreover, when A and B are Hermitian-congruent, we describe the possible iner...
متن کاملHermitian matrices : Spectral coupling, plane geometry/trigonometry and optimisation
The paper presents the information processing that can be performed by a general hermitian matrix when two of its distinct eigenvalues are coupled, such as λ < λ′. Setting a = λ+λ ′ 2 and e = λ′−λ 2 > 0, the new spectral information that is provided by coupling is expressed in terms of the ratios e |a| (if λλ ′ > 0) or |a| e (if λλ ′ < 0) and of the product |a|e. The information is delivered in...
متن کاملFinding Faithful Boyce-Codd Normal Form Decompositions
It is well known that faithful (i.e. dependency preserving) decompositions of relational database schemas into Boyce-Codd Normal Form (BCNF) do not always exist, depending on the set of functional dependencies given, and that the corresponding decision problem is NPhard. The only algorithm to guarantee both faithfulness and BCNF (if possible) proposed so far in [Os79] is a brute-force approach ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1993
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)90377-z