On a recursive inverse eigenvalue problem
Х. Д. Икрамов · Computational Mathematics and Mathematical Physics · 2009
Let s 1, ..., s n be arbitrary complex scalars. It is required to construct an n × n normal matrix A such that s i is an eigenvalue of the leading principal submatrix A i , i = 1, 2, ..., n. It is shown that, along with the obvious diagonal solution diag(s 1, ..., s n ), this problem always admits a much more interesting nondiagonal solution A. As a rule, this solution is a dense matrix; with the diagonal solution, it shares the property that each submatrix A i is itself a normal matrix, which implies interesting connections between the spectra of the neighboring submatrices A i and A i + 1.