On the inverse eigenproblem for symmetric and nonsymmetric arrowhead matrices

Inverse eigenproblems of real symmetric doubly arrowhead matrices

“…n is a generalization of a real symmetric arrowhead matrix, in the sense that, if q = 1 or q = n we have a upward or downward arrowhead matrix, respectively (see [10], [13]). The form of a matrix A (q) n is particularly special; this is obtained by a permutation of the row (or column) 1 with the row (or column) q of a symmetric upward arrowhead matrix.…”

“…In this sense, in [12], the authors consider a special kind of spectral data, this is, the minimal and maximal eigenvalues of all leading principal submatrices of A n , together with an eigenpair of it. Initially, this special kind of spectral data was introduced by Peng et al in [9], and subsequently, it has been considered by several authors (see [4], [8], [10]- [13]).…”