A divide-and-conquer method for constructing a pseudo-Jacobi matrix from mixed given data (Q6173922)

As a counterpart of a classical Jacobi matrix, a pseudo-Jacobi matrix is a self-adjoint matrix with respect to the symmetric bilinear form \(\langle \cdot, \cdot\rangle_{\mathcal H} \) defined by \({\mathcal H} = I_{r,n-r}: = I_r\oplus I_{n-r}\). The authors consider an inverse eigenvalue problem for this class of matrices. They construct an \(n \times n\) pseudo-Jacobi matrix from a prescribed \(n\)-tuple of distinct real numbers and a Jacobi matrix of order no less than \(\lfloor \frac n2 \rfloor\), such that its spectrum is the prescribed \(n\)-tuple and the given Jacobi matrix is its trailing principal submatrix. A divide-and-conquer scheme is used to solve this problem, and a necessary and sufficient condition under which the problem is solvable is obtained. An algorithm is presented and some illustrative numerical examples are given.