Extremal inverse eigenvalue problem for symmetric doubly arrow matrices (Q2511451)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal inverse eigenvalue problem for symmetric doubly arrow matrices |
scientific article |
Statements
Extremal inverse eigenvalue problem for symmetric doubly arrow matrices (English)
0 references
5 August 2014
0 references
The authors consider the inverse eigenvalue problem for real symmetric doubly arrow matrices, given the minimal and maximal eigenvalues of all its leading principal submatrices. The results are constructive. It should be noticed that the graph underlying to these matrices is known as double star, i.e., a tree obtained by joining the centers of two stars with an edge.
0 references
double stars
0 references
symmetric doubly arrow matrix
0 references
inverse eigenvalue problem
0 references
nonnegative matrix
0 references
0 references
