Inverse eigenvalue problem of unitary Hessenberg matrices (Q1040145)

Summary: Let \(H\in\mathbb C^{n\times n}\) be an \(n\times n\) unitary upper Hessenberg matrix whose subdiagonal elements are all positive, let \(H_k\) be the \(k\)th leading principal submatrix of \(H\), and let \(\widetilde H_k\) be a modified submatrix of \(H_k\). It is shown that when the minimal and maximal eigenvalues of \(\widetilde H_k\) \((k=1,2,\dots,n)\) are known, \(H\) can be constructed uniquely and efficiently. Theoretic analysis, numerical algorithm, and a small example are given.