We consider the following inverse extreme eigenvalue problem: given the real numbers and the real vector x(n) = (x1, x2, …, xn), to construct a nonsymmetric tridiagonal matrix and a nonsymmetric arrow matrix such that are the minimal and the maximal eigenvalues of each one of their leading principal submatrices, and is an eigenpair of the matrix. We give sufficient conditions for the existence of such matrices. Moreover our results generate an algorithmic procedure to compute a unique solution matrix.
We present a new construction of a symmetric arrow matrix from a particular spectral information: let λ(n) 1 be the minimal eigenvalue of the matrix and λj (j) , j = 1, 2, . . . , n the maximal eigenvalues of all leading principal submatrices of the matrix. We use such a procedure to construct a nonsymmetric arrow matrix from the same spectral information plus to an eigenvector x(n) = (x1, x2, . . . , xn), so that (x(n), λn (n)) is an eigenpair of the matrix. Moreover, our results generate an algorithmic procedure to compute a solution matrix.
1 October 2021 in Linear Algebra and its Applications