On the construction of a real symmetric five-diagonal matrix from its three eigenpairs (Q2369189)

The paper focuses on the problem of constructing a real symmetric five-diagonal matrix for its three eigenpairs, which can be described as follows: \noindent Problem A: Given three different real scalars \(\lambda,\,\mu,\,\nu\) (supposed \(\lambda>\mu>\nu\)) and three real vectors of size \(n,\) \(x=[x_1,x_2,\dots,x_n]^T,\,y=[y_1,y_2,...,y_n]^T,z=[z_1,z_2,\dots,z_n]^T,\) finding a real symmetric five-diagonal matrix \(T\) of size \(n\) such that \((\lambda,x),\,(\mu,y),\,(\nu,z)\) are its three eigenpairs. The first section presents the main notations which are used in the sequel, such as \(T\) -- a real symmetric five-diagonal matrix, \(e_j\) -- the \(j\) th column of the identity matrix of size implied by the context, \(A^T\) -- the transpose of a matrix \(A.\) In the second section one derives the necessary and sufficient conditions for the existence and uniqueness of the solutions of the problem A. Writing the problem A in the form of a system of linear equations, the authors prove three theorems which give a necessary and sufficient condition for the uniqueness of the solution of Problem A and a necessary and sufficient condition for the existence of this problem. In the third section three numerical algorithms are given for finding the unique solution of Problem A, respectively a solution for this Problem. Each of them is based on the three Theorems proved in the second section. Using the above algorithms the authors present three numerical examples in order to illustrate the effectiveness of the results obtained in this paper.