Some partial inverse eigenvalue problems: recovering diagonal entries of symmetric matrices Original Research Article

We investigate certain inverse problems involving symmetric matrices. In particular, given a finite list of numbers and a symmetric matrix, how many changes to the diagonal entries will suffice for the numbers in the list to be eigenvalues?