Inverse Eigenvalue Problems for Two Special Acyclic Matrices

Abstract

In this paper, we study two inverse eigenvalue problems (IEPs) of constructing two special acyclic matrices. The first problem involves the reconstruction of matrices whose graph is a path, from given information on one eigenvector of the required matrix and one eigenvalue of each of its leading principal submatrices. The second problem involves reconstruction of matrices whose graph is a broom, the eigen data being the maximum and minimum eigenvalues of each of the leading principal submatrices of the required matrix. In order to solve the problems, we use the recurrence relations among leading principal minors and the property of simplicity of the extremal eigenvalues of acyclic matrices.

Keywords

• inverse eigenvalue problem
• leading principal minors
• graph of a matrix