Extremal inverse eigenvalue problem for symmetric doubly arrow matrices (Q2511451)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extremal inverse eigenvalue problem for symmetric doubly arrow matrices |
scientific article; zbMATH DE number 6325332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal inverse eigenvalue problem for symmetric doubly arrow matrices |
scientific article; zbMATH DE number 6325332 |
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
0 references
0.9070389866828918
0 references
0.8968272805213928
0 references
0.875060498714447
0 references
0.8363270163536072
0 references
0.8111143708229065
0 references
