Conditions for eigenvalue configurations of two real symmetric matrices (symmetric polynomial approach)

Given two real symmetric matrices, their eigenvalue configuration is the relative arrangement of their eigenvalues on the real line. In this paper, we consider the following problem: given two parametric real symmetric matrices and an eigenvalue configuration, find a simple condition on the parameters such that their eigenvalues have the given configuration. In this paper, we consider the problem under a mild condition that the two matrices do not share any eigenvalues. We give an algorithm which expresses the eigenvalue configuration problem as a real root counting problem of certain symmetric polynomials, whose roots can be counted using the Fundamental Theorem of Symmetric Polynomials and Descartes' rule of signs.

No reviews yet.

No comments yet.