An inequality for the trace of the product of two symmetric matrices

1975/03/01 by C. M. Theobald · 4 citations
Computer Science · Engineering · Mathematics · #Matrix Theory and Algorithms #graph theory and CDMA systems #Mathematical Inequalities and Applications

paper · doi:10.1017/s0305004100051070

Abstract

Let A , B be real symmetric n × n matrices having orthogonal reductions where Λ A = diag (λ 1 ( A ), …, λ n ( A )) and Λ B = diag (λ 1 ( B ), …, λ n ( B )) and the sets of latent roots are each in descending order. (Thus we may say that the latent vectors of A, B are ordered with respect to respectively.) Let the multiplicities of the roots and in order of occurrence be respectively and , so that

Cited by

• C^1,α regularity for the normalized p-Poisson problem
• Optimal stability results and nonlinear duality for L^∞ entropy and L¹ viscosity solutions
• Multi-Source Neural Activity Indices and Spatial Filters for EEG/MEG Inverse Problem: An Extension to MNE-Python
• Optimizing certain combinations of spectral and linear/distance functions over spectral sets

Related

• An inequality for the trace of matrix products, using absolute values
• A generalization of a trace inequality for positive definite matrices
• A trace inequality for positive definite matrices
• On the Distribution of the Roots of Certain Symmetric Matrices
• Maps preserving trace of products of matrices